Obfuscation for cryptographic purposes

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

Volumn 4392 LNCS, Issue , 2007, Pages 214-232

  Hofheinz, Dennis ^a   Malone Lee, John ^b   Stam, Martijn ^c  

^a CWI   (Netherlands)

^b UNIVERSITY OF BRISTOL   (United Kingdom)

^c EPFL   (Switzerland)

Author keywords

Obfuscation; Point functions

Indexed keywords

FORMAL LOGIC; PROBABILISTIC LOGICS;

OBFUSCATION; POINT FUNCTIONS; SECRET-KEY ENCRYPTION;

PUBLIC KEY CRYPTOGRAPHY;

EID: 38049056625     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70936-7_12     Document Type: Conference Paper

References (26)

1. B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (im)possibility of obfuscating programs. In Advances in Cryptology - CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 1-18. Springer-Verlag, 2001. Full version available at http ://eprint.iacr.org/2001/069/.
2. th Annual Symposium on Foundations of Computer Science, pages 394-403. IEEE Computer Science Press, 1997.
3. R. Canetti. Towards realizing random oracles: Hash functions that hide all partial information. In Advances in Cryptology - CRYPTO '97, volume 1294 of Lecture Notes in Computer Science, pages 455-469. Springer-Verlag, 1997.
4. th ACM Symposium on Theory of Computing, pages 131-140. ACM Press, 1998.
5. W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, 22(6):644-654, 1976.
6. Y. Dodis and A. Smith. Correcting errors without leaking partial information. In 37"1 ACM Symposium on Theory of Computing, pages 654-663. ACM Press, 2005.
7. R. Gennaro, A. Lysyanskaya, T. Malkin, S. Micali, and T. Rabin. Algorithmic tamper-proof (ATP) security: Theoretical foundations for security against hardware tampering. In Theory of Cryptography, TCC 2004, volume 2951 of Lecture Notes in Computer Science, pages 258-277. Springer-Verlag, 2004.
8. O. Goldreich, S. Goldwasser and S. Micali. How to construct random functions. Journal of the ACM, 33(4), pages 210-217, 1986.
9. st ACM Symposium on Theory of Computing, pages 25-32. ACM Press, 1989.
10. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing, 17(2):281-308, 1988.
11. th IEEE Symposium on Foundations of Computer Science, pages 553-562. IEEE Computer Society, 2005.
12. S. Hada. Zero-knowledge and code obfuscation. In Advances in Cryptology - ASI-ACRYPT 2000, volume 1976 of Lecture Notes in Computer Science, pages 443-457. Springer-Verlag, 2000.
13. R. Jaeschke. Encrypting C source for distribution. Journal of C Language Translation, 2(1), 1990.
14. J. Katz and M. Yung. Unforgeable Encryption and Chosen Ciphertext Secure Modes of Operation. In Fast Software Encryption - FSE 2000, volume 1978 of Lecture Notes in Computer Science, pages 284-299. Springer-Verlag, 2001.
15. P. Kocher, J. Jaffe, and B. Jun. Differential power analysis. In Advances in Cryptology - CRYPTO '99, volume 1666 of Lecture Notes in Computer Science, pages 388-397. Springer-Verlag, 1999.
16. th ACM Conference on Computer and Communications Security, pages 290-299. ACM Press, 2003.
17. B. Lynn, M. Prabhakaran, and A. Sahai. Positive results and techniques for obfuscation. In Advances in Cryptology - EUROCRYPT 2004, volume 3027 of Lecture Notes in Computer Science, pages 20-39. Springer-Verlag, 2004.
18. S. Micali and L. Reyzin. Physically observable cryptography (extended abstract). In Theory of Cryptography, TCC 2004, volume 2951 of Lecture Notes in Computer Science, pages 278-296. Springer-Verlag, 2004. Full version available at http ://eprint.iacr.org/2003/120/.
19. nd ACM Symposium on Theory of Computing, pages 427-437. ACM Press, 1990.
20. Arvind Narayanan and Vitaly Shmatikov. On the Limits of Point Function Obfuscation. IACR ePrint Archive, May 2006. Online available at http://eprint.iacr.org/2006/182.ps.
21. National Institute of Standards and Technology. Data Encryption Standard (DES), 1993. FIPS Publication 46-2.
22. R. Pass and a. shelat and V. Vaikuntanathan. Construction of a Non-Malleable Encryption Scheme From Any Semantically Secure One. In Advances in Cryptology - CRYPTO '06, volume 4116 of Lecture Notes in Computer Science. Springer-Verlag, 2006.
23. C. Rackoff and D. Simon. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In Advances in Cryptology - CRYPTO '91, volume 576 of Lecture Notes in Computer Science, pages 433-444. Springer-Verlag, 1992.
24. D. R. Stinson. Cryptography: Theory and Practice. CRC Press, 1995.
25. th ACM Symposium on Theory of Computing, pages 523-532. ACM Press, 2005.
26. rd Annual Symposium on Foundations of Computer Science, pages 80-91. IEEE Computer Science Press, 1982.