Advances in Cryptology – CRYPTO 2004

DOI10.1007/B99099zbMATH Open1104.94047DBLPconf/crypto/2004OpenAlexW2477011922MaRDI QIDQ5311537FDOQ5311537

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

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

Mathematics Subject Classification ID

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

Cited In (19)

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

This page was built for publication: Advances in Cryptology – CRYPTO 2004

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