Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks

DOI10.1007/978-3-540-70583-3_48zbMath1155.94370OpenAlexW1567193096MaRDI QIDQ3519535

Shengyu Zhang, Pranab Sen, Alexandra Kolla, Sean Hallgren

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

Quantum computation (81P68) Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Bit commitment using pseudorandomness
• Zero-knowledge proofs of identity
• Zero knowledge with efficient provers
• Zero-knowledge against quantum attacks
• A complete problem for statistical zero knowledge
• A Pseudorandom Generator from any One-way Function
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Foundations of Cryptography
• General Properties of Quantum Zero-Knowledge Proofs
• An Equivalence Between Zero Knowledge and Commitments
• An Unconditional Study of Computational Zero Knowledge

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