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.

当前基于云的系统启用分布式访问信息和计算资源。在这种情况下，必须进行安全的通信，并提出了强大而昂贵的加密技术来解决此问题。 但是，一个严重的限制因素是，这些用于安全访问或处理参与方之间数据的方法在处理大量数据时可能会导致通信开销。该项目着重于最大程度地减少密码学的沟通复杂性的问题，并探索解决方案的新方法。 这项工作可能会导致密码学中更广泛的思想部署，这将为用户带来更好的安全性和隐私，以及降低的成本和提高云服务提供商的安全性。该项目的目的是调查计算上的轻量级解决方案，这些解决方案可以分析其安全性，而无需诉诸于不证实的数学猜想，并使其能够实现不可能的安全性，以使其能够实现良好的安全性。该项目为低沟通互动证明和论点开发了新技术，以提高其效率，使潜在的棘手性假设多样化，并最大程度地减少必要的设置假设。研究人员探索了降低安全计算协议的通信复杂性的可能性，同时避免使用昂贵的通用工具，例如完全同构加密。该项目通过使用最新结果和技术来调查通信复杂性和密码学之间的新连接，以最大程度地减少无条件安全协议中的信息泄漏。 该项目的结果可以使新技术能够安全地操纵大数据。