New Techniques for Noninteractive Zero-Knowledge

Authors:
Jens Groth;Rafail Ostrovsky;Amit Sahai
Affiliations:
University College London;University of California, Los Angeles;University of California, Los Angeles
Venue:
Journal of the ACM (JACM)
Year:
2012

Citing 39
Cited 1

The complexity of perfect zero-knowledge

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Minimum disclosure proofs of knowledge

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Non-interactive zero-knowledge and its applications

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A hard-core predicate for all one-way functions

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Statistical zero-knowledge languages can be recognized in two rounds

Journal of Computer and System Sciences
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
Noninteractive zero-knowledge

SIAM Journal on Computing
Adaptively secure multi-party computation

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Computational Complexity and Knowledge Complexity

SIAM Journal on Computing
Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions

SIAM Journal on Computing
Universally composable two-party and multi-party secure computation

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Nonmalleable Cryptography

SIAM Journal on Computing
A complete problem for statistical zero knowledge

Journal of the ACM (JACM)
Identity-Based Encryption from the Weil Pairing

SIAM Journal on Computing
Non-Interactive Zero-Knowledge: A Low-Randomness Characterization of NP

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Image Density is Complete for Non-Interactive-SZK (Extended Abstract)

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Robust Non-interactive Zero Knowledge

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Zaps and their applications

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Universally Composable Security: A New Paradigm for Cryptographic Protocols

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Strengthening Zero-Knowledge Protocols Using Signatures

Journal of Cryptology
Derandomization in Cryptography

SIAM Journal on Computing
Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
A Framework for Efficient and Composable Oblivious Transfer

CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening

EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Non-interactive circuit based proofs and non-interactive perfect zero-knowledge with preprocessing

EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Full-domain subgroup hiding and constant-size group signatures

PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Perfect NIZK with adaptive soundness

TCC'07 Proceedings of the 4th conference on Theory of cryptography
Efficient non-interactive proof systems for bilinear groups

EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Cryptography and game theory: designing protocols for exchanging information

TCC'08 Proceedings of the 5th conference on Theory of cryptography
Simulation-sound NIZK proofs for a practical language and constant size group signatures

ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Evaluating 2-DNF formulas on ciphertexts

TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Unconditional characterizations of non-interactive zero-knowledge

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Non-interactive zaps and new techniques for NIZK

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Perfect non-interactive zero knowledge for NP

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Compact group signatures without random oracles

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Lossy encryption: constructions from general assumptions and efficient selective opening chosen ciphertext security

ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security

A more efficient computationally sound non-interactive zero-knowledge shuffle argument

Journal of Computer Security - Advances in Security for Communication Networks

Quantified Score

Hi-index	0.00

Visualization

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.