Relativistic quantum cryptography

From HandWiki

Relativistic quantum cryptography is a sub-field of quantum cryptography, in which in addition to exploiting the principles of quantum physics, the no-superluminal signalling principle of relativity theory stating that information cannot travel faster than light is exploited too. Technically speaking, relativistic quantum cryptography is a sub-field of relativistic cryptography, in which cryptographic protocols exploit the no-superluminal signalling principle, independently of whether quantum properties are used or not. However, in practice, the term relativistic quantum cryptography is used for relativistic cryptography too.

History

In 1997 and 1998, some important tasks in mistrustful cryptography were shown to be impossible to achieve with unconditional security. Mayers[1] and Lo and Chau[2] showed that unconditionally secure quantum bit commitment was impossible. Lo showed that oblivious transfer and a broad class of secure computations were also impossible to achieve with unconditional security in quantum cryptography.[3] Moreover, Lo and Chau showed that unconditionally secure ideal quantum coin tossing was impossible too.[4] In this context, Kent provided in 1999 the first relativistic cryptographic protocols, for bit commitment and ideal coin tossing, which overcome the assumptions made by Mayers, Lo and Chau, and achieve unconditional security.[5][6] Since then, other unconditionally secure relativistic protocols for bit commitment have been found by Kent and others,[7][8][9][10][11] and other cryptographic tasks have been investigated in the setting of relativistic quantum cryptography.[12][13][14][15][16] [17][18]

Basics

No-signalling and no-superluminal signalling

The no-signalling principle of quantum theory states that information cannot be communicated between two distinct locations L0 and L1 without the transmission of any physical systems, despite any quantum entanglement shared between L0 and L1. This implies, in particular, that without the transmission of any physical systems between L0 and L1, quantum correlation between L0 and L1 cannot be used to transmit information between L0 and L1, even if they are non-locally causal and violate Bell inequalities. According to relativity theory, physical systems cannot travel faster than the speed of light. Thus, it follows from the no-signalling principle that information cannot travel faster than the speed of light. This is called the no-superluminal signalling principle.

The principle of no-superluminal signalling is the key physical principle exploited in relativistic cryptography. It guarantees that the outcome x of a random variable X obtained at some spacetime point P cannot influence the probability that a random variable Y takes some value y at a spacelike separated spacetime point Q. Thus, for example, if two parties Alice and Bob have each two agents, with the first agent of Bob sending a secret message x to a first agent of Alice at the spacetime point P, and with the second agent of Alice sending a secret message y to the second agent of Bob at the spacetime point Q, with P and Q spacelike separated, then Bob can be guaranteed that the message y received from Alice was chosen independently of the message x that he gave Alice, and vice versa. This is a useful mathematical property that is exploited to prove the security of cryptographic protocols in relativistic cryptography.

The setting

It is a fundamental requirement in relativistic cryptography that the parties implementing the cryptographic task have a good description of spacetime, at least within the region of spacetime where the task is implemented. For example, in protocols implemented near the Earth surface, it can be assumed that spacetime is close to Minkowski. Importantly, this means that, near the Earth surface, physical systems and information cannot travel faster than the speed of light through vacuum, which is approximately 300,000 km/s. In principle, relativistic cryptography can be applied with more general spacetimes, as long as the parties can guarantee that there are no mechanisms allowing instant communication, like wormholes. Another requirement is that the parties have access to a common reference frame, so that they can guarantee that some communication events are spacelike separated.[5]

In relativistic cryptography, it is assumed that each party participating in the cryptographic task has various trusted agents that collaborate to implement the task. The agents implement the protocol by performing different actions at various points in spacetime. The agents of the same party may communicate via authenticated and secure channels, which can be implemented with previously shared secure keys, for example using one-time pads.[5][18]

Various tasks investigated by relativistic cryptography consist in tasks of mistrustful cryptography, in which two or more mistrustful parties must collaborate to implement a cryptographic task while at the same time being guaranteed that other parties do not cheat. Examples of tasks in mistrustful cryptography are bit commitment, coin tossing, oblivious transfer and secure computations. Key distribution does not belong to mistrustful cryptography, because in this case the parties distributing the key trust each other. In relativistic cryptography, each participating party has various trusted agents, who collaborate with each other by performing different actions at various spacetime points. For example, Alice and Bob can be two companies with offices and laboratories at various locations in the Earth. Alice's offices and laboratories work in collaboration and trust each other. Similarly, Bob's offices and laboratories work in collaboration and trust each other. But Alice and Bob do not trust each other.[5][18]

Tasks investigated in relativistic cryptography

Bit commitment

Bit commitment is an important cryptographic task that has been widely investigated in relativistic cryptography. In bit commitment, Alice commits to a bit b at some time t, and at some later time t’ > t Alice unveils her committed bit b to Bob. A bit commitment is said to be "hiding" if Bob cannot know b before Alice unveils. It is said to be "binding" if after the commitment time t, Alice cannot choose the value of b and successfully unveil b to Bob. A bit commitment protocol is "secure" if it is hiding and binding. The Mayers-Lo-Chau no go theorem states that unconditionally secure bit commitment is impossible based only on the laws of quantum physics.[1][2] It was shown by Kent that the Mayers-Lo-Chau theorem is not general enough because it excludes protocols that exploit the principle of no-superluminal signalling.[5] Kent provided the first unconditionally secure bit commitment protocol in the setting of relativistic cryptography.[5] Various protocols for bit commitment have been devised by Kent and others.[7][8][9][10][11] Experimental demonstrations of relativistic bit commitment have been implemented.[19][20][10][21]

Coin tossing

In strong coin tossing, Alice and Bob are at different locations and they wish to toss a coin in such a way that Alice is guaranteed that Bob cannot bias the outcome, and Bob is guaranteed that Alice cannot bias the outcome either. It was shown by Lo and Chau that ideal strong coin tossing is impossible to achieve with unconditional security based only on the laws of quantum physics.[4] However, Kent overcame this no-go theorem by providing a relativistic protocol for strong coin tossing that is unconditionally secure.[6] This protocol is conceptually very simple and is illustrated here as an example of a protocol in relativistic cryptography.

In Kent's coin tossing protocol, Alice has two agents A0 and A1, and Bob has two agents B0 and B1. Ai and Bi are at location Li, for [math]\displaystyle{ i\in\{0,1\} }[/math]. Let L0 and L1 have a distant separation D. Let us assume that spacetime is Minkowski. Thus, the minimum time that light takes to travel between L0 and L1 is t = D/c, where c is the speed of light through vacuum. A0 generates a random bit [math]\displaystyle{ a }[/math] in a secure laboratory and gives it to B0 at a time t0. B1 generates a random bit b in a secure laboratory and gives it to A1 at a time t1. B0 and B1 communicate [math]\displaystyle{ a }[/math] and b through a secure and authenticated channel. Similarly, A0 and A1 communicate [math]\displaystyle{ a }[/math] and b through a secure and authenticated channel. Alice and Bob agree that the output of the toss d is the xor of the bits [math]\displaystyle{ a }[/math] and b, [math]\displaystyle{ d =a \oplus b }[/math]. Alice and Bob agree on advance on the values of t0 and t1 in a common reference frame, in such a way that |t0 - t1| < t. Thus, from the principle of no superluminal signalling, at receiving [math]\displaystyle{ a }[/math] from A0, B0 cannot send any signal that arrives to B1 before B1 gives b to A1. Therefore, Alice is guaranteed that the bit b is chosen by Bob independently of the bit [math]\displaystyle{ a }[/math] chosen by her. Since Alice chooses [math]\displaystyle{ a }[/math] randomly, and since b is independent of [math]\displaystyle{ a }[/math], Alice is guaranteed that the bit [math]\displaystyle{ d = a\oplus b }[/math] is random. With similar arguments, Bob is also guaranteed that the bit d is random.

Variations of coin tossing have been investigated in relativistic cryptography by Colbeck and Kent.[12][14]

Oblivious transfer and secure computations

Lo showed that oblivious transfer and other secure computations cannot be achieved with unconditional security based only on the laws of quantum physics.[3] This impossibility result by Lo extends to the more general setting of relativistic quantum cryptography.[12][13] Colbeck showed that various secure computations are impossible to achieve with unconditional security in relativistic quantum cryptography.[13][14]

Position-based quantum cryptography

Position-based quantum cryptography consists in cryptographic tasks whose security exploit the location of a party, the principle of no-superluminal signalling and the laws of quantum physics.[16][15] For example, in the problem of quantum location authentication, a prover wants to demonstrate his location L to a set of verifiers using quantum systems. A protocol for quantum location authentication works as follows. A set of verifiers at various locations that surround the location L send classical messages and quantum states towards the location L. If the prover is at the location L then he can receive the signals at specific times and reply to the verifiers with requested classical messages and/or quantum states, which must be received by the verifiers at specific times.[16][15]

Quantum location authentication was first investigated by Kent in 2002, which he called ‘quantum tagging’, resulting in a filed US patent by Kent et al. in 2007,[22] and a publication in the academic literature in 2010,[15] after a paper on position-based quantum cryptography was published by Buhrman et al.[16] There is a no-go theorem for quantum location authentication proved by Buhrman et al. stating that it is impossible for a set of verifiers to authenticate the location of a prover with unconditional security.[16] This is because for any quantum location authentication protocol, a set of dishonest provers sharing a sufficient amount of entanglement and positioned between the verifiers and the location L can intercept all communications from the verifiers, including all transmitted quantum states, and then apply a non-local quantum operation which allows them to reply correctly and at the correct times to the verifiers. Since the dishonest provers do not need to be at the location L to do this, the quantum location authentication protocol is insecure. This no-go theorem assumes that the location L of the honest prover is his only credential. Kent showed that if the prover shares secret keys with the verifiers then location authentication can be implemented securely.[23]

References

  1. ↑ 1.0 1.1 Mayers, Dominic (1997). "Unconditionally Secure Quantum Bit Commitment is Impossible". Physical Review Letters 78 (17): 3414–3417. doi:10.1103/PhysRevLett.78.3414. Bibcode: 1997PhRvL..78.3414M. 
  2. ↑ 2.0 2.1 Lo, Hoi-Kwong; Chau, H. F. (1997). "Is Quantum Bit Commitment Really Possible?". Physical Review Letters 78 (17): 3410–3413. doi:10.1103/PhysRevLett.78.3410. Bibcode: 1997PhRvL..78.3410L. 
  3. ↑ 3.0 3.1 Lo, Hoi-Kwong (1997). "Insecurity of quantum secure computations". Physical Review A 56 (2): 1154–1162. doi:10.1103/PhysRevA.56.1154. Bibcode: 1997PhRvA..56.1154L. 
  4. ↑ 4.0 4.1 Lo, Hoi-Kwong; Chau, H. F. (1998). "Why quantum bit commitment and ideal quantum coin tossing are impossible". Physica D: Nonlinear Phenomena 120 (1–2): 177–187. doi:10.1016/S0167-2789(98)00053-0. Bibcode: 1998PhyD..120..177L. 
  5. ↑ 5.0 5.1 5.2 5.3 5.4 5.5 Kent, Adrian (1999). "Unconditionally Secure Bit Commitment". Physical Review Letters 83 (7): 1447–1450. doi:10.1103/PhysRevLett.83.1447. Bibcode: 1999PhRvL..83.1447K. 
  6. ↑ 6.0 6.1 Kent, Adrian (1999). "Coin Tossing is Strictly Weaker than Bit Commitment". Physical Review Letters 83 (25): 5382–5384. doi:10.1103/PhysRevLett.83.5382. Bibcode: 1999PhRvL..83.5382K. 
  7. ↑ 7.0 7.1 Kent, Adrian (2005). "Secure Classical Bit Commitment Using Fixed Capacity Communication Channels". Journal of Cryptology 18 (4): 313–335. doi:10.1007/s00145-005-0905-8. 
  8. ↑ 8.0 8.1 Kent, Adrian (2011). "Unconditionally secure bit commitment with flying qudits". New Journal of Physics 13 (11): 113015. doi:10.1088/1367-2630/13/11/113015. Bibcode: 2011NJPh...13k3015K. 
  9. ↑ 9.0 9.1 Kent, Adrian (2012). "Unconditionally Secure Bit Commitment by Transmitting Measurement Outcomes". Physical Review Letters 109 (13): 130501. doi:10.1103/PhysRevLett.109.130501. PMID 23030073. Bibcode: 2012PhRvL.109m0501K. 
  10. ↑ 10.0 10.1 10.2 Lunghi, T.; Kaniewski, J.; Bussières, F.; Houlmann, R.; Tomamichel, M.; Wehner, S.; Zbinden, H. (2016). "Practical Relativistic Bit Commitment". Physical Review Letters 115 (3): 030502. doi:10.1103/PhysRevLett.115.030502. PMID 26230775. 
  11. ↑ 11.0 11.1 Adlam, Emily; Kent, Adrian (2015). "Device-independent relativistic quantum bit commitment". Physical Review A 92 (2): 022315. doi:10.1103/PhysRevA.92.022315. Bibcode: 2015PhRvA..92b2315A. 
  12. ↑ 12.0 12.1 12.2 Colbeck, Roger; Kent, Adrian (2006). "Variable-bias coin tossing". Physical Review A 73 (3): 032320. doi:10.1103/PhysRevA.73.032320. Bibcode: 2006PhRvA..73c2320C. 
  13. ↑ 13.0 13.1 13.2 Colbeck, Roger (2007). "Impossibility of secure two-party classical computation". Physical Review A 76 (6): 062308. doi:10.1103/PhysRevA.76.062308. Bibcode: 2007PhRvA..76f2308C. 
  14. ↑ 14.0 14.1 14.2 Colbeck, Roger (December 2006). Quantum And Relativistic Protocols For Secure Multi-Party Computation (Thesis). University of Cambridge. arXiv:0911.3814.
  15. ↑ 15.0 15.1 15.2 15.3 Kent, A.; Munro, William J.; Spiller, Timothy P. (2011). "Quantum Tagging: Authenticating location via quantum information and relativistic signalling constraints". Physical Review A 84 (1): 012326. doi:10.1103/PhysRevA.84.012326. Bibcode: 2011PhRvA..84a2326K. 
  16. ↑ 16.0 16.1 16.2 16.3 16.4 Buhrman, Harry; Chandran, Nishanth; Fehr, Serge; Gelles, Ran; Goyal, Vipul; Ostrovsky, Rafail; Schaffner, Christian (2014). "Position-Based Quantum Cryptography: Impossibility and Constructions". SIAM Journal on Computing 43 (1): 150–178. doi:10.1137/130913687. 
  17. ↑ Kent, Adrian (2011). "Location-oblivious data transfer with flying entangled qudits". Physical Review A 84 (1): 012328. doi:10.1103/PhysRevA.84.012328. Bibcode: 2011PhRvA..84a2328K. 
  18. ↑ 18.0 18.1 18.2 Kent, Adrian (2012). "Quantum tasks in Minkowski space". Classical and Quantum Gravity 29 (22): 224013. doi:10.1088/0264-9381/29/22/224013. Bibcode: 2012CQGra..29v4013K. 
  19. ↑ Lunghi, T.; Kaniewski, J.; Bussières, J.; Houlmann, R.; Tomamichel, M.; Kent, A.; Gisin, N.; Wehner, S. et al. (2013). "Experimental Bit Commitment Based on Quantum Communication and Special Relativity". Physical Review Letters 111 (18): 180504. doi:10.1103/PhysRevLett.111.180504. PMID 24237497. Bibcode: 2013PhRvL.111r0504L. 
  20. ↑ Liu, Yang; Cao, Yuan; Curty, Marcos; Liao, Sheng-Kai; Wang, Jian; Cui, Ke; Li, Yu-Huai; Lin, Ze-Hong et al. (2014). "Experimental Unconditionally Secure Bit Commitment". Physical Review Letters 112 (1): 010504. doi:10.1103/PhysRevLett.112.010504. PMID 24483878. Bibcode: 2014PhRvL.112a0504L. 
  21. ↑ Verbanis, Ephanielle; Martin, Anthony; Houlmann, Raphaël; Boso, Gianluca; Bussières, Félix; Zbinden, Hugo (2016). "24-Hour Relativistic Bit Commitment". Physical Review Letters 117 (14): 140506. doi:10.1103/PhysRevLett.117.140506. PMID 27740788. Bibcode: 2016PhRvL.117n0506V. 
  22. ↑ Kent, A.; W. Munro & T. Spiller et al., "Tagging systems", US patent 7075438, published 2006-07-11
  23. ↑ Kent, Adrian (2011). "Quantum tagging for tags containing secret classical data". Physical Review A 84 (2): 022335. doi:10.1103/PhysRevA.84.022335. Bibcode: 2011PhRvA..84b2335K. 



Retrieved from "https://handwiki.org/wiki/index.php?title=Relativistic_quantum_cryptography&oldid=3376430"