Why cut-and-choose quantum state verification cannot be both efficient and secure

DOI10.62056/AY11C3C2HMaRDI QIDQ7391803zbMATH OpenFDO

Authors Fabian Wiesner, Ziad Chaoui, Anna Pappa, Martti Karvonen

Publication date 2025

Published in IACR Communications in Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.62056/AY11C3C2H

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Categorical composable cryptography
• Categorical composable cryptography: extended version
• Quantum cryptography
• Quantum internet: A vision for the road ahead
• The theory of quantum information
• Universally composable security

This page was built for publication: Why cut-and-choose quantum state verification cannot be both efficient and secure

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