2 papers
cs.CR2021
Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier
Alessandro Chiesa, Fermi Ma, Nicholas Spooner +1
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 colla…
quant-ph2020
On The Round Complexity of Secure Quantum Computation
James Bartusek, Andrea Coladangelo, Dakshita Khurana +1
We construct the first constant-round protocols for secure quantum computation in the two-party (2PQC) and multi-party (MPQC) settings with security against malicious adversaries.…