Theory of Cryptography Conference

TCC 2011: Theory of Cryptography pp 468-485

Tight Bounds for Classical and Quantum Coin Flipping

  • Esther Hänggi
  • Jürg Wullschleger
Conference paper

DOI: 10.1007/978-3-642-19571-6_28

Volume 6597 of the book series Lecture Notes in Computer Science (LNCS)

Abstract

Coin flipping is a cryptographic primitive for which strictly better protocols exist if the players are not only allowed to exchange classical, but also quantum messages. During the past few years, several results have appeared which give a tight bound on the range of implementable unconditionally secure coin flips, both in the classical as well as in the quantum setting and for both weak as well as strong coin flipping. But the picture is still incomplete: in the quantum setting, all results consider only protocols with perfect correctness, and in the classical setting tight bounds for strong coin flipping are still missing.

We give a general definition of coin flipping which unifies the notion of strong and weak coin flipping (it contains both of them as special cases) and allows the honest players to abort with a certain probability. We give tight bounds on the achievable range of parameters both in the classical and in the quantum setting.

Download to read the full conference paper text

Copyright information

© International Association for Cryptologic Research 2011

Authors and Affiliations

  • Esther Hänggi
    • 1
  • Jürg Wullschleger
    • 2
    • 3
  1. 1.Computer Science DepartmentETH ZurichZürichSwitzerland
  2. 2.DIROUniversité de MontréalQuebecCanada
  3. 3.McGill UniversityQuebecCanada