Multiparty Delegated Quantum Computing

Quantum computing has seen tremendous progress in the past few years. However, due to limitations in the scalability of quantum technologies, it seems that we are far from constructing universal quantum computers for everyday users. A more feasible solution is the delegation of computation to powerful quantum servers on the network. This solution was proposed in previous studies of blind quantum computation, with guarantees for both the secrecy of the input and of the computation being performed. In this work, we further develop this idea of computing over encrypted data, to propose a multiparty delegated quantum computing protocol in the measurement-based quantum computing framework. We prove the security of the protocol against a dishonest server and against dishonest clients, under the assumption of common classical cryptographic constructions.

[1]  Dominique Unruh,et al.  Universally Composable Quantum Multi-party Computation , 2009, EUROCRYPT.

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

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

[4]  Ran Canetti,et al.  Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[5]  Christian Schaffner,et al.  Quantum Homomorphic Encryption for Polynomial-Sized Circuits , 2016, CRYPTO.

[6]  C. Pandu Rangan,et al.  The Round Complexity of Verifiable Secret Sharing: The Statistical Case , 2010, ASIACRYPT.

[7]  Avinatan Hassidim,et al.  Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[8]  Louis Salvail,et al.  Actively Secure Two-Party Evaluation of Any Quantum Operation , 2012, CRYPTO.

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

[10]  Yehuda Lindell,et al.  Secure Computation without Agreement , 2002, DISC.

[11]  Stacey Jeffery,et al.  Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity , 2014, CRYPTO.

[12]  Elham Kashefi,et al.  Garbled Quantum Computation , 2017, Cryptogr..

[13]  E. Kashefi,et al.  Determinism in the one-way model , 2005, quant-ph/0506062.

[14]  Dominic Mayers.  Unconditionally secure quantum bit commitment is impossible , 1997 .

[15]  E. Kashefi,et al.  Unconditionally verifiable blind quantum computation , 2012, 1203.5217.

[16]  Martin Hirt,et al.  Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation , 2005, ASIACRYPT.

[17]  Ueli Maurer,et al.  Abstract Cryptography , 2011, ICS.

[18]  U. Maurer,et al.  Locking of accessible information and implications for the security of quantum cryptography , 2005, quant-ph/0512021.

[19]  Peeter Laud,et al.  Verifiable Computation in Multiparty Protocols with Honest Majority , 2014, ProvSec.

[20]  Yuval Ishai,et al.  Founding Cryptography on Oblivious Transfer - Efficiently , 2008, CRYPTO.

[21]  Louis Salvail,et al.  Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries , 2010, CRYPTO.

[22]  E. Kashefi,et al.  Extending the delegated verifiable blind quantum computation functionality , 2016 .

[23]  T. Morimae,et al.  Blind quantum computation protocol in which Alice only makes measurements , 2012, 1201.3966.

[24]  Louis Salvail,et al.  On the Power of Two-Party Quantum Cryptography , 2009, ASIACRYPT.

[25]  Hoi-Kwong Lo,et al.  Is Quantum Bit Commitment Really Possible? , 1996, ArXiv.

[26]  Debbie W. Leung,et al.  Quantum computation by measurements , 2003 .

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

[28]  E. Kashefi,et al.  Unconditionally verifiable blind computation , 2012 .

[29]  Renato Renner,et al.  Cryptographic security of quantum key distribution , 2014, ArXiv.

[30]  Hoi-Kwong Lo,et al.  Insecurity of Quantum Secure Computations , 1996, ArXiv.