An efficient quantum parallel repetition theorem and applications

Title: An efficient quantum parallel repetition theorem and applications

Abstract: A fundamental question in cryptography is whether the security of a “weak” cryptographic primitive can be generically amplified. We investigate this question in the quantum setting. We prove a general security amplification result for any quantum cryptographic primitive with a three-message security game, including (canonical) quantum commitments and quantum money.

Bio: Nick Spooner is an Assistant Professor of Computer Science at Cornell University. His work focuses on probabilistic proof systems, zero knowledge, and quantum and post-quantum cryptography. He has previously held positions at the University of Warwick and NYU, and received his PhD from UC Berkeley.