Optimal Bounds for Quantum Bit Commitment

DOI10.1109/FOCS.2011.42zbMath1292.81030arXiv1102.1678MaRDI QIDQ5495022

André Chailloux, Iordanis Kerenidis

Publication date: 30 July 2014

Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (8)

Quantum coin hedging, and a counter measure ⋮ Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment ⋮ Quantum cryptography beyond quantum key distribution ⋮ Unconditionally secure quantum bit commitment based on the uncertainty principle ⋮ Quantum private information retrieval has linear communication complexity ⋮ 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

This page was built for publication: Optimal Bounds for Quantum Bit Commitment