Zero-knowledge against quantum attacks

DOI10.1137/060670997MaRDI QIDQ6829002zbMATH OpenFDO

Authors John Watrous

Publication date 17 March 2010

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/060670997

zbMATH Keywords

interactive proof systemsquantum cryptographyzero-knowledge

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Cited in

(9)

• Post-quantum zero-knowledge with space-bounded simulation
• The space-time cost of purifying quantum computations
• Quantum state testing beyond the polarizing regime and quantum triangular discrimination
• Rewindable quantum computation and its equivalence to cloning and adaptive postselection
• Round-efficient composable two-party quantum computation
• Quantum rewinding for IOP-based succinct arguments
• Optimal quantum algorithm for estimating fidelity to a pure state
• On estimating the quantum _ distance
• The round complexity of proofs in the bounded quantum storage model

This page was built for publication: Zero-knowledge against quantum attacks

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