Zero-knowledge proofs and string commitments withstanding quantum attacks

DOI10.1007/978-3-540-28628-8_16MaRDI QIDQ5311537zbMATH OpenOpenAlexDBLPFDO

Authors Serge Fehr, Louis Salvail, Ivan B. Damgård

Publication date 23 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b99099

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum computation (81P68) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Computationally binding quantum commitments
• Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks
• Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP

Cited in

(20)

• A non-PCP approach to succinct quantum-safe zero-knowledge
• A black-box approach to post-quantum zero-knowledge in constant rounds
• Post-quantum resettably-sound zero knowledge
• Collapse-binding quantum commitments without random oracles
• Fully simulatable quantum-secure coin-flipping and applications
• Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks
• Computational indistinguishability between quantum states and its cryptographic application
• Spatial Isolation Implies Zero Knowledge Even in a Quantum World
• Relativistic (or 2-prover 1-round) zero-knowledge protocol for \(\mathsf {NP}\) secure against quantum adversaries
• General Properties of Quantum Zero-Knowledge Proofs
• Certified everlasting zero-knowledge proof for QMA
• General properties of quantum bit commitments (extended abstract)
• Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP
• Enhancing Code Based Zero-Knowledge Proofs Using Rank Metric
• Oblivious transfer from zero-knowledge proofs. Or how to achieve round-optimal quantum oblivious transfer and zero-knowledge proofs on quantum states
• Zero-knowledge proof systems for QMA
• Round-efficient composable two-party quantum computation
• Statistical zero knowledge and quantum one-way functions
• Quantum cryptography beyond quantum key distribution
• Quantum protocols for zero-knowledge systems

This page was built for publication: Zero-knowledge proofs and string commitments withstanding quantum attacks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311537)