Minimum disclosure proofs of knowledge

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

Claude Crépeau, Gilles Brassard, 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

Cryptography (94A60) Artificial intelligence (68T99)

Related Items

Concurrent knowledge extraction in public-key models, The knowledge complexity of quadratic residuosity languages, Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes, On the complexity of interactive proofs with bounded communication, Constant-round leakage-resilient zero-knowledge from collision resistance, Probabilistic proof systems — A survey, Succinct non-interactive arguments via linear interactive proofs, Robust and Efficient Sharing of RSA Functions, Mercurial commitments with applications to zero-knowledge sets, Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge, 3-Message Zero Knowledge Against Human Ignorance, On the (In)Security of SNARKs in the Presence of Oracles, Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement, Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting, Interactive Oracle Proofs, Practical and provably secure release of a secret and exchange of signatures, On the existence of statistically hiding bit commitment schemes and fail-stop signatures, Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms, Efficient chameleon hash functions in the enhanced collision resistant model, Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier, Online-extractability in the quantum random-oracle model, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, Succinct arguments in the quantum random oracle model, Long-term security and universal composability, Secure commitment against a powerful adversary, On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits, Precise zero-knowledge arguments with poly-logarithmic efficiency, On sequential composition of precise zero-knowledge, Practical proofs of knowledge without relying on theoretical proofs of membership on languages, Super-Perfect Zero-Knowledge Proofs, Statistical concurrent non-malleable zero-knowledge from one-way functions, Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract), On-line/off-line DCR-based homomorphic encryption and applications, Non-black-box simulation in the fully concurrent setting, revisited, Succinct NP Proofs from an Extractability Assumption, Spreading alerts quietly and the subgroup escape problem, Parallel repetition of computationally sound protocols revisited, Which languages have 4-round zero-knowledge proofs?, The hunting of the SNARK, On the impossibility of non-static quantum bit commitment between two parties, Individual simulations, Post-quantum resettably-sound zero knowledge, Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness, Leakproof secret sharing protocols with applications to group identification scheme, Secret handshakes: full dynamicity, deniability and lattice-based design, Secure circuit evaluation. A protocol based on hiding information from an oracle, A discrete logarithm implementation of perfect zero-knowledge blobs, Short undeniable signatures based on group homomorphisms, A new interactive hashing theorem, Cheat sensitive quantum bit commitment via pre- and post-selected quantum states, Tight bounds for the multiplicative complexity of symmetric functions, Elliptic curve implementation of zero-knowledge blobs, On relationships between statistical zero-knowledge proofs, A language-dependent cryptographic primitive, Fully Simulatable Quantum-Secure Coin-Flipping and Applications, S-money: virtual tokens for a relativistic economy, An almost-constant round interactive zero-knowledge proof, Efficient non-malleable commitment schemes, A uniform-complexity treatment of encryption and zero-knowledge, Chameleon-Hashes with Ephemeral Trapdoors, How to Verify a Quantum Computation, New receipt-free voting scheme using double-trapdoor commitment, Efficient non-malleable commitment schemes, Perfect Non-interactive Zero Knowledge for NP, Identity-based trapdoor mercurial commitments and applications, An Equivalence Between Zero Knowledge and Commitments, Polylogarithmic two-round argument systems, Verifying quantum computations at scale: A cryptographic leash on quantum devices, The Complexity of Zero Knowledge, On the communication complexity of zero-knowledge proofs, A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm, One-Time Signatures and Chameleon Hash Functions, On hiding information from an oracle, On the power of secure two-party computation, Four-Round Zero-Knowledge Arguments of Knowledge with Strict Polynomial-Time Simulation from Differing-Input Obfuscation for Circuits, Threshold ring signatures: new definitions and post-quantum security, Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions, Precise Time and Space Simulatable Zero-Knowledge, Hybrid commitments and their applications to zero-knowledge proof systems, Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge, Group encryption: full dynamicity, message filtering and code-based instantiation, On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs, Reducing complexity assumptions for statistically-hiding commitment, On the Existence of Extractable One-Way Functions, New approaches for deniable authentication, An Efficient Parallel Repetition Theorem, Unnamed Item, Constant-Round Nonmalleable Commitments from Any One-Way Function, Signcryption with non-interactive non-repudiation, Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments, How to Challenge and Cast Your e-Vote, On succinct arguments and witness encryption from groups, Spartan: efficient and general-purpose zkSNARKs without trusted setup, Constant-round perfect zero-knowledge computationally convincing protocols, Bit commitment using pseudorandomness, Hashing Garbled Circuits for Free, Oblivious transfer based on single-qubit rotations, Definitions and properties of zero-knowledge proof systems, Zero-knowledge proofs for committed symmetric Boolean functions, Provably unforgeable threshold EdDSA with an offline participant and trustless setup, Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract), A coercion-resistant blockchain-based E-voting protocol with receipts, Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract), What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?, Concurrently composable non-interactive secure computation, Individual cryptography, Forward-secure revocable secret handshakes from lattices, Impossibilities in succinct arguments: black-box extraction and more, Non-interactive zero-knowledge from non-interactive batch arguments

Cites Work