Overcoming the hole in the bucket: Public-key cryptography resilient to continual memory leakage

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2010, Pages 501-510

  Brakerski, Zvika ^a   Kalai, Yael Tauman ^b   Katz, Jonathan ^c   Vaikuntanathan, Vinod ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b MICROSOFT RESEARCH   (United States)

^c UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK SECURITY; SIDE CHANNEL ATTACK;

ARBITRARY INFORMATION; CONTINUAL LEAKAGES; CRYPTOGRAPHIC SCHEMES; DESIGNING SCHEME; IDENTITY BASED ENCRYPTION SCHEMES; KEY UPDATES; PUBLIC-KEY ENCRYPTION SCHEME; TIME-PERIODS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 78751478860     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2010.55     Document Type: Conference Paper

References (35)

1. A. Akavia, S. Goldwasser, and V. Vaikuntanathan. Simultaneous hardcore bits and cryptography against memory attacks. In 6th Theory of Cryptography Conference - TCC 2009, volume 5444 of LNCS, pages 474-495. Springer, 2009.
2. J. Alwen, Y. Dodis, M. Naor, G. Segev, S. Walfish, and D. Wichs. Public-key encryption in the bounded-retrieval model. In Advances in Cryptology - Eurocrypt 2010, volume 6110 of LNCS, pages 113-134. Springer, 2010.
3. J. Alwen, Y. Dodis, and D. Wichs. Public key cryptography in the bounded retrieval model and security against side-channel attacks. In Advances in Cryptology - Crypto 2009, volume 5677 of LNCS, pages 1-17. Springer, 2009.
4. R. Anderson. Two remarks on public-key cryptology. Invited lecture, ACM CCCS 1997. Available at http://www.cl.cam.ac.uk/ftp/users/rja14/forwardsecure. pdf.
5. B. Barak and O. Goldreich. Universal arguments and their applications. SIAM J. Computing, 38(5):1661-1694, 2008.
6. A. Boldyreva, S. Fehr, and A. O'Neill. On notions of security for deterministic encryption, and efficient constructions without random oracles. In Advances in Cryptology - Crypto 2008, volume 5157 of LNCS, pages 335-359. Springer, 2008.
7. D. Boneh, X. Boyen, and H. Shacham. Short group signatures. In M. K. Franklin, editor, CRYPTO, volume 3152 of Lecture Notes in Computer Science, pages 41-55. Springer, 2004.
8. Z. Brakerski, Y. T. Kalai, J. Katz, and V. Vaikuntanathan. Overcoming the hole in the bucket: Public-key cryptography resilient to continual memory leakage. Cryptology ePrint Archive, Report 2010/278, 2010. Full version of this paper.
9. Z. Brakerski and Y. Tauman Kalai. A framework for efficient signatures, ring signatures, and identity-based encryption in the standard model. Cryptology ePrint Archive, Report 2010/086, 2010.
10. R. Canetti, Y. Dodis, S. Halevi, E. Kushilevitz, and A. Sahai. Exposure-resilient functions and all-or-nothing transforms. In Advances in Cryptology - Eurocrypt 2000, volume 1807 of LNCS, pages 453-469. Springer, 2000.
11. R. Canetti, S. Halevi, and J. Katz. A forward-secure public-key encryption scheme. Journal of Cryptology, 20(3):265-294, 2007.
12. Y. Dodis, S. Goldwasser, Y. Tauman Kalai, C. Peikert, and V. Vaikuntanathan. Public-key encryption schemes with auxiliary inputs. In 7th Theory of Cryptography Conference - TCC 2010, volume 5978 of LNCS, pages 361-381. Springer, 2010.
13. Y. Dodis, K. Haralambiev, A. Lopez-Alt, and D. Wichs. Cryptography against continuous memory attacks. These proceedings.
14. Y. Dodis, Y. Kalai, and S. Lovett. On cryptography with auxiliary input. In 41st Annual ACM Symposium on Theory of Computing (STOC), pages 621-630. ACM Press, 2009.
15. Y. Dodis, S. J. Ong, M. Prabhakaran, and A. Sahai. On the (im)possibility of cryptography with imperfect randomness. In 45th Annual Symposium on Foundations of Computer Science (FOCS), pages 196-205. IEEE, 2004.
16. Y. Dodis and A. Smith. Correcting errors without leaking partial information. In 37th Annual ACM Symposium on Theory of Computing (STOC), pages 654-663. ACM Press, 2005.
17. S. Dziembowski and K. Pietrzak. Leakage-resilient cryptography. In 49th Annual Symposium on Foundations of Computer Science (FOCS), pages 293-302. IEEE, 2008.
18. S. Faust, E. Kiltz, K. Pietrzak, and G. Rothblum. Leakage-resilient signatures. In 7th Theory of Cryptography Conference - TCC 2010, volume 5978 of LNCS, pages 343-360. Springer, 2010.
19. S. Faust, T. Rabin, L. Reyzin, E. Tromer, and V. Vaikuntanathan. Protecting circuits from leakage: The computationally-bounded and noisy cases. In Advances in Cryptology - Eurocrypt 2010, volume 6110 of LNCS, pages 135-156. Springer, 2010.
20. S. Goldwasser and G. Rothblum. How to play mental solitaire under continuous side-channels: A completeness theorem using secure hardware. Crypto 2010. To appear.
21. J. A. Halderman, S. D. Schoen, N. Heninger, W. Clarkson, W. Paul, J. A. Calandrino, A. J. Feldman, J. Appelbaum, and E. W. Felten. Lest we remember: Cold boot attacks on encryption keys. In USENIX Security Symposium, pages 45-60, 2008.
22. Y. Ishai, M. Prabhakaran, A. Sahai, and D. Wagner. Private circuits II: Keeping secrets in tamperable circuits. In Advances in Cryptology - Eurocrypt 2006, volume 4004 of LNCS, pages 308-327. Springer, 2006.
23. Y. Ishai, A. Sahai, and D. Wagner. Private circuits: Securing hardware against probing attacks. In Advances in Cryptology - Crypto 2003, volume 2729 of LNCS, pages 463-481. Springer, 2003.
24. A. Juma and Y. Vahlis. Leakage-resilient key proxies. Crypto 2010. To appear.
25. J. Katz and V. Vaikuntanathan. Signature schemes with bounded leakage resilience. In Advances in Cryptology - Asiacrypt 2009, volume 5912 of LNCS, pages 703-720. Springer, 2009.
26. J. Kilian. A note on efficient zero-knowledge proofs and arguments. In 24th Annual ACM Symposium on Theory of Computing (STOC), pages 723-732. ACM Press, 1992.
27. P. C. Kocher. Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In Advances in Cryptology - Crypto '96, volume 1109 of LNCS, pages 104-113. Springer, 1996.
28. P. C. Kocher, J. Jaffe, and B. Jun. Differential power analysis. In Advances in Cryptology - Crypto '99, volume 1666 of LNCS, pages 388-397. Springer, 1999.
29. S. Micali. Computationally sound proofs. SIAM J. Computing, 30(4):1253-1298, 2000.
30. S. Micali and L. Reyzin. Physically observable cryptography. In 1st Theory of Cryptography Conference - TCC 2004, volume 2951 of LNCS, pages 278-296. Springer, 2004.
31. M. Naor and G. Segev. Public-key cryptosystems resilient to key leakage. In Advances in Cryptology - Crypto 2009, volume 5677 of LNCS, pages 18-35. Springer, 2009.
32. C. Peikert and B. Waters. Lossy trapdoor functions and their applications. In STOC, pages 187-196, 2008.
33. C. Petit, F.-X. Standaert, O. Pereira, T. Malkin, and M. Yung. A block cipher based pseudo random number generator secure against side-channel key recovery. In ASIACCS 2008: 3rd ACM Symp. on Information, Computer, and Communications Security, pages 56-65. ACM Press, 2008.
34. K. Pietrzak. A leakage-resilient mode of operation. In Advances in Cryptology - Eurocrypt 2009, volume 5479 of LNCS, pages 462-482. Springer, 2009.
35. R. L. Rivest. All-or-nothing encryption and the package transform. In Fast Software Encryption - FSE '97, volume 1267 of LNCS, pages 210-218. Springer, 1997.