Minimum disclosure proofs of knowledge

DOI10.1016/0022-0000(88)90005-0zbMath0656.68109WikidataQ115188638 ScholiaQ115188638MaRDI QIDQ1110348

Gilles Brassard, Claude Crépeau, David Chaum

Publication date: 1988

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/1679

zbMATH Keywords

protocols; interactive proof; minimum disclosure proof

Mathematics Subject Classification ID

94A60: Cryptography

68T99: Artificial intelligence

Related Items

Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, An Equivalence Between Zero Knowledge and Commitments, The Complexity of Zero Knowledge, A language-dependent cryptographic primitive, Constant-round perfect zero-knowledge computationally convincing protocols, Bit commitment using pseudorandomness, Secure circuit evaluation. A protocol based on hiding information from an oracle, A discrete logarithm implementation of perfect zero-knowledge blobs, Tight bounds for the multiplicative complexity of symmetric functions, Elliptic curve implementation of zero-knowledge blobs, An almost-constant round interactive zero-knowledge proof, A uniform-complexity treatment of encryption and zero-knowledge, On the communication complexity of zero-knowledge proofs, A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm, On hiding information from an oracle, Definitions and properties of zero-knowledge proof systems, The knowledge complexity of quadratic residuosity languages, On the existence of statistically hiding bit commitment schemes and fail-stop signatures, Practical proofs of knowledge without relying on theoretical proofs of membership on languages, Practical and provably secure release of a secret and exchange of signatures, On relationships between statistical zero-knowledge proofs, Signcryption with non-interactive non-repudiation, Succinct NP Proofs from an Extractability Assumption, Perfect Non-interactive Zero Knowledge for NP, Polylogarithmic two-round argument systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Quantum cryptography: public key distribution and coin tossing
• A discrete logarithm implementation of perfect zero-knowledge blobs
• Probabilistic encryption
• Games against nature
• An Update on Quantum Cryptography
• Simultaneous Security of Bits in the Discrete Log
• Zero-Knowledge Simulation of Boolean Circuits
• New directions in cryptography
• Coin flipping by telephone a protocol for solving impossible problems
• Every Prime Has a Succinct Certificate
• A Fast Monte-Carlo Test for Primality
• Computational Complexity of Probabilistic Turing Machines
• The knowledge complexity of interactive proof-systems
• Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?