NSFSaTC-BSF: TWC: Small: Cryptography and Communication Complexity

NFSaTC-BSF：TWC：小型：密码学和通信复杂性

• 批准号: 1619348
• 负责人: Rafail Ostrovsky
• 金额: $ 50万
• 依托单位: University of California-Los Angeles
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2016
• 资助国家: 美国
• 起止时间: 2016-08-01 至 2020-07-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1619348&HistoricalAwards=false
• 关键词: NSFSaTC; BSF; TWC; Small; Cryptography

Current cloud based systems enable distributed access to both information and computational resources. In this setting, it is imperative to have secure communication, and powerful and expensive cryptographic techniques have been proposed to address this issue. A severely limiting factor, however, is that these methods for securely accessing or processing data between participating parties can result in communication overheads when processing large amounts of data. This project focuses on the question of minimizing the communication complexity of cryptography and explores new approaches for tackling them. This work could lead to wider deployment of ideas in cryptography which will result in better security and privacy for users, as well as reduced costs and increasing security for cloud service providers.The goal of this project is to investigate computationally lightweight solutions whose security can be analyzed without resorting to unproven mathematical conjectures, and diversifying the set of conjectures that suffice for provable security to be achieved. The project develops new techniques for low communication interactive proofs and arguments in order to improve their efficiency, diversify the underlying intractability assumptions, and minimize the necessary set-up assumptions. The investigators explore the possibility of reducing the communication complexity of secure computation protocols while avoiding the use of expensive general-purpose tools such as fully homomorphic encryption. The project investigates new connections between communication complexity and cryptography by using recent results and techniques for interactive compression towards minimizing information leakage in unconditionally secure protocols. The results from this project could enable new technologies for secure manipulation of big data.

当前基于云的系统支持对信息和计算资源的分布式访问。在这种情况下，安全通信势在必行，已经提出了强大而昂贵的密码技术来解决这个问题。然而，一个严重的限制因素是，这些用于在参与方之间安全地访问或处理数据的方法在处理大量数据时可能会导致通信开销。这个项目的重点是最大限度地降低密码学的通信复杂性，并探索解决这些问题的新方法。这项工作可能会导致密码学思想的更广泛应用，从而为用户带来更好的安全性和隐私，并降低成本，提高云服务提供商的安全性。该项目的目标是研究计算轻量级的解决方案，其安全性可以在不诉诸未经证实的数学猜想的情况下进行分析，并使足以实现可证明安全性的猜想集多样化。该项目开发了低沟通互动证明和论点的新技术，以提高其效率，使潜在的难以处理的假设多样化，并将必要的设置假设降至最低。研究人员探索了降低安全计算协议通信复杂性的可能性，同时避免使用昂贵的通用工具，如完全同态加密。该项目研究了通信复杂性和密码学之间的新联系，通过使用最新的结果和交互压缩技术来最小化无条件安全协议中的信息泄漏。该项目的成果可能会使安全处理大数据的新技术成为可能。