SaTC: CORE: Small: Secure Computation on Large Data

SaTC：核心：小型：大数据安全计算

• 批准号: 1817143
• 负责人: Stanislaw Jarecki
• 金额: $ 50万
• 依托单位: University of California-Irvine
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2018
• 资助国家: 美国
• 起止时间: 2018-10-01 至 2021-09-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1817143&HistoricalAwards=false
• 关键词: SaTC; CORE; Small; Secure; Computation

This project focuses on secure computation protocols that can efficiently compute on large data. Secure computation is a fundamental and very general notion in cryptography that captures privacy-preserving computation of any algorithm on data which originates from multiple sources and should be kept private except for what is revealed by the computation output. Possible applications of secure computation include public policy, to detect financial fraud or other emergency markers using data held by different public or private entities; medicine, to find matches between drugs and patients' medical histories while keeping both private; finance, to enable private auctions; network security, to identify large-scale virus attacks using network data from different organizations; or privacy-protecting internet services, e.g. to allow privacy-protecting database search.Secure computation has seen great progress in bringing feasibility results closer to practice. However, until very recently efficient secure computation was possible only for programs which compute on short inputs. A key tool for extending secure computation to the case of large inputs is a protocol for Secure Computation for Random Access Memory (SC-RAM), i.e., a protocol that reads or writes secret-shared data to a chosen location in a large secret-shared array without leaking the address of the accessed location. Efficient SC-RAM implementations will enable secure computation to scale to arbitrarily large data, and this project seeks to develop SC-RAM protocols which perform this task efficiently. The focus of this work is on the case where the shared computation is performed by three parties, for which both generic and special-purpose low-latency and high-throughput protocols will be developed, optimizing SC-RAM for a variety of settings, depending on the number and size of data records, network topology, read vs. write access, support for batch reads, and other considerations. The work as part of this project will also include prototype implementations which will be made public, integrated in a development environment so that they can be easily adopted by developers of secure computation protocol applications.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

该项目的重点是安全计算协议，可以有效地计算大数据。 安全计算是密码学中的一个基本且非常通用的概念，它捕获任何算法对数据的隐私保护计算，这些数据来自多个来源，并且除了计算输出所揭示的内容之外，应该保持私有。 安全计算的可能应用包括公共政策，使用不同公共或私人实体持有的数据来检测金融欺诈或其他紧急标记;医学，在药物和患者病史之间找到匹配，同时保持隐私;金融，使私人拍卖成为可能;网络安全，使用来自不同组织的网络数据来识别大规模病毒攻击;或隐私保护互联网服务，例如允许隐私保护数据库搜索。安全计算在使可行性结果更接近实践方面取得了巨大进展。然而，直到最近，有效的安全计算是可能的，只有在短输入计算的程序。 用于将安全计算扩展到大输入情况的关键工具是用于随机存取存储器（SC-RAM）的安全计算的协议，即，一种协议，用于在大型秘密共享阵列中的选定位置读取或写入秘密共享数据，而不会泄露所访问位置的地址。 高效的SC-RAM实现将使安全计算能够扩展到任意大的数据，该项目旨在开发高效执行此任务的SC-RAM协议。 这项工作的重点是由三方执行共享计算的情况，为此将开发通用和专用的低延迟和高吞吐量协议，根据数据记录的数量和大小，网络拓扑，读与写访问，支持批量读取和其他考虑因素，优化SC-RAM。作为该项目的一部分，该工作还将包括原型实现，这些原型实现将被公开，集成在开发环境中，以便安全计算协议应用程序的开发人员可以轻松采用。该奖项反映了NSF的法定使命，并通过使用基金会的智力价值和更广泛的影响审查标准进行评估，被认为值得支持。

项目成果

Updatable Oblivious Key Management for Storage Systems

• DOI: 10.1145/3319535.3363196
• 发表时间: 2019-11
• 期刊: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security
• 作者: Stanislaw Jarecki;H. Krawczyk;Jason K. Resch

Strong Asymmetric PAKE based on Trapdoor CKEM

• DOI: 10.1007/978-3-030-26954-8_26
• 发表时间: 2019-08
• 作者: Tatiana Bradley;Stanislaw Jarecki;Jiayu Xu

Building and Studying a Password Store that Perfectly Hides Passwords from Itself

构建和研究一个完美隐藏密码的密码存储

• DOI: 10.1109/tdsc.2019.2902551
• 发表时间: 2019
• 期刊: IEEE Transactions on Dependable and Secure Computing
• 影响因子: 7.3
• 作者: Shirvanian, Maliheh;Saxena, Nitesh;Jarecki, Stanislaw;Krawczyk, Hugo
• 通讯作者: Krawczyk, Hugo

Password-Authenticated Public-Key Encryption

• DOI: 10.1007/978-3-030-21568-2_22
• 发表时间: 2019-06
• 期刊: IACR Cryptol. ePrint Arch.
• 作者: Tatiana Bradley;J. Camenisch;Stanislaw Jarecki;Anja Lehmann;G. Neven;Jiayu Xu

On Pseudorandom Encodings

关于伪随机编码

• DOI: 10.1007/978-3-030-64381-2_23
• 发表时间: 2020
• 期刊: TCC 2020
• 作者: Agrikola, Thomas;Couteau, Geoffroy;Ishai, Yuval;Jarecki, Stanislaw;Sahai, Amit
• 通讯作者: Sahai, Amit