TC: Medium: Reimagining Cryptography by Identifying its Culturally-Rooted Assumptions

TC：媒介：通过识别其文化根源的假设来重新想象密码学

基本信息

批准号：
0904380
负责人：
Phillip Rogaway
金额：
$ 85万
依托单位：
University of California-Davis
依托单位国家：
美国
项目类别：
Standard Grant
财政年份：
2009
资助国家：
美国
起止时间：
2009-08-15 至 2014-09-30
项目状态：
已结题

来源：
https://www.nsf.gov/awardsearch/showAward?AWD_ID=0904380&HistoricalAwards=false
关键词：
TC Medium Reimagining Cryptography Identifying

项目摘要

This award is funded under the American Recovery and Reinvestment Act of 2009 (Public Law 111-5). In the last few years, universally composable (UC) security, defined and extensively investigated by Ran Canetti, has become a popular and important topic in modern cryptography. Canetti's notion has enormous appeal, promising a unified framework under which one can define virtually any cryptographic protocol goal, and further promising that the resulting definitions will be composable in the sense that a protocol solution for some goal will comprise a suitable primitive to use within any other protocol that desires its abstracted functionality. But UC goals are definitionally complex--in fact, the definitions can take tens of pages of English prose to simply write down, and, even then, significant ambiguities may remain. In this project, Dr. Phillip Rogaway explores an alternative descriptive language for specifying UC goals. Instead of describing the execution model in English, it will be described within the framework of code-based game-playing. Under this descriptive language, a UC definition will be described using a program, the program setting variables that induce a clear and precise notion of adversarial advantage. Dr. Rogaway will demonstrate the feasibility and practical value of his approach by applying it to universally composable signature schemes. This will be an important first step towards making unambiguous and verifiable UC definitions accessible to the general cryptographic community and those they serve.

该奖项是根据2009年《美国复苏与再投资法》（公法111-5）资助的。在过去的几年中，由Ran Canetti定义和广泛调查的普遍组合（UC）安全已成为现代密码学中的一个流行而重要的话题。 Canetti的概念具有巨大的吸引力，承诺一个统一的框架，在该框架下，人们几乎可以定义任何加密协议目标，并进一步承诺，在某种意义上，所得定义将是可以组合的，即某种目标的协议解决方案将构成适合在任何其他协议中使用其抽象功能的其他协议中使用的原始定义。但是UC目标在定义上是复杂的 - 实际上，定义可以花几十页的英语散文来简单地写下，即使那样，也可能仍然存在重大的歧义。在这个项目中，Phillip Rogaway博士探索了一种用于指定UC目标的替代描述性语言。它将在基于代码的游戏玩法的框架中描述，而不是用英语描述执行模型。在这种描述性语言下，将使用程序描述一个UC定义，即程序设置变量，这些变量引起了对抗性优势的清晰而精确的概念。 Rogaway博士将通过将其应用于普遍合成的签名方案来证明其方法的可行性和实践价值。这将是使一般密码界及其服务的人可以访问明确和可验证的UC定义的重要第一步。