CAREER: The Theoretical Foundations of Symmetric Cryptography

职业：对称密码学的理论基础

• 批准号: 1930117
• 负责人: Stefano Tessaro
• 金额: $ 28.81万
• 依托单位: University of Washington
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2018
• 资助国家: 美国
• 起止时间: 2018-12-15 至 2022-02-28
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1930117&HistoricalAwards=false
• 关键词: CAREER; Theoretical; Foundations; Symmetric; Cryptography

Cryptography is essential to ensure confidentiality and integrity of information. Due to their practicality, symmetric algorithms ­­ where the same secret key is used by the sender and the recipient ­­ underlie most practical deployments of cryptographic techniques. However, also as a result of this, symmetric cryptography suffers from an inherent tension between real ­world efficiency demands and provable security guarantees. This project investigates new technical advances aimed at narrowing the gap between provable security and the practical demands of symmetric cryptography.The project develops new cryptographic algorithms and proof techniques, drawing from techniques in theoretical computer science, applied mathematics, and information theory. This involves the study of combinatorial problems whose solutions yield security proofs for existing and new encryption paradigms, and the development of new provably secure methods to encrypt data from arbitrary domains. The project identifies widely deployed cryptographic methods without provable security guarantees, introduces new assumptions on their components and new frameworks to validate their security with proofs, and explores the trade­off between efficiency and security of symmetric cryptographic algorithms. The project will organize an annual cryptography academy targeted at economically disadvantaged high-school students, to increase their interest and representation in computing.

密码学对于确保信息的机密性和完整性至关重要。由于其实用性，对称算法是大多数密码技术实际部署的基础，其中发送方和接收方使用相同的密钥。然而，同样由于这一点，对称密码术在现实世界的效率要求和可证明的安全保证之间存在内在的矛盾。该项目研究新的技术进展，旨在缩小可证明安全性与对称密码的实际需求之间的差距。该项目借鉴理论计算机科学、应用数学和信息论的技术，开发新的密码算法和证明技术。这涉及对组合问题的研究，这些问题的解决方案为现有的和新的加密范例提供了安全证明，以及开发新的可证明安全的方法来加密来自任意域的数据。该项目确定了没有可证明安全保证的广泛应用的密码方法，对其组件和新框架引入了新的假设以验证其安全性，并探索了对称密码算法的效率和安全性之间的权衡。该项目将针对经济困难的高中生组织一年一度的密码学院，以提高他们对计算的兴趣和代表性。