Non-interactive zero-knowledge and its applications
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Witness indistinguishable and witness hiding protocols
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
SIAM Journal on Computing
Identity-Based Encryption from the Weil Pairing
SIAM Journal on Computing
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Perfect non-interactive zero knowledge for NP
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Extractable Perfectly One-Way Functions
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Weak Verifiable Random Functions
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
An Observation on Non-Malleable Witness-Indistinguishability and Non-Malleable Zero-Knowledge
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Co-sound Zero-Knowledge with Public Keys
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
Efficient Traceable Signatures in the Standard Model
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
Transferable Constant-Size Fair E-Cash
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Practical Zero-Knowledge Proofs for Circuit Evaluation
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
Dynamic fully forward-secure group signatures
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
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
Cryptography in the multi-string model
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
A non-interactive shuffle with pairing based verifiability
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
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
Structure-preserving signatures and commitments to group elements
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Efficient traceable signatures in the standard model
Theoretical Computer Science
Decentralizing attribute-based encryption
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
On constant-round concurrent non-malleable proof systems
Information Processing Letters
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
Strong cryptography from weak secrets: building efficient PKE and IBE from distributed passwords
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Fully forward-secure group signatures
Cryptography and Security
New Techniques for Noninteractive Zero-Knowledge
Journal of the ACM (JACM)
Round-Optimal privacy-preserving protocols with smooth projective hash functions
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Beyond the limitation of prime-order bilinear groups, and round optimal blind signatures
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Leakage-Tolerant interactive protocols
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Resettable statistical zero knowledge
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Tools for simulating features of composite order bilinear groups in the prime order setting
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Practical time capsule signatures in the standard model from bilinear maps
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
A new hash-and-sign approach and structure-preserving signatures from DLIN
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Dual form signatures: an approach for proving security from static assumptions
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Group homomorphic encryption: characterizations, impossibility results, and applications
Designs, Codes and Cryptography
Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Hi-index | 0.00 |
In 2000, Dwork and Naor proved a very surprising result: that there exist “Zaps”, two-round witness-indistinguishable proofs in the plain model without a common reference string, where the Verifier asks a single question and the Prover sends back a single answer. This left open the following tantalizing question: does there exist a non-interactive witness indistinguishable proof, where the Prover sends a single message to the Verifier for some non-trivial NP-language? In 2003, Barak, Ong and Vadhan answered this question affirmatively by derandomizing Dwork and Naor's construction under a complexity theoretic assumption, namely that Hitting Set Generators against co-nondeterministic circuits exist. In this paper, we construct non-interactive Zaps for all NP-languages. We accomplish this by introducing new techniques for building Non-Interactive Zero Knowledge (NIZK) Proof and Argument systems, which we believe to be of independent interest, and then modifying these to yield our main result. Our construction is based on the Decisional Linear Assumption, which can be seen as a bilinear group variant of the Decisional Diffie-Hellman Assumption. Furthermore, our single message witness-indistinguishable proof for Circuit Satisfiability is of size O(k|C|) bits, where k is a security parameter, and |C| is the size of the circuit. This is much more efficient than previous constructions of 1- or 2-move Zaps.