CAREER: Separations in Cryptography

职业：密码学分离

• 批准号: 1350939
• 负责人: Mohammad Mahmoody Ghidary
• 金额: $ 42.34万
• 依托单位: University of Virginia Main Campus
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2014
• 资助国家: 美国
• 起止时间: 2014-06-01 至 2019-05-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1350939&HistoricalAwards=false
• 关键词: CAREER; Separations; Cryptography

Since the seminal work of Shannon in 1949 cryptography has been founded on unproven computational complexity. The security of cryptographic systems could fall apart if the assumptions behind their design turn out to be false. Thus, it is crucial to base the security of crypto-systems on weakest possible assumptions. A main component of finding minimal assumptions is to ``separate'' cryptographic tasks from assumptions that are weaker than those used in constructions. In light of recent developments in cryptography, the following two directions will be pursued:New Techniques: A formal model to abstract the properties of cryptographic proofs and techniques is necessary to prove separations. Previously studied models, however, do not consider some of the most useful recent techniques in cryptography and mainly focus on uniform, black-box, and classical (non-quantum) proof techniques. A major goal of this project is to develop new foundations to model these new cryptographic techniques.New Tasks and Assumptions: Recently cryptography has gone through a revolution of exploring feasibility of highly structured crypto tasks, even if this comes at the cost of using newly introduced assumptions. The second major goal of this project is to deepen our understanding of the assumptions necessary for achieving these tasks. A closely related goal is to identify the relative power of these new tasks among themselves.To disseminate the above ideas and achieve broader impact, the project will include educational activities such as: course development, outreach to high school students to motivate them pursue degrees in theoretical computer science and cryptography, and mentoring graduate as well as undergraduate students.

自从香农在1949年的开创性工作以来，密码学一直建立在未经证实的计算复杂性之上。如果密码系统设计背后的假设被证明是错误的，那么密码系统的安全性可能会崩溃。因此，将密码系统的安全性建立在最弱的假设上是至关重要的。寻找最小假设的一个主要组成部分是将密码任务与比构造中使用的假设更弱的假设“分离”。根据密码学的最新发展，将追求以下两个方向：新技术：一个形式化的模型来抽象密码学证明和技术的属性是证明分离所必需的。然而，以前研究的模型没有考虑密码学中一些最有用的最新技术，主要集中在统一，黑盒和经典（非量子）证明技术上。该项目的一个主要目标是开发新的基础来对这些新的加密技术进行建模。新任务和假设：最近，加密技术经历了一场探索高度结构化加密任务可行性的革命，即使这是以使用新引入的假设为代价的。本项目的第二个主要目标是加深我们对实现这些任务所需假设的理解。一个密切相关的目标是确定这些新任务之间的相对力量。为了传播上述想法并实现更广泛的影响，该项目将包括教育活动，如：课程开发，向高中生推广，以激励他们攻读理论计算机科学和密码学学位，并指导研究生和本科生。