TWC: Small: Functional Reactive Cryptography

TWC：小：功能反应式密码学

• 批准号: 1528068
• 负责人: Daniele Micciancio
• 金额: $ 50万
• 依托单位: University of California-San Diego
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2015
• 资助国家: 美国
• 起止时间: 2015-10-01 至 2019-09-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1528068&HistoricalAwards=false
• 关键词: TWC; Small; Functional; Reactive; Cryptography

Cryptographic protocols are a fundamental tool to secure distributed computer applications, but also notoriously hard to design and analyze. With modern computer applications becoming increasingly complex, interconnected, distributed and interactive, there is a pressing need to improve the researchers' ability to design and analyze protocols that go well beyond the traditional problem of secure message transmission. This research investigates frameworks to improve the way cryptographic protocols are designed and analyzed, by investigating new mathematical models of computation specifically targeted to security analysis. These methods will allow security analysis of more complex applications, and also to improve public confidence in the analysis itself. This project explores computation models where time is only treated implicitly, through logical dependencies. Avoiding the explicit modeling of time greatly simplifies the analysis of cryptographic protocols, still capturing timing constraints that are relevant to security properties. Different communication and security models are considered, and compared to each other via reductions, with respect to security guarantees, their ability to capture realistic attacks, and expressiveness in describing protocols of cryptographic interest. Models are evaluated by exemplifying their use in the analysis of a set of representative case studies, including Oblivious Transfer protocols, and protocols for secure multiparty computation. These tools and techniques will help developers to more easily reason about the security of a wider range of applications, and lead to more secure and trustworthy software.

密码协议是保护分布式计算机应用程序的基本工具，但也是众所周知的难以设计和分析。随着现代计算机应用变得越来越复杂，互联，分布式和交互式，有一个迫切需要提高研究人员的能力，设计和分析协议，远远超出了传统的安全消息传输的问题。本研究调查框架，以改善密码协议的设计和分析的方式，通过调查新的数学模型的计算专门针对安全分析。这些方法将允许对更复杂的应用程序进行安全分析，并提高公众对分析本身的信心。 这个项目探索了计算模型，其中时间只被隐式地处理，通过逻辑依赖关系。避免时间的显式建模大大简化了密码协议的分析，仍然捕获与安全属性相关的时间约束。不同的通信和安全模型被认为是，并通过减少相互比较，相对于安全保证，他们的能力来捕捉现实的攻击，并在描述协议的加密利益的表现力。模型进行评估，举例说明他们的使用在一组有代表性的案例研究，包括不经意传输协议，安全多方计算协议的分析。这些工具和技术将帮助开发人员更容易地推理更广泛的应用程序的安全性，并导致更安全和更值得信赖的软件。