Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks

DOI10.1007/978-3-540-70583-3_48MaRDI QIDQ3519535zbMATH OpenOpenAlexFDO

Authors Sean Hallgren, Alexandra Kolla, Pranab Sen, Shengyu Zhang

Publication date 19 August 2008

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70583-3_48

Mathematics Subject Classification ID

Cryptography (94A60) Quantum computation (81P68)

Recommendations

• Increasing the power of the verifier in quantum zero knowledge
• General Properties of Quantum Zero-Knowledge Proofs
• Advances in Cryptology – CRYPTO 2004

Cites work

• scientific article; zbMATH DE number 1775425 (Why is no real title available?)
• scientific article; zbMATH DE number 4185024 (Why is no real title available?)
• A Pseudorandom Generator from any One-way Function
• A complete problem for statistical zero knowledge
• An Equivalence Between Zero Knowledge and Commitments
• An Unconditional Study of Computational Zero Knowledge
• Bit commitment using pseudorandomness
• Foundations of Cryptography
• General Properties of Quantum Zero-Knowledge Proofs
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Zero knowledge with efficient provers
• Zero-knowledge proofs of identity

Cited in

(7)

• Advances in Cryptology – CRYPTO 2004
• Increasing the power of the verifier in quantum zero knowledge
• Classical proofs of quantum knowledge
• Certified everlasting zero-knowledge proof for QMA
• Zero-knowledge proof systems for QMA
• General Properties of Quantum Zero-Knowledge Proofs
• Relativistic (or 2-prover 1-round) zero-knowledge protocol for \(\mathsf {NP}\) secure against quantum adversaries

This page was built for publication: Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks

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