Security

Fully Simulatable Quantum-Secure Coin-Flipping and Applications

Free registration required

Executive Summary

The authors propose a coin-flip protocol which yields a string of strong, random coins and is fully simulatable against poly-sized quantum adversaries on both sides. It can be implemented with quantum-computational security without any set-up assumptions, since the construction only assumes mixed commitment schemes which they show how to construct in the given setting. They then show that the interactive generation of random coins at the beginning or during outer protocols allows for quantum-secure realizations of classical schemes, again without any set-up assumptions.

  • Format: PDF
  • Size: 469.3 KB