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.
Original language | English |
---|---|
Title of host publication | Theory of Cryptography |
Subtitle of host publication | 20th International Conference, TCC 2022, Chicago, IL, USA, November 7–10, 2022, Proceedings, Part I |
Editors | Eike Kiltz, Vinod Vaikuntanathan |
Publisher | Springer |
Pages | 80–109 |
ISBN (Electronic) | 978-3-031-22318-1 |
ISBN (Print) | 978-3-031-22317-4 |
DOIs | |
Publication status | Published - 2023 |
MoE publication type | A4 Conference publication |
Event | Theory of Cryptography Conference - Chicago, United States Duration: 7 Nov 2022 → 10 Nov 2022 Conference number: 20 |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer |
Volume | 13747 |
ISSN (Print) | 0302-9743 |
Conference
Conference | Theory of Cryptography Conference |
---|---|
Abbreviated title | TCC |
Country/Territory | United States |
City | Chicago |
Period | 07/11/2022 → 10/11/2022 |