A Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias

DOI10.1137/14096387XzbMath1342.81096arXiv1402.7166MaRDI QIDQ2805518

André Chailloux, Dorit Aharonov, Maor Ganz, Iordanis Kerenidis, Loïck Magnin

Publication date: 12 May 2016

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.7166

zbMATH Keywords

securityquantum cryptographyquantum protocolsquantum weak coin flipping

Mathematics Subject Classification ID

Quantum computation (81P68) Cryptography (94A60) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (5)

Quantum coin hedging, and a counter measure ⋮ Quantum leader election ⋮ Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment ⋮ Quantum cryptography beyond quantum key distribution ⋮ A search for quantum coin-flipping protocols using optimization techniques

Cites Work

• Unnamed Item
• Quantum cryptography: public key distribution and coin tossing
• Weak coin flipping with small bias
• A new protocol and lower bounds for quantum coin flipping
• Quantum leader election
• Quantum dice rolling: a multi-outcome generalization of quantum coin flipping
• Quantum bit escrow
• A Quantum Protocol for Sampling Correlated Equilibria Unconditionally and without a Mediator
• Foundations of Cryptography
• Coin flipping by telephone a protocol for solving impossible problems
• Optimal Quantum Strong Coin Flipping
• Optimal Bounds for Quantum Bit Commitment
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: A Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias