Quantum One-Time Programs - (Extended Abstract)

A one-time program is a hypothetical device by which a user may evaluate a circuit on exactly one input of his choice, before the device self-destructs. One-time programs cannot be achieved by software alone, as any software can be copied and re-run. However, it is known that every circuit can be compiled into a one-time program using a very basic hypothetical hardware device called a one-time memory. At first glance it may seem that quantum information, which cannot be copied, might also allow for one-time programs. But it is not hard to see that this intuition is false: one-time programs for classical or quantum circuits based solely on quantum information do not exist, even with computational assumptions.

[1]  Scott Aaronson,et al.  Quantum money from hidden subspaces , 2012, STOC '12.

[2]  Stephen A. Fenner,et al.  Efficient universal quantum circuits , 2009, Quantum Inf. Comput..

[3]  Gus Gutoski,et al.  Quantum one-time programs , 2013, IACR Cryptol. ePrint Arch..

[4]  M. Smid.  Integrating the Data Encryption Standard into Computer Networks , 1981, IEEE Trans. Commun..

[5]  V. Roychowdhury,et al.  On Universal and Fault-Tolerant Quantum Computing , 1999, quant-ph/9906054.

[6]  Stephen Wiesner,et al.  Conjugate coding , 1983, SIGA.

[7]  Shor,et al.  Simple proof of security of the BB84 quantum key distribution protocol , 2000, Physical review letters.

[8]  Birgit Pfitzmann,et al.  A model for asynchronous reactive systems and its application to secure message transmission , 2001, Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001.

[9]  P. Oscar Boykin,et al.  A new universal and fault-tolerant quantum basis , 2000, Inf. Process. Lett..

[10]  Adam D. Smith,et al.  Authentication of quantum messages , 2001, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[11]  M. Mosca,et al.  Quantum Coins , 2009, 0911.1295.

[12]  P. B. M. Sousa,et al.  Universal quantum circuit for N-qubit quantum gate: a programmable quantum gate , 2006, Quantum Inf. Comput..

[13]  Harry Buhrman,et al.  Complete insecurity of quantum protocols for classical two-party computation Buhrman, , 2012 .

[14]  Yuval Ishai,et al.  Founding Cryptography on Tamper-Proof Hardware Tokens , 2010, IACR Cryptol. ePrint Arch..

[15]  Christoph Dankert,et al.  Exact and approximate unitary 2-designs and their application to fidelity estimation , 2009 .

[16]  Mário Ziman,et al.  Programmable Quantum Gate Arrays , 2001 .

[17]  Isaac L. Chuang,et al.  Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations , 1999, Nature.

[18]  Stephen A. Fenner,et al.  Universal Quantum Circuits , 2008, Electron. Colloquium Comput. Complex..

[19]  Michael A. Nielsen,et al.  The Solovay-Kitaev algorithm , 2006, Quantum Inf. Comput..

[20]  Mihir Bellare,et al.  Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing , 2012, ASIACRYPT.

[21]  Yael Tauman Kalai,et al.  One-Time Programs , 2008, CRYPTO.

[22]  Andrew M. Childs.  Secure assisted quantum computation , 2001, Quantum Inf. Comput..

[23]  Dominique Unruh,et al.  Simulatable security for quantum protocols. (arXiv:quant-ph/0409125v2 CROSS LISTED) , 2004, quant-ph/0409125.

[24]  W. Wootters,et al.  A single quantum cannot be cloned , 1982, Nature.

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

[26]  Aiden A. Bruen,et al.  Error-correcting Codes, Finite Geometries and Cryptography , 2010 .

[27]  I. Chuang,et al.  Quantum Teleportation is a Universal Computational Primitive , 1999, quant-ph/9908010.

[28]  Gilles Brassard,et al.  Quantum cryptography: Public key distribution and coin tossing , 2014, Theor. Comput. Sci..

[29]  Elad Eban,et al.  Interactive Proofs For Quantum Computations , 2017, 1704.04487.

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

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

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

[33]  Scott Aaronson,et al.  Quantum Copy-Protection and Quantum Money , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

[34]  M. Ben-Or,et al.  General Security Definition and Composability for Quantum & Classical Protocols , 2004, quant-ph/0409062.

[35]  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).

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

[37]  Amit Sahai,et al.  On the (im)possibility of obfuscating programs , 2001, JACM.