One-Time Programs
@inproceedings{Goldwasser2008OneTimeP, title={One-Time Programs}, author={S. Goldwasser and Y. Kalai and G. N. Rothblum}, booktitle={CRYPTO}, year={2008} }
In this work, we introduce one-time programs, a new computational paradigm geared towards security applications. A one-time program can be executed on a singleinput, whose value can be specified at run time. Other than the result of the computation on this input, nothing else about the program is leaked. Hence, a one-time program is like a black box function that may be evaluated once and then "self destructs." This also extends to k-time programs, which are like black box functions that can be… CONTINUE READING
Topics from this paper
205 Citations
One-time Programs with Cloud Storage and Its Application to Electronic Money
- Computer Science
- APKC '17
- 2017
- 2
Quantum advantage for probabilistic one-time programs
- Mathematics, Biology
- Nature Communications
- 2018
- 6
- PDF
A General and Efficient Obfuscation for Programs with Tamper-Proof Hardware
- Computer Science
- ISPEC
- 2011
- 4
References
SHOWING 1-10 OF 43 REFERENCES
Virtual monotonic counters and count-limited objects using a TPM without a trusted OS
- Computer Science
- STC '06
- 2006
- 104
- PDF
On the Secure Obfuscation of Deterministic Finite Automata
- Computer Science
- IACR Cryptol. ePrint Arch.
- 2008
- 18
- PDF
On the impossibility of obfuscation with auxiliary input
- Mathematics, Computer Science
- 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
- 2005
- 199
- PDF
Private Circuits II: Keeping Secrets in Tamperable Circuits
- Mathematics, Computer Science
- EUROCRYPT
- 2006
- 162
- PDF
Generalized Non-Interactive Oblivious Transfer Using Count-Limited Objects with Applications to Secure Mobile Agents
- Computer Science
- Financial Cryptography
- 2008
- 30
- PDF
Virtual Leashing: Creating a computational foundation for software protection
- Computer Science
- J. Parallel Distributed Comput.
- 2006
- 3
- PDF
Advances in Cryptology — CRYPTO’ 88: Proceedings
- Computer Science
- Lecture Notes in Computer Science
- 1990
- 335
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Computer Science, Mathematics
- JACM
- 1991
- 1,310
- PDF