One-time programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5157 LNCS, Issue , 2008, Pages 39-56

  Goldwasser, Shafi ^a,c   Kalai, Yael Tauman ^b   Rothblum, Guy N ^c  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLACK-BOX FUNCTIONS; COMPUTATIONAL PARADIGMS; CONCEPTUAL RESEARCH; CRYPTOLOGY; ELECTRONIC-CASH; NEW CONCEPT; OBLIVIOUS TRANSFER PROTOCOLS; PROGRAM OBFUSCATION; RUN-TIME; SECRET KEYS; SECURITY APPLICATIONS; SELF DESTRUCT; SINGLE INPUT; SOFTWARE PROTECTION;

CRYPTOGRAPHY;

EID: 51849168583     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85174-5_3     Document Type: Conference Paper

References (31)

1. Anderson., R.J.: Security Engineering: A Guide to Building Dependable Distributed Systems. Wiley, Chichester (2001)
2. Bennett, C.H., Brassard, G., Breidbard, S., Wiesner, S.: Quantum cryptography, or unforgeable subway tokens. In: CRYPTO 1982, pp. 267-275 (1982)
3. Best, R.M.: Us patent 4,168,396: Microprocessor for executing enciphered programs (1979)
4. Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications (extended abstract). In: STOC 1988, Chicago, Illinois, pp. 103-112 (1988)
5. Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S.P., Yang, K.: On the (im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 1-18. Springer, Heidelberg (2001)
6. Blum, M.: Personal communication (1981)
7. Blum, M.: How to prove a theorem so no-one else can claim it. In: Proceedings of ICML, pp. 1444-1451 (1987)
8. Barak, B., Lindell, Y., Vadhan, S.P.: Lower bounds for non-black-box zero knowledge. J. Comput. Syst. Sci. 72(2), 321-391 (2006)
9. Chaum, D.: Blind signatures for untraceable payments. In: CRYPTO 1982, pp. 199-203 (1982)
10. Chaum, D.: Blind signature systems. In: CRYPTO 1983, pp. 153-156 (1983)
11. Dvir, O., Herlihy, M., Shavit, N.: Virtual leashing: Creating a computational foundation for software protection. Journal of Parallel and Distributed Computing (Special Issue) 66(9), 1233-1240 (2006)
12. Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM 28(6), 637-647 (1985)
13. Goldreich, O., Kahan, A.: How to construct constant-round zero-knowledge proof systems for np. J. Cryptology 9(3), 167-190 (1996)
14. Goldwasser, S., Kalai, Y.T.: On the impossibility of obfuscation with auxiliary input. In: Tardos, É. (ed.) FOCS 2005, pp. 553-562. IEEE Computer Society, Los Alamitos (2005)
15. Gennaro, R., Lysyanskaya, A., Malkin, T., Micali, S., Rabin, T.: Algorithmic tamper-proof (atp) security: Theoretical foundations for security against hardware tampering. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 258-277. Springer, Heidelberg (2004)
16. Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. SIAM Journal on Computing 18(1), 186-208 (1989)
17. Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity, or all languages in np have zero-knowledge proof systems. Journal of the ACM 38(1), 691-729 (1991)
18. Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious rams. Journal of the ACM 43(3), 431-473 (1996)
19. Ishai, Y., Prabhakaran, M., Sahai, A., Wagner, D.: Private circuits ii: Keeping secrets in tamperable circuits. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 308-327. Springer, Heidelberg (2006)
20. Ishai, Y., Sahai, A., Wagner, D.: Private circuits: Securing hardware against probing attacks. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 463-481. Springer, Heidelberg (2003)
21. Katz, J.: Universally composable multi-party computation using tamper-proof hardware. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 115-128. Springer, Heidelberg (2007)
22. Kent, S.T.: Protecting Externally Supplied Software in Small Computers. PhD thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts (1980)
23. Moran,T.,Naor,M.:Basingcryptographicprotocolsontamper-evidentseals. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 285-297. Springer, Heidelberg (2005)
24. Micali, S., Reyzin, L.: Physically observable cryptography (extended abstract). In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 278-296. Springer, Heidelberg (2004)
25. Moran, T., Segev, G.: David and goliath commitments: Uc computation for asymmetric parties using tamper-proof hardware. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 527-544. Springer, Heidelberg (2008)
26. Pass, R.: On deniability in the common reference string and random oracle model. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 316-337. Springer, Heidelberg (2003)
27. Rabin, M.O.: How to exchange secrets with oblivious transfer. Cryptology ePrint Archive, Report 2005/187 (2005)
28. De Santis, A., Micali, S., Persiano, G.: Non-interactive zero-knowledge with preprocessing. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 269-282. Springer, Heidelberg (1990)
29. Sarmenta, L.F.G., van Dijk, M., O'Donnell, C.W., Rhodes, J., Devadas, S.: Virtual monotonic counters and count-limited objects using a tpm without a trusted os (extended version). Technical Report 2006-064, MIT CSAIL Technical Report (2006)
30. Trusted computing group trusted platform module (tpm) specifications (2007)
31. Yao, A.C.: How to generate and exchange secrets. In: FOCS 1986, pp. 162-167 (1986)