2009/03/18 by Ivan Damgaard, Damgaard, Ivan, Carolin Lunemann +1 · 1 citation
Computer Science · Physics and Astronomy · #Blockchain Technology Applications and Security #Cryptography and Data Security #FOS: Physical sciences #Quantum Physics (quant-ph) #Security and Verification in Computing #quant-ph
paper · pdf · doi:10.48550/arxiv.0903.3118
14 pages, 7 figures. v3: minor improvements, updated references, corrected typos in definitions; additional section on efficient simulation
openalex publication_date 2009/03/18 · arxiv created 2009/10/19 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we prove classical coin-flipping secure in the presence of quantum adversaries. The proof uses a recent result of Watrous [Wat09] that allows quantum rewinding for protocols of a certain form. We then discuss two applications. First, the combination of coin-flipping with any non-interactive zero-knowledge protocol leads to an easy transformation from non-interactive zero-knowledge to interactive quantum zero-knowledge. Second, we discuss how our protocol can be applied to a recently proposed method for improving the security of quantum protocols [DFL+09], resulting in an implementation without set-up assumptions. Finally, we sketch how to achieve efficient simulation for an extended construction in the common-reference-string model.