Cryptology ePrint Archive: Report 2013/343

Quantum one-time programs

Anne Broadbent and Gus Gutoski and Douglas Stebila

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.

This observation raises the question, "what assumptions are required to achieve one-time programs for quantum circuits?" Our main result is that any quantum circuit can be compiled into a one-time program assuming only the same basic one-time memory devices used for classical circuits. Moreover, these quantum one-time programs achieve statistical universal composability (UC-security) against any malicious user. Our construction employs methods for computation on authenticated quantum data, and we present a new quantum authentication scheme called the trap scheme for this purpose. As a corollary, we establish UC-security of a recent protocol for delegated quantum computation.

Category / Keywords: cryptographic protocols / quantum cryptography, one-time programs

Original Publication (with minor differences): IACR-CRYPTO-2013

Date: received 3 Jun 2013, last revised 2 Aug 2013

Contact author: ggutoski at perimeterinstitute ca

Available format(s): PDF | BibTeX Citation

Note: Minor correction to proceedings version based on feedback from Christopher Portmann. Full version available at arXiv:1211.1080 (

Version: 20130803:040149 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]