We reinvestigate a notion of one-time programs introduced in the CRYPTO
2008 paper by Goldwasser 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
et al. show how to implement one-time programs on devices equipped with special
hardware gadgets called 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 et al. (TCC 2011, CRYPTO 2011) to construct one-time
computable pseudorandom functions and key-evolution schemes.
REFERENCES(26)
1.
A. Akavia, S. Goldwasser, and V. Vaikuntanathan, Simultaneous hardcore bits and cryptography against memory attacks, In TCC, 2009.
Z. Brakerski and S. Goldwasser, Circular and leakage resilient public-key encryption under subgroup indistinguishability (or: Quadratic residuosity strikes back), CRYPTO, 2010.
We process personal data collected when visiting the website. The function of obtaining information about users and their behavior is carried out by voluntarily entered information in forms and saving cookies in end devices. Data, including cookies, are used to provide services, improve the user experience and to analyze the traffic in accordance with the Privacy policy. Data are also collected and processed by Google Analytics tool (more).
You can change cookies settings in your browser. Restricted use of cookies in the browser configuration may affect some functionalities of the website.