Welcome to the resource topic for 2015/238
Title:
One Time Programs with Limited Memory
Authors: Konrad Durnoga, Stefan Dziembowski, Tomasz Kazana, 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.
ePrint: https://eprint.iacr.org/2015/238
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .