SaTC: CORE: Small: Batch Techniques for Practical Private Information Retrieval

SaTC：核心：小型：实用私人信息检索的批处理技术

• 批准号: 1718475
• 负责人: Ryan Henry
• 金额: $ 32.26万
• 依托单位: Indiana University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2017
• 资助国家: 美国
• 起止时间: 2017-09-01 至 2020-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1718475&HistoricalAwards=false
• 关键词: SaTC; CORE; Small; Batch; Techniques

Private information retrieval (PIR) is a cryptographic primitive that solves the seemingly impossible problem of letting users fetch records from untrusted and remote database servers without letting those servers learn which records the users are fetching. The research literature on PIR is vast; for over two decades, the cryptography, privacy, and theory research communities have studied PIR intensively and from a variety of perspectives; compelling applications for PIR abound in the resulting research literature. Alas, despite a series of significant advances, existing PIR techniques remain notoriously inefficient and none of the numerous PIR-based applications proposed in the research literature have been deployed at scale to protect the privacy of users "in the wild". This project entails an integrated research agenda that couples a strong theoretical component with an ambitious practical component centered around developing, analyzing, and implementing novel "batch" IT-PIR techniques, which can potentially alleviate the "prohibitive cost" problem for so-called information-theoretic private information retrieval (IT-PIR), the most performant and well-studied category of PIR protocols. Beyond improving performance, the new batch techniques also improve the "expressiveness" of PIR, exposing intuitive APIs through which applications can safely, easily, and efficiently interact with IT-PIR protocols.PIR has long provided compelling solutions in theory to a wide array of important problems, but it has seen little adoption in practice due in part to the inefficiency and limited expressiveness of existing techniques. Indeed, traditional PIR constructions let users fetch just one data record at a time by encoding the record's index (i.e., its physical locations relative to the other records in the database) in a cryptographically protected query. This project builds on preliminary results by the PI, which extend that basic functionality to not only let users fetch several records (i.e., a "batch" of records) for a lower cost than that of fetching each record separately, but also to let users fetch such batches of records using "contextual" queries that specify which data they seek, as opposed to "positional" queries that specify where those data happen to reside in the database. The main research goals are to (i) develop theoretical frameworks to better understand the mathematics underlying batch IT-PIR, to (ii) use insights gained from these frameworks to improve upon and generalize the known constructions, and to (iii) use the improved constructions to implement practical, privacy-respecting alternatives to a selection of existing privacy-agnostic products and services. The new batch IT-PIR constructions will be incorporated into the open-source Percy++ library, an effort which will deeply involve both graduate and undergraduate students.

私人信息检索（PIR）是一个加密原始性，它可以解决看似不可能的问题，即让用户从不受信任和远程数据库服务器中获取记录，而无需让这些服务器了解哪些记录用户在获取哪些记录。关于PIR的研究文献很广泛。二十年来，密码，隐私和理论研究社区从多种角度进行了深入研究PIR。在由此产生的研究文献中，PIR的吸引力比比皆是。 las，尽管有一系列的重大进展，但现有的PIR技术仍然臭名昭著，研究文献中提出的众多基于PIR的应用程序都没有进行大规模部署，以保护“野外”用户的隐私。该项目需要进行集成的研究议程，该议程将强大的理论组成与雄心勃勃的实践组成部分结合在一起，围绕开发，分析和实施新颖的“批处理” IT-PIR技术，该技术可能会缓解所谓的信息理论理论检索（IT-PIR）的“刺激性成本”问题，该问题是最绩效的，并且是PIRED和PIRED PIRED pir and PIRED for pir for pir for pir for pir for pir for pir for forpud。除了提高性能外，新的批次技术还提高了PIR的“表现力”，暴露了直观的API，应用程序可以安全，轻松，轻松，有效地与IT-PIR协议相互作用。PiR长期以来一直在理论上为广泛的重要问题提供了令人信服的解决方案，但在实践中几乎没有采用现有技术的效率和有限的现有技术的表达能力。实际上，传统的PIR构造使用户一次在密码受保护的查询中编码记录的索引（即相对于数据库中其他记录的物理位置相对于其物理位置相对于其物理位置相对于其物理位置），一次只能获取一个数据记录。该项目基于PI的初步结果，该项目扩展了基本功能，不仅让用户以比单独获取每个记录的成本更低的成本获取几个记录（即“批次”记录），还可以让用户使用这些数据来指定这些数据的“ Queries” Queries“ queries”，以便使用“上下文”查询这些数据的“上下文”询问，这些记录是“ Queries”的“ Queries”。主要的研究目标是（i）开发理论框架，以更好地了解IT-PIR的基本数学，（ii）使用从这些框架中获得的见解来改进和推广已知的结构，并（iii）使用不良的结构来实施现有的自私 - Agagagnost产品和服务。新的IT-PIR构造将被纳入开源珀西++图书馆，这将深深涉及研究生和本科生。

项目成果

Querying for Queries: Indexes of Queries for Efficient and Expressive IT-PIR

查询查询：高效且富有表现力的查询索引 IT-PIR

• DOI: 10.1145/3133956.3134008
• 发表时间: 2017
• 期刊: Proceedings of the 2017 ACM Conference on Computer and Communications Security (CCS 2017
• 作者: Hafiz, Syed Mahbub;Henry, Ryan
• 通讯作者: Henry, Ryan

There Are 10 Types of Vectors (and Polynomials): Efficient Zero-Knowledge Proofs of "One-Hotness" via Polynomials with One Zero

• DOI: 10.1145/3338498.3358640
• 发表时间: 2019-11
• 期刊: Proceedings of the 18th ACM Workshop on Privacy in the Electronic Society
• 作者: W. Black;Ryan Henry

A Bit More Than a Bit Is More Than a Bit Better

多一点就是好一点

• DOI: 10.2478/popets-2019-0061
• 发表时间: 2019
• 期刊: Proceedings on Privacy Enhancing Technologies
• 作者: Hafiz, Syed Mahbub;Henry, Ryan
• 通讯作者: Henry, Ryan