Diana Kessler
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Diana Kessler has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Fabian Wiesner
Technische Universität Berlin
2 shared publications - Martti Karvonen
Department of Computer Science, University College London, London, UK
2 shared publications - Ziad Chaoui
Technische Universität Berlin
2 shared publications Amar Hadzihasanovic
Tallinn University of Technology, Tallinn, Estonia
1 shared publication- Anna Pappa
Technische Universität Berlin
1 shared publication
Latest Publications
- Open Access
- 8 January 2026
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 2 (4)
Why cut-and-choose quantum state verification cannot be both efficient and secure
Quantum state verification plays a vital role in many quantum cryptographic protocols, as it allows using quantum states from an untrusted source. While some progress has been made in this direction, the question of whether the most prevalent type of quantum state verification, namely cut-and-choose verification, can be efficient and secure, is still not answered in full generality. In this work, we show a fundamental limit for quantum state verification for all cut-and-choose approaches used to verify arbitrary quantum states. We provide a no-go result showing that the cut-and-choose techniques cannot lead to quantum state verification protocols that are both efficient and secure. We show this trade-off for stand-alone and composable security, where the scaling of the lower bound for the security parameters renders cut-and-choose quantum state verification effectively unusable.
- 8 January 2026
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 2 (4)
Open AccessWhy cut-and-choose quantum state verification cannot be both efficient and secure
Quantum state verification plays a vital role in many quantum cryptographic protocols, as it allows using quantum states from an untrusted source. While some progress has been made in this direction, the question of whether the most prevalent type of quantum state verification, namely cut-and-choose verification, can be efficient and secure, is still not answered in full generality. In this work, we show a fundamental limit for quantum state verification for all cut-and-choose approaches used to verify arbitrary quantum states. We provide a no-go result showing that the cut-and-choose techniques cannot lead to quantum state verification protocols that are both efficient and secure. We show this trade-off for stand-alone and composable security, where the scaling of the lower bound for the security parameters renders cut-and-choose quantum state verification effectively unusable.
- Open Access
Why cut-and-choose quantum state verification cannot be both efficient and secure
Quantum state verification plays a vital role in many quantum cryptographic protocols, as it allows the use of quantum states from untrusted sources. While some progress has been made in this direction, the question of whether the most prevalent type of quantum state verification, namely cut-and-choose verification, can be efficient and secure, is still not answered in full generality. In this work, we show a fundamental limit for quantum state verification for all cut-and-choose approaches used to verify arbitrary quantum states. We provide a no-go result showing that the cut-and-choose techniques cannot lead to quantum state verification protocols that are both efficient in the number of rounds and secure. We show this trade-off for stand-alone and composable security, where the scaling of the lower bound for the security parameters renders cut-and-choose quantum state verification effectively unusable.
Open AccessWhy cut-and-choose quantum state verification cannot be both efficient and secure
Quantum state verification plays a vital role in many quantum cryptographic protocols, as it allows the use of quantum states from untrusted sources. While some progress has been made in this direction, the question of whether the most prevalent type of quantum state verification, namely cut-and-choose verification, can be efficient and secure, is still not answered in full generality. In this work, we show a fundamental limit for quantum state verification for all cut-and-choose approaches used to verify arbitrary quantum states. We provide a no-go result showing that the cut-and-choose techniques cannot lead to quantum state verification protocols that are both efficient in the number of rounds and secure. We show this trade-off for stand-alone and composable security, where the scaling of the lower bound for the security parameters renders cut-and-choose quantum state verification effectively unusable.
- 15 October 2024
- Published by Springer Nature in Applied Categorical Structures
- Vol. 32 (6) , 1-34
Acyclicity Conditions on Pasting Diagrams
- 15 October 2024
- Published by Springer Nature in Applied Categorical Structures
- Vol. 32 (6) , 1-34
Acyclicity Conditions on Pasting Diagrams