Composable security of measuring-Alice blind quantum computation

Blind quantum computing [A. Broadbent, J. Fitzsimons, and E. Kashefi, Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science 517 (2009)] is a secure cloud quantum computing protocol which enables a client (who does not have enough quantum technology at her disposal) to delegate her quantum computation to a server (who has a universal quantum computer) without leaking any relevant information to the server. In [T. Morimae and K. Fujii, Phys. Rev. A {\bf87}, 050301(R) (2013)], a new blind quantum computing protocol, so called the measuring-Alice protocol, was proposed. This protocol offers several advantages over previous protocols, such as the device-independent security, less demanding requirements for the client, and a simpler and stronger security based on the no-signaling principle. In this paper, we show composable security of the measuring-Alice protocol by using the formalism of the constructive cryptography [U. Maurer, Proceedings of Theory of Security and Applications, TOSCA 2011, pages 33-56. Springer (2011)]. The above advantages of measuring-Alice protocol enable more intuitive and transparent proofs for the composable security.

[1]  Tomoyuki Morimae.  Continuous-variable blind quantum computation. , 2012, Physical review letters.

[2]  Gisin,et al.  Quantum cryptography with coherent states. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[3]  M. Horodecki,et al.  Locking classical correlations in quantum States. , 2003, Physical review letters.

[4]  N. Lütkenhaus.  Security against individual attacks for realistic quantum key distribution , 2000 .

[5]  Keisuke Fujii,et al.  Blind topological measurement-based quantum computation , 2011, Nature Communications.

[6]  Gilles Brassard,et al.  Experimental Quantum Cryptography , 1990, EUROCRYPT.

[7]  Elham Kashefi,et al.  Blind quantum computing with weak coherent pulses. , 2011, Physical review letters.

[8]  Sanders,et al.  Limitations on practical quantum cryptography , 2000, Physical review letters.

[9]  Elham Kashefi,et al.  Ancilla-driven universal quantum computation , 2010 .

[10]  T. Morimae,et al.  Ancilla-Driven Universal Blind Quantum Computation , 2012, 1210.7450.

[11]  Elham Kashefi,et al.  Universal Blind Quantum Computation , 2008, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[12]  R Raussendorf,et al.  A one-way quantum computer. , 2001, Physical review letters.

[13]  T. Ralph,et al.  Universal quantum computation with continuous-variable cluster states. , 2006, Physical review letters.

[14]  Robert Raussendorf,et al.  Topological fault-tolerance in cluster state quantum computation , 2007 .

[15]  E. Lieb,et al.  Valence bond ground states in isotropic quantum antiferromagnets , 1988 .

[16]  Joseph Fitzsimons,et al.  Composable Security of Delegated Quantum Computation , 2013, ASIACRYPT.

[17]  Birgit Pfitzmann,et al.  The reactive simulatability (RSIM) framework for asynchronous systems , 2007, Inf. Comput..

[18]  A. Miyake,et al.  Measurement-based quantum computer in the gapped ground state of a two-body Hamiltonian. , 2008, Physical review letters.

[19]  Ueli Maurer,et al.  Small accessible quantum information does not imply security. , 2007, Physical review letters.

[20]  Elham Kashefi,et al.  Demonstration of Blind Quantum Computing , 2011, Science.