Quantum weak coin flipping with a single photon

被引:5
|
作者
Bozzio, Mathieu [1 ,2 ]
Chabaud, Ulysse [1 ]
Kerenidis, Iordanis [3 ]
Diamanti, Eleni [1 ]
机构
[1] Sorbonne Univ, LIP6, CNRS, F-75005 Paris, France
[2] Inst Polytech Paris, LTCI, Telecom Paris, F-91129 Palaiseau, France
[3] Univ Paris, IRIF, CNRS, 8 Pl Aurelie Nemours, F-75013 Paris, France
关键词
PROTOCOL;
D O I
10.1103/PhysRevA.102.022414
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
Weak coin flipping is among the fundamental cryptographic primitives which ensure the security of modern communication networks. It allows two mistrustful parties to remotely agree on a random bit when they favor opposite outcomes. Unlike other two-party computations, one can achieve information-theoretic security using quantum mechanics only: both parties are prevented from biasing the flip with probability higher than 1/2 + epsilon, where epsilon is arbitrarily low. Classically, the dishonest party can always cheat with probability 1 unless computational assumptions are used. Despite its importance, no physical implementation has been proposed for quantum weak coin flipping. Here, we present a practical protocol that requires a single photon and linear optics only. We show that it is fair and balanced even when threshold single-photon detectors are used, and reaches a bias as low as epsilon = 1/root 2 - 1/2 approximate to 0.207. We further show that the protocol may display a quantum advantage over a few-hundred meters with state-of-the-art technology.
引用
收藏
页数:15
相关论文
共 50 条
  • [41] Weak coherent pulses for single-photon quantum memories
    Giannelli, Luigi
    Schmit, Tom
    Morigi, Giovanna
    PHYSICA SCRIPTA, 2019, 94 (01)
  • [42] Family of loss-tolerant quantum coin-flipping protocols
    Aharon, N.
    Massar, S.
    Silman, J.
    PHYSICAL REVIEW A, 2010, 82 (05):
  • [43] A search for quantum coin-flipping protocols using optimization techniques
    Nayak, Ashwin
    Sikora, Jamie
    Tuncel, Levent
    MATHEMATICAL PROGRAMMING, 2016, 156 (1-2) : 581 - 613
  • [44] A search for quantum coin-flipping protocols using optimization techniques
    Ashwin Nayak
    Jamie Sikora
    Levent Tunçel
    Mathematical Programming, 2016, 156 : 581 - 613
  • [45] Fully Simulatable Quantum-Secure Coin-Flipping and Applications
    Lunemann, Carolin
    Nielsen, Jesper Buus
    PROGRESS IN CRYPTOLOGY - AFRICACRYPT 2011, 2011, 6737 : 21 - 40
  • [46] Interval Algorithms for Coin Flipping
    Pae, Sung-il
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2010, 10 (02): : 55 - 60
  • [47] On the Computational Complexity of Coin Flipping
    Maji, Hemanta K.
    Prabhakaran, Manoj
    Sahai, Amit
    2010 IEEE 51ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2010, : 613 - 622
  • [48] On the Complexity of Fair Coin Flipping
    Haitner, Iftach
    Makriyannis, Nikolaos
    Omri, Eran
    THEORY OF CRYPTOGRAPHY, TCC 2018, PT I, 2018, 11239 : 539 - 562
  • [49] The financial impact of flipping the coin
    Gonzalez, Katherine W.
    Reddy, Shiva R.
    Mundakkal, Angela A.
    St Peter, Shawn D.
    JOURNAL OF PEDIATRIC SURGERY, 2017, 52 (01) : 153 - 155
  • [50] On the complexity of fair coin flipping
    Haitner, Iftach
    Makriyannis, Nikolaos
    Omri, Eran
    THEORETICAL COMPUTER SCIENCE, 2022, 914 : 23 - 38