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篇论文的施引文献,订阅后可以查看论文全部施引文献