Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment
From MaRDI portal
Publication:4593252
DOI10.1137/15M1010853zbMath1383.81067OpenAlexW2762757658MaRDI QIDQ4593252
André Chailloux, Iordanis Kerenidis
Publication date: 22 November 2017
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/15m1010853
Quantum computation (81P68) Cryptography (94A60) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Unnamed Item
- Unnamed Item
- Quantum cryptography: public key distribution and coin tossing
- Weak coin flipping with small bias
- A Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias
- Lower bounds for Quantum Oblivious Transfer
- Tight Bounds for Classical and Quantum Coin Flipping
- Quantum bit escrow
- A Tight High-Order Entropic Quantum Uncertainty Relation with Applications
- Coin flipping by telephone a protocol for solving impossible problems
- Cryptographic distinguishability measures for quantum-mechanical states
- Optimal Quantum Strong Coin Flipping
- A new protocol and lower bounds for quantum coin flipping
- Optimal Bounds for Quantum Bit Commitment
This page was built for publication: Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment