Nov. 20, 2023, 2:48 a.m. |


ePrint Report: An efficient quantum parallel repetition theorem and applications

John Bostanci, Luowen Qian, Nicholas Spooner, Henry Yuen

We prove a tight parallel repetition theorem for $3$-message computationally-secure quantum interactive protocols between an efficient challenger and an efficient adversary. We also prove under plausible assumptions that the security of $4$-message computationally secure protocols does not generally decrease under parallel repetition. These mirror the classical results of Bellare, Impagliazzo, and Naor [BIN97]. Finally, we prove that all quantum argument systems can …

adversary applications eprint report john message protocols prove quantum repetition report security under

Security Specialist

@ Protect Democracy | Remote, US

Information And Security Controller - Tram (UAE National)

@ Keolis | Dubaï, AE

Cybersecurity Engineer

@ Alstom Transport | Cairo, EG

IT Security Specialist (m/w/d) - Data Center & Cloud

@ CLAAS | Harsewinkel, NW, DE, 33428

Security Architect - Central Government sector

@ BAE Systems | London, GB

Project Cyber Security Manager

@ Alstom | Bangkok, TH