Title: Post-Quantum Succinct Arguments
Abstract: We prove that Kilian’s four-message succinct argument system
is post-quantum secure in the standard model when instantiated with
any probabilistically checkable proof and any collapsing hash function
(which in turn exist based on the post-quantum hardness of Learning
with Errors).
At the heart of our proof is a general-purpose quantum rewinding
procedure that enables a reduction to repeatedly query a quantum
adversary for accepting transcripts as many times as desired.
This talk will be divided into two parts separated by a short break.
The first part will be a high-level overview of the work; familiarity
with basic concepts from quantum information will be helpful but not
necessary. The second part will be an in-depth discussion of quantum
techniques.
Based on joint work with Alessandro Chiesa, Nicholas Spooner, and Mark Zhandry.