Quantum Rewinding for Many-Round Protocols

No Thumbnail Available
Access rights
embargoedAccess
Journal Title
Journal ISSN
Volume Title
A4 Artikkeli konferenssijulkaisussa
This publication is imported from Aalto University research portal.
View publication in the Research portal
Embargo ends: 2024-12-21

Other link related to publication
Author
Date
2023
Department
Department of Computer Science
Major/Subject
Mcode
Degree programme
Language
en
Pages
80–109
Series
Theory of Cryptography, Lecture Notes in Computer Science, Volume 13747
Abstract
We investigate the security of succinct arguments against quantum adversaries. Our main result is a proof of knowledge-soundness in the post-quantum setting for a class of multi-round interactive protocols, including those based on the recursive folding technique of Bulletproofs. To prove this result, we devise a new quantum rewinding strategy, the first that allows for rewinding across many rounds. This technique applies to any protocol satisfying natural multi-round generalizations of special soundness and collapsing. For our main result, we show that recent Bulletproofs-like protocols based on lattices satisfy these properties, and are hence sound against quantum adversaries.
Description
Keywords
Other note
DOI
10.1007/978-3-031-22318-1_4
Citation
Lai, R W F, Malavolta, G & Spooner, N 2023, Quantum Rewinding for Many-Round Protocols . in E Kiltz & V Vaikuntanathan (eds), Theory of Cryptography : 20th International Conference, TCC 2022, Chicago, IL, USA, November 7–10, 2022, Proceedings, Part I . Lecture Notes in Computer Science, vol. 13747, Springer, pp. 80–109, Theory of Cryptography Conference, Chicago, Illinois, United States, 07/11/2022 . https://doi.org/10.1007/978-3-031-22318-1_4
Permanent link to this item
https://urn.fi/URN:NBN:fi:aalto-202309135833
Collections
[article-cris] Perustieteiden korkeakoulu / SCI