Weak coin flipping with small bias

DOI10.1016/j.ipl.2003.07.007zbMath1178.68265arXivquant-ph/0206121OpenAlexW2949510606MaRDI QIDQ1029065

Iordanis Kerenidis, Ashwin Nayak

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0206121

zbMATH Keywords

algorithmscryptographyquantum computationquantum communicationcoin flipping

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Data encryption (aspects in computer science) (68P25) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (5)

Secure certification of mixed quantum states with application to two-party randomness generation ⋮ Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment ⋮ A Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias ⋮ Unnamed Item ⋮ A search for quantum coin-flipping protocols using optimization techniques

Cites Work

• Unnamed Item
• Unnamed Item
• Why quantum bit commitment and ideal quantum coin tossing are impossible.
• Quantum bit escrow
• Coin flipping by telephone a protocol for solving impossible problems
• A new protocol and lower bounds for quantum coin flipping

This page was built for publication: Weak coin flipping with small bias