Cryptology ePrint Archive: Report 2015/238

One Time Programs with Limited Memory

Konrad Durnoga and Stefan Dziembowski and Tomasz Kazana and Michał Zając

Abstract: We reinvestigate a notion of {\em one-time programs} introduced in the CRYPTO 2008 paper by Goldwasser {\it et~al.} A one-time program is a device containing a program $C$, with the property that the program $C$ can be executed on at most one input. Goldwasser {\it et~al.}~show how to implement one-time programs on devices equipped with special hardware gadgets called {\em one-time memory} tokens.

We provide an alternative construction that does not rely on the hardware gadgets. Instead, it is based on the following assumptions: (1) the total amount of data that can leak from the device is bounded, and (2) the total memory on the device (available both to the honest user and to the attacker) is also restricted, which is essentially the model used recently by Dziembowski {\it et al.}\ (TCC 2011, CRYPTO 2011) to construct one-time computable {\em pseudorandom} functions and key-evolution schemes.

Category / Keywords: applications / one time program, yao garbled circuits, random oracle, garbling

Original Publication (in the same form): Springer, Lecture Notes in Computer Science, Vol. 8567

Date: received 12 Mar 2015

Contact author: m zajac at mimuw edu pl

Available format(s): PDF | BibTeX Citation

Version: 20150313:114637 (All versions of this report)

Short URL: ia.cr/2015/238

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]