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
SIAM Journal on Computing
Non-interactive and non-malleable commitment
STOC '98 Proceedings of the thirtieth 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
SIAM Journal on Computing
A complete problem for statistical zero knowledge
Journal of the ACM (JACM)
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
Randomness-Optimal Characterization of Two NP Proof Systems
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Efficient and Non-interactive Non-malleable Commitment
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Non-interactive and reusable non-malleable commitment schemes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security
FOCS '99 Proceedings of the 40th 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
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Perfect zero-knowledge languages can be recognized in two rounds
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
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
Strengthening zero-knowledge protocols using signatures
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Cryptography in subgroups of Zn
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
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
Zero-knowledge from secure multiparty computation
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Deniable Authentication on the Internet
Information Security and Cryptology
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
A Framework for Efficient and Composable Oblivious Transfer
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Homomorphic Encryption and Signatures from Vector Decomposition
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
New Communication-Efficient Oblivious Transfer Protocols Based on Pairings
ISC '08 Proceedings of the 11th international conference on Information Security
Expressive Subgroup Signatures
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Simplified Submission of Inputs to Protocols
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
Weak Verifiable Random Functions
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Non-interactive Identity-Based DNF Signature Scheme and Its Extensions
Information Security and Cryptology --- ICISC 2008
Essentially Optimal Universally Composable Oblivious Transfer
Information Security and Cryptology --- ICISC 2008
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Co-sound Zero-Knowledge with Public Keys
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Efficient and secure protocols for privacy-preserving set operations
ACM Transactions on Information and System Security (TISSEC)
Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
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
A Framework for Universally Composable Non-committing Blind Signatures
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Practical Zero-Knowledge Proofs for Circuit Evaluation
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
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
Efficient ring signatures without random oracles
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Lower bounds for non-interactive zero-knowledge
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Public key encryption that allows PIR queries
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Simulatable VRFs with applications to multi-theorem NIZK
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Cryptography in the multi-string model
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Extended private information retrieval and its application in biometrics authentications
CANS'07 Proceedings of the 6th international conference on Cryptology and network security
IWSEC'07 Proceedings of the Security 2nd international conference on Advances in information and computer security
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
A latency-free election scheme
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Equivocal blind signatures and adaptive UC-security
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Efficient traceable signatures in the standard model
Theoretical Computer Science
Non-interactive confirmer signatures
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Sub-linear size traceable ring signatures without random oracles
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Fully leakage-resilient signatures
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Commuting signatures and verifiable encryption
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Decentralizing attribute-based encryption
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Revocable attribute-based signatures with adaptive security in the standard model
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Leakage-resilient zero knowledge
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
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
Efficiency preserving transformations for concurrent non-malleable zero knowledge
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Converting pairing-based cryptosystems from composite-order groups to prime-order groups
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Non-interactive zaps and new techniques for NIZK
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Honest-verifier private disjointness testing without random oracles
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
Compact group signatures without random oracles
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Sequential aggregate signatures and multisignatures without random oracles
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Multiparty computation secure against continual memory leakage
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
New Techniques for Noninteractive Zero-Knowledge
Journal of the ACM (JACM)
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
Malleable proof systems and applications
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
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
Ring signatures of sub-linear size without random oracles
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Efficient and random oracle-free conditionally anonymous ring signature
ProvSec'12 Proceedings of the 6th international conference on Provable Security
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
A more efficient computationally sound non-interactive zero-knowledge shuffle argument
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
On the (im)possibility of projecting property in prime-order setting
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Fair exchange of short signatures without trusted third party
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
Unprovable security of perfect NIZK and non-interactive non-malleable commitments
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Witness encryption and its applications
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
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 |
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, and various cryptographic protocols. What makes them especially attractive, is that they work equally well in a concurrent setting, which is notoriously hard for interactive zero-knowledge protocols. However, while for interactive zero-knowledge we know how to construct statistical zero-knowledge argument systems for all NP languages, for non-interactive zero-knowledge, this problem remained open since the inception of NIZK in the late 1980's. Here we resolve two problems regarding NIZK: We construct the first perfect NIZK argument system for any NP language. We construct the first UC-secure NIZK argument for any NP language in the presence of a dynamic/adaptive adversary. While it is already known how to construct efficient prover computational NIZK proofs for any NP language, the known techniques yield large common reference strings and large proofs. Another contribution of this paper is NIZK proofs with much shorter common reference string and proofs than previous constructions.