NSFSaTC-BSF: TWC: Small: Horizons of Symmetric-Key Cryptography

NFSaTC-BSF：TWC：小：对称密钥密码学的视野

• 批准号: 1606362
• 负责人: Chris Peikert
• 金额: $ 50万
• 依托单位: Regents of the University of Michigan - Ann Arbor
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2015
• 资助国家: 美国
• 起止时间: 2015-09-01 至 2018-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1606362&HistoricalAwards=false
• 关键词: NSFSaTC; BSF; TWC; Small; Horizons

Symmetric-key primitives are the lifeblood of practical cryptography, and are critical components of nearly any computer security system. The cryptographic community has developed a rich body of work on theoretically sound symmetric objects, but they are many orders of magnitude too slow for realistic usage. Thus, practitioners use fast primitives that have been designed to withstand known attacks, but which lack rigorous security guarantees based on natural mathematical problems. Recent results demonstrate that symmetric primitives based on theoretically sound designs can also enjoy realistic levels of efficiency. This project leverages this insight to demonstrate the feasibility, efficiency, and broad applicability of a wide array of new symmetric objects to enable new security applications.The focus of this project is the design of theoretically sound and computationally efficient symmetric-key cryptographic schemes. These will range from basic primitives like pseudorandom functions and block ciphers; to applications like proof systems, digital signatures, functional encryption, and broadcast encryption, and will also include practical implementations such as fully homomorphic evaluation of symmetric-key primitives. A core theme of this research is to exploit the algebraic structure, and to demonstrate feasibility of symmetric-key objects in settings where public-key ones appear significantly more difficult (or impossible) to obtain. The project will also develop open-source software library that exhibits these constructions in practice, and facilitates further implementations.

对称密钥原语是实用密码学的命脉，并且是几乎所有计算机安全系统的关键组件。 密码学社区已经在理论上完善的对称对象上开发了丰富的工作，但它们对于实际使用来说太慢了许多数量级。 因此，从业者使用旨在抵御已知攻击的快速原语，但缺乏基于自然数学问题的严格安全保证。最近的结果表明，基于理论上合理设计的对称基元也可以享有现实的效率水平。该项目利用这一见解来证明各种新对称对象的可行性、效率和广泛适用性，以实现新的安全应用。该项目的重点是设计理论上合理且计算高效的对称密钥加密方案。 这些范围包括伪随机函数和分组密码等基本原语；涉及证明系统、数字签名、函数加密和广播加密等应用，并且还将包括实际实现，例如对称密钥原语的完全同态评估。这项研究的核心主题是利用代数结构，并证明在公钥对象似乎更难以（或不可能）获得的情况下对称密钥对象的可行性。该项目还将开发开源软件库，在实践中展示这些结构，并促进进一步的实施。