Thumbnail
Access Restriction
Subscribed

Author Groth, Jens ♦ Ostrovsky, Rafail ♦ Sahai, Amit
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2012
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Cryptography ♦ Decision subgroup assumption ♦ Decisional linear assumption ♦ Groups with bilinear map ♦ Noninteractive zero-knowledge proof ♦ Universal composability ♦ Witness indistinguishability
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 $\textit{perfect}$ NIZK argument system for all NP. We construct the first universally composable NIZK argument for all NP in the presence of an $\textit{adaptive}$ adversary. We construct a non-interactive zap for all NP, which is the first that is based on a standard cryptographic security assumption.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2012-06-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 59
Issue Number 3
Page Count 35
Starting Page 1
Ending Page 35


Open content in new tab

   Open content in new tab
Source: ACM Digital Library