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

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

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.