CT-ISG: New Directions in Cryptographic Proof Systems

CT-ISG：密码证明系统的新方向

• 批准号: 0627781
• 负责人: Amit Sahai
• 金额: $ 35万
• 依托单位: University of California-Los Angeles
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2006
• 资助国家: 美国
• 起止时间: 2006-09-15 至 2010-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0627781&HistoricalAwards=false
• 关键词: CT; ISG; New; Directions; Cryptographic

Cryptographic proof systems have played an instrumental role incryptography. The applications of cryptographic proof systems to an widearray of problems such as electronic voting, database security, secureelectronic commerce, identity management, computing on secret data,trusted computing, and networking are well know. Significant efficiencybarriers remain to the widespread use of general cryptographic proofsystems. We propose an ambitious focused research plan to overcome thesebarriers, by developing a new methodology based on elliptic-curve groupsto dramatically increase the efficiency of cryptographic proof systems.Our research plan has two main technical thrusts:(1) We propose to introduce a new technical framework for constructingnon-interactive cryptographic proof systems (such as zero-knowledgeproofs), based on a direct commit-and-prove technique. Our frameworkpromises to greatly reduce proof sizes for cryptographic proofs. In themost general setting, where we are given a boolean circuit C and wish toprove that there exists some input x such that C(x) = 1, we seek proofsthat contain only O(|C|) group elements, where |C| denotes the size of thecircuit. (2) The very act of interpreting the statement to be proven as a booleancircuit itself often introduces a substantial overhead. We observe thatthere has been considerable recent development of cryptographic schemesbased on bilinear groups. We propose to develop a set of techniques thatcan be used to directly prove a variety of interesting statements aboutessentially any cryptographic scheme based on bilinear groups.

密码证明系统在密码学中扮演了重要的角色。密码证明系统的应用广泛的问题，如电子投票，数据库安全，secureelectronic commerce，身份管理，计算上的秘密数据，可信计算和网络是众所周知的。通用密码证明系统的广泛使用仍然存在显著的效率障碍。 为了克服这些障碍，我们提出了一个雄心勃勃的研究计划，通过开发一种基于椭圆曲线群的新方法来大大提高密码证明系统的效率，我们的研究计划有两个主要的技术目标：（1）我们提出了一种新的技术框架，用于构建基于直接提交-证明技术的非交互式密码证明系统（如零知识证明）。我们的框架承诺大大减少密码证明的证明大小。在最一般的设置中，我们给定一个布尔电路C，并希望证明存在某个输入x使得C（x）= 1，我们寻求仅包含O（|C|）组元素，其中|C|表示电路的大小。(2)将被证明的语句解释为布尔电路本身的行为通常会引入大量的开销。我们观察到最近基于双线性群的密码体制有了相当大的发展。我们建议开发一套技术，可以用来直接证明各种有趣的陈述aboutessentially任何基于双线性群的加密方案。