How to prove all NP-statements in zero-knowledge, and a methodology of cryptographic protocol design
Proceedings on Advances in cryptology---CRYPTO '86
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Cryptographic capsules: a disjunctive primitive for interactive protocols
Proceedings on Advances in cryptology---CRYPTO '86
Zero-knowledge simulation of Boolean circuits
Proceedings on Advances in cryptology---CRYPTO '86
Subliminal-free authentication and signature
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Everything provable is provable in zero-knowledge
CRYPTO '88 Proceedings on Advances in cryptology
A perfect zero-knowledge proof for a problem equivalent to discrete logarithm
CRYPTO '88 Proceedings on Advances in cryptology
Zero-knowledge with finite state verifiers (invited talk)
CRYPTO '88 Proceedings on Advances in cryptology
A modification of the Fiat-Shamir scheme
CRYPTO '88 Proceedings on Advances in cryptology
Proving security against chosen cyphertext attacks
CRYPTO '88 Proceedings on Advances in cryptology
Non-interactive zero-knowledge with preprocessing
CRYPTO '88 Proceedings on Advances in cryptology
CRYPTO '88 Proceedings on Advances in cryptology
On generating solved instances of computational problems
CRYPTO '88 Proceedings on Advances in cryptology
CRYPTO '88 Proceedings on Advances in cryptology
A universal problem in secure and verifiable distributed computation
CRYPTO '88 Proceedings on Advances in cryptology
CRYPTO '88 Proceedings on Advances in cryptology
The (true) complexity of statistical zero knowledge
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Public-randomness in public-key cryptography (extended abstract)
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
A remark on signature scheme where forgery can be proved
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Making conditionally secure cryptosystems unconditionally abuse-free in a general context
CRYPTO '89 Proceedings on Advances in cryptology
On the existence of bit commitment schemes and zero-knowledge proofs
CRYPTO '89 Proceedings on Advances in cryptology
Sparse pseudorandom distributions (extended abstract)
CRYPTO '89 Proceedings on Advances in cryptology
Bit commitment using pseudo-randomness (extended abstract)
CRYPTO '89 Proceedings on Advances in cryptology
Disposable zero-knowledge authentications and their applications to untraceable electronic cash
CRYPTO '89 Proceedings on Advances in cryptology
Efficient identification schemes using two prover interactive proofs
CRYPTO '89 Proceedings on Advances in cryptology
On the concrete complexity of zero-knowledge proofs
CRYPTO '89 Proceedings on Advances in cryptology
Zero knowledge proofs of knowledge in two rounds
CRYPTO '89 Proceedings on Advances in cryptology
Controlled gradual disclosure schemes for random bits and their applications
CRYPTO '89 Proceedings on Advances in cryptology
CRYPTO '89 Proceedings on Advances in cryptology
A note on efficient zero-knowledge proofs and arguments (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Practical and provably secure release of a secret and exchange of signatures
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Interactive hashing simplifies zero-knowledge protocol design
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
One-way accumulators: a decentralized alternative to digital signatures
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Linear zero-knowledge—a note on efficient zero-knowledge proofs and arguments
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Security-preserving hardness-amplification for any regular one-way function
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Electronic Jury Voting Protocols
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
An Impersonation-Proof Identity Verfication Scheme
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
A Natural Taxonomy for Digital Information Authentication Schemes
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Non-Interactive Zero-Knowledge Proof Systems
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
How to Solve any Protocol Problem - An Efficiency Improvement
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Direct Minimum-Knowledge Computations
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Convertible Undeniable Signatures
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Collective Coin Tossing Without Assumptions nor Broadcasting
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Quantum Bit Commitment and Coin Tossing Protocols
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Interactive Proofs with Provable Security Against Honest Verifiers
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Crptograpic Applications of the Non-Interactive Metaproof and Many-Prover Systems
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
A One-Round, Two-Prover, Zero-Knowledge Protocol for NP
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Efficient Multiparty Protocols Using Circuit Randomization
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Foundations of Secure Interactive Computing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
On the Discrepancy between Serial and Parallel of Zero-Knowledge Protocols (Extended Abstract)
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Certifying Cryptographic Tools: The Case of Trapdoor Permutations
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Secret Sharing and Perfect Zero Knowledge
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Designated Confirmer Signatures and Public-Key Encryption are Equivalent
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Honest Verifier vs Dishonest Verifier in Public Cain Zero-Knowledge Proofs
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Robust and Efficient Sharing of RSA Functions
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Adaptively Secure Oblivious Transfer
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Computational Complexity and Mathematical Proofs
Informatics - 10 Years Back. 10 Years Ahead.
Introduction to Secure Computation
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
Signing Contracts and Paying Electronically
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
Undeniable Confirmer Signature
ISW '99 Proceedings of the Second International Workshop on Information Security
How to Utilize the Randomness of Zero-Knowledge Proofs
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Robust Distributed Multiplicaton with out Interaction
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Commitment Schemes and Zero-Knowledge Protocols
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
Authentication without Identification
IEEE Security and Privacy
A practical scheme for non-interactive verifiable secret sharing
SFCS '87 Proceedings of the 28th 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
Interactive proof systems: Provers that never fail and random selection
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Random self-reducibility and zero knowledge interactive proofs of possession of information
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
On the cunning power of cheating verifiers: Some observations about zero knowledge proofs
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Revisiting the Efficiency of Malicious Two-Party Computation
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
An Indistinguishability-Based Characterization of Anonymous Channels
PETS '08 Proceedings of the 8th international symposium on Privacy Enhancing Technologies
MPC vs. SFE: Unconditional and Computational Security
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A note on universal composable zero-knowledge in the common reference string model
Theoretical Computer Science
A note on the feasibility of generalised universal composability†
Mathematical Structures in Computer Science
Simulation-Based Concurrent Non-malleable Commitments and Decommitments
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
LEGO for Two-Party Secure Computation
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
On the Security Loss in Cryptographic Reductions
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Towards a Theory of Universally Composable Cloud Computing
CloudCom '09 Proceedings of the 1st International Conference on Cloud Computing
Non-committing Encryptions Based on Oblivious Naor-Pinkas Cryptosystems
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Direct zero knowledge proofs of computational power in five rounds
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
On the complexity of hyperelliptic discrete logarithm problem
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Cryptographic protocols provably secure against dynamic adversaries
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Secure bit commitment function against divertibility
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Recycling random bits in composed perfect zero-knowledge
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Minimal-latency secure function evaluation
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Algorithms for selfish agents mechanism design for distributed computation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
A note on universal composable zero knowledge in common reference string model
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
A note on the feasibility of generalized universal composability
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
P-signatures and noninteractive anonymous credentials
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Adaptive and composable non-committing encryptions
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Access controls for oblivious and anonymous systems
ACM Transactions on Information and System Security (TISSEC)
A general, flexible and efficient proof of inclusion and exclusion
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Functional encryption: definitions and challenges
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Error-free, multi-bit non-committing encryption with constant round complexity
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Evaluating 2-DNF formulas on ciphertexts
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Efficiency tradeoffs for malicious two-party computation
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
SIMPL systems as a keyless cryptographic and security primitive
Cryptography and Security
A note on (im)possibilities of obfuscating programs of zero-knowledge proofs of knowledge
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Research note: Group commitment protocol based on zero knowledge proofs
Computer Communications
Research: Towards a formal system-to-system authentication protocol
Computer Communications
A general, flexible and efficient proof of inclusion and exclusion
INTRUST'11 Proceedings of the Third international conference on Trusted Systems
On the (non-)equivalence of UC security notions
ProvSec'12 Proceedings of the 6th international conference on Provable Security
On using probabilistic Turing machines to model participants in cryptographic protocols
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper we demonstrate the generality and wide applicability of zero-knowledge proofs, a notion introduced by Goldwasser, Micali and Rackoff. These are probabilistic and interactive proofs that, for the members x of a language L, efficiently demonstrate membership in the language without conveying any additional knowledge. So far, zero-knowledge proofs were known only for some number theoretic languages in NP ∩ Co-NP.