Cryptography against continuous memory attacks

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

Volumn , Issue , 2010, Pages 511-520

  Dodis, Yevgeniy ^a   Haralambiev, Kristiyan ^a   López Alt, Adriana ^a   Wichs, Daniel ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

AMOUNT OF INFORMATION; ARBITRARY INFORMATION; AUTHENTICATED KEY AGREEMENT PROTOCOLS; BILINEAR GROUPS; BUILDING BLOCKES; CRYPTOGRAPHIC SCHEMES; ENCRYPTION SCHEMES; IDENTIFICATION SCHEME;

PUBLIC KEY CRYPTOGRAPHY;

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

References (35)

1. A. Akavia, S. Goldwasser, and V. Vaikuntanathan, "Simultaneous hardcore bits and cryptography against memory attacks," in TCC, ser. Lecture Notes in Computer Science, O. Reingold, Ed., vol. 5444. Springer, 2009, pp. 474-495.
2. J. Alwen, Y. Dodis, M. Naor, G. Segev, S. Walfish, and D. Wichs, "Public-key encryption in the bounded-retrieval model," in EUROCRYPT, ser. Lecture Notes in Computer Science, H. Gilbert, Ed., vol. 6110. Springer, 2010, pp. 113-134.
3. J. Alwen, Y. Dodis, and D. Wichs, "Leakage-resilient public-key cryptography in the bounded-retrieval model," in CRYPTO, ser. Lecture Notes in Computer Science, S. Halevi, Ed., vol. 5677. Springer, 2009, pp. 36-54.
4. -, "Survey: Leakage resilience and the bounded retrieval model." 2009.
5. L. Ballard, M. Green, B. de Medeiros, and F. Monrose, "Correlation-resistant storage via keyword-searchable encryption," Cryptology ePrint Archive, Report 2005/417, 2005, http://eprint.iacr.org/.
6. M. Belenkiy, J. Camenisch, M. Chase, M. Kohlweiss, A. Lysyanskaya, and H. Shacham, "Randomizable proofs and delegatable anonymous credentials," in CRYPTO, ser. Lecture Notes in Computer Science, S. Halevi, Ed., vol. 5677. Springer, 2009, pp. 108-125.
7. M. Blum, P. Feldman, and S. Micali, "Non-interactive zero-knowledge and its applications (extended abstract)," in STOC. ACM, 1988, pp. 103-112.
8. M. Blum, A. D. Santis, S. Micali, and G. Persiano, "Noninteractive zero-knowledge," SIAM J. Comput., vol. 20, no. 6, pp. 1084-1118, 1991.
9. D. Boneh, X. Boyen, and H. Shacham, "Short group signatures," in CRYPTO, ser. Lecture Notes in Computer Science, M. K. Franklin, Ed., vol. 3152. Springer, 2004, pp. 41-55.
10. Z. Brakerski, Y. T. Kalai, J. Katz, and V. Vaikuntanathan, "Overcoming the hole in the bucket: Public-key cryptography resilient to continual memory leakage," FOCS, 2010, full version: http://eprint.iacr. org/2010/278.
11. R. Canetti, Y. Dodis, S. Halevi, E. Kushilevitz, and A. Sahai, "Exposure-resilient functions and all-or-nothing transforms," in EUROCRYPT, ser. Lecture Notes in Computer Science, B. Preneel, Ed., vol. 1807. Springer, 2000, pp. 453-469.
12. R. Cramer and V. Shoup, "A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack," in CRYPTO, ser. Lecture Notes in Computer Science, H. Krawczyk, Ed., vol. 1462. Springer, 1998, pp. 13-25.
13. Y. Dodis, K. Haralambiev, A. López-Alt, and D. Wichs, "Cryptography against continuous memory attacks," Cryptology ePrint Archive, Report 2010/196, 2010.
14. -, "Efficient public-key cryptography in the presence of key leakage," Cryptology ePrint Archive, Report 2010/154, 2010.
15. D. Dolev, C. Dwork, and M. Naor, "Non-malleable cryptography," in STOC. ACM, 1991, pp. 542-552.
16. S. Dziembowski and K. Pietrzak, "Leakage-resilient cryptography," in FOCS. IEEE Computer Society, 2008, pp. 293-302.
17. S. Faust, E. Kiltz, K. Pietrzak, and G. N. Rothblum, "Leakage- resilient signatures," in TCC, ser. Lecture Notes in Computer Science, D. Micciancio, Ed., vol. 5978. Springer, 2010, pp. 343-360.
18. S. D. Galbraith and V. Rotger, "Easy decision-diffie-hellman groups," LMS Journal of Computation and Mathematics, vol. 7, p. 2004, 2004.
19. S. Goldwasser, "Cryptography without (hardly any) secrets ?" in EUROCRYPT, ser. Lecture Notes in Computer Science, A. Joux, Ed., vol. 5479. Springer, 2009, pp. 369-370.
20. S. Goldwasser and G. N. Rothblum, "How to play mental solitaire under continuous side-channels: A completeness theorem using secure hardware," to Appear at CRYPTO 2010.
21. J. Groth and A. Sahai, "Efficient non-interactive proof systems for bilinear groups," in EUROCRYPT, ser. Lecture Notes in Computer Science, N. P. Smart, Ed., vol. 4965. Springer, 2008, pp. 415-432.
22. S. Halevi, Ed., Advances in Cryptology - CRYPTO 2009, 29th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2009. Proceedings, ser. Lecture Notes in Computer Science, vol. 5677. Springer, 2009.
23. D. Hofheinz and E. Kiltz, "Secure hybrid encryption from weakened key encapsulation," in CRYPTO, ser. Lecture Notes in Computer Science, A. Menezes, Ed., vol. 4622. Springer, 2007, pp. 553-571.
24. Y. Ishai, A. Sahai, and D. Wagner, "Private circuits: Securing hardware against probing attacks," in CRYPTO, ser. Lecture Notes in Computer Science, D. Boneh, Ed., vol. 2729. Springer, 2003, pp. 463-481.
25. A. Joux, Ed., Advances in Cryptology - EUROCRYPT 2009, 28th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cologne, Germany, April 26-30, 2009. Proceedings, ser. Lecture Notes in Computer Science, vol. 5479. Springer, 2009.
26. A. Juma and Y. Vahlis, "Protecting cryptographic keys against continual leakage," to appear at CRYPTO 2010.
27. J. Katz and V. Vaikuntanathan, "Signature schemes with bounded leakage resilience," in ASIACRYPT, ser. Lecture Notes in Computer Science, M. Matsui, Ed., vol. 5912. Springer, 2009, pp. 703-720.
28. S. Micali and L. Reyzin, "Physically observable cryptography," in TCC, ser. Lecture Notes in Computer Science, M. Naor, Ed., vol. 2951. Springer, 2004, pp. 278-296.
29. M. Naor and G. Segev, "Public-key cryptosystems resilient to key leakage," in CRYPTO, ser. Lecture Notes in Computer Science, S. Halevi, Ed., vol. 5677. Springer, 2009, pp. 18-35.
30. K. Pietrzak, "A leakage-resilient mode of operation," in EUROCRYPT, ser. Lecture Notes in Computer Science, A. Joux, Ed., vol. 5479. Springer, 2009, pp. 462-482.
31. A. D. Santis, S. Micali, and G. Persiano, "Non-interactive zero-knowledge with preprocessing," in CRYPTO, ser. Lecture Notes in Computer Science, S. Goldwasser, Ed., vol. 403. Springer, 1988, pp. 269-282.
32. M. Scott, "Authenticated id-based key exchange and remote log-in with simple token and pin number," Cryptology ePrint Archive, Report 2002/164, 2002.
33. H. Shacham, "A cramer-shoup encryption scheme from the linear assumption and from progressively weaker linear variants," Cryptology ePrint Archive, Report 2007/074, 2007.
34. E. R. Verheul, "Evidence that xtr is more secure than super-singular elliptic curve cryptosystems," J. Cryptology, vol. 17, no. 4, pp. 277-296, 2004.
35. B. Waters, personal Communication. April 2010.