New Techniques for Noninteractive Zero-Knowledge

Author:

Groth Jens1,Ostrovsky Rafail2,Sahai Amit2

Affiliation:

1. University College London

2. University of California, Los Angeles

Abstract

Noninteractive zero-knowledge (NIZK) proof systems are fundamental primitives used in many cryptographic constructions, including public-key encryption secure against chosen ciphertext attack, digital signatures, and various other cryptographic protocols. We introduce new techniques for constructing NIZK proofs based on groups with a bilinear map. Compared to previous constructions of NIZK proofs, our techniques yield dramatic reduction in the length of the common reference string (proportional to security parameter) and the size of the proofs (proportional to security parameter times the circuit size). Our novel techniques allow us to answer several long-standing open questions in the theory of noninteractive proofs. We construct the first perfect NIZK argument system for all NP. We construct the first universally composable NIZK argument for all NP in the presence of an adaptive adversary. We construct a non-interactive zap for all NP, which is the first that is based on a standard cryptographic security assumption.

Funder

United States-Israel Binational Science Foundation

Engineering and Physical Sciences Research Council

Office of Naval Research

National Science Foundation

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Cited by 127 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Compact NIZKs from Standard Assumptions on Bilinear Maps;Journal of Cryptology;2024-05-13

2. Delegable zk-SNARKs with proxies;Frontiers of Computer Science;2023-12-23

3. Eagle: Efficient Privacy Preserving Smart Contracts;Financial Cryptography and Data Security;2023-12-01

4. Towards Separating Computational and Statistical Differential Privacy;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

5. Generic constructions of master-key KDM secure attribute-based encryption;Designs, Codes and Cryptography;2023-09-09

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3