Quantum-Secure Coin-Flipping and Applications

  • Ivan Damgård
  • Carolin Lunemann
Conference paper

DOI: 10.1007/978-3-642-10366-7_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5912)
Cite this paper as:
Damgård I., Lunemann C. (2009) Quantum-Secure Coin-Flipping and Applications. In: Matsui M. (eds) Advances in Cryptology – ASIACRYPT 2009. ASIACRYPT 2009. Lecture Notes in Computer Science, vol 5912. Springer, Berlin, Heidelberg


In this paper, we prove classical coin-flipping secure in the presence of quantum adversaries. The proof uses a recent result of Watrous [20] 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 [4], 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.


quantum cryptography coin-flipping common reference string quantum zero-knowledge 
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Ivan Damgård
    • 1
  • Carolin Lunemann
    • 1
  1. 1.DAIMIAarhus UniversityDenmark

Personalised recommendations