Leakage-resilient storage

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

Volumn 6280 LNCS, Issue , 2010, Pages 121-137

  Davì, Francesco ^a   Dziembowski, Stefan ^a   Venturi, Daniele ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

leakage resilient cryptography; secure storage

Indexed keywords

BOOLEAN CIRCUIT; CARDINALITIES; LEAKAGE RESILIENT CRYPTOGRAPHY; SECURE DATA STORAGE; SECURE STORAGE; SECURITY DEFINITIONS; SMALL SIZE; STANDARD DEFINITIONS; TOTAL LENGTH;

BOOLEAN FUNCTIONS; CRYPTOGRAPHY;

ENCODING (SYMBOLS);

EID: 77958056591     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15317-4_9     Document Type: Conference Paper

References (44)

1. Akavia, A., Goldwasser, S., Vaikuntanathan, V.: Simultaneous hardcore bits and cryptogra-phy against memory attacks. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 474-495. Springer, Heidelberg (2009)
2. Alwen, J., Dodis, Y., Wichs, D.: Leakage-resilient public-key cryptography in the bounded-retrieval model. In: Halevi [21], pp. 36-54
3. Barak, B., Shaltiel, R., Tromer, E.: True random number generators secure in a changing environment. In: Walter, C.D., Koç, Ç.K., Paar, C. (eds.) CHES 2003. LNCS, vol. 2779, pp. 166-180. Springer, Heidelberg (2003)
4. Blum, M.: Independent unbiased coin flips from a correlated biased source: A finite state markov chain. In: 25th Annual Symposium on Foundations ofComputer Science, 1984, pp. 425-433. IEEE Computer Society, Los Alamitos (1984)
5. Canetti, R., Dodis, Y., Halevi, S., Kushilevitz, E., Sahai, A.: Exposure-Resilient Functions and All-Or-Nothing Transforms. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 453-469. Springer, Heidelberg (2000)
6. Cash, D., Ding, Y.Z., Dodis, Y., Lee, W., Lipton, R.J., Walfish, S.: Intrusion-resilient key exchange in the bounded retrievalmodel. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 479-498. Springer, Heidelberg (2007)
7. Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. on Computing 17(2), 230-261 (1988)
8. Chor, B., Goldreich, O., Håstad, J., Friedman, J., Rudich, S., Smolensky, R.: The bit extrac-tion problem of t-resilient functions (preliminary version). In: FOCS, pp. 396-407. IEEE, Los Alamitos (1985)
9. Di Crescenzo, G., Lipton, R.J., Walfish, S.: Perfectly secure password protocols in the bounded retrieval model. In: Halevi, Rabin (eds.) [22], pp. 225-244
10. Dodis, Y., Elbaz, A., Oliveira, R., Raz, R.: Improved randomness extraction from two inde-pendent sources. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol. 3122, pp. 334-344. Springer, Heidelberg (2004)
11. Dodis, Y., Goldwasser, S., Kalai, Y.T., Peikert, C., Vaikuntanathan, V.: Public-key encryption schemes with auxiliary inputs. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 361-381. Springer, Heidelberg (2010)
12. Dodis, Y., Kalai, Y.T., Lovett, S.: On cryptography with auxiliary input. In: STOC 2009: Proceedings of the 41st annual ACM symposium on Theory of computing, pp. 621-630. ACM, New York (2009)
13. Dodis, Y., Sahai, A., Smith, A.: On perfect and adaptive security in exposure-resilient cryptography. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 301-324. Springer, Heidelberg (2001)
14. Dziembowski., S.: Intrusion-resilience via the bounded-storage model. In: Halevi, Rabin (eds.) [22], pp. 207-224
15. Dziembowski, S.: On forward-secure storage. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 251-270. Springer, Heidelberg (2006)
16. Dziembowski, S., Pietrzak, K.: Intrusion-resilient secret sharing. In: FOCS, pp. 227-237 (2007)
17. Dziembowski, S., Pietrzak, K.: Leakage-resilientcryptography. In: FOCS 2008: Proceedings of the 49th Annual IEEE Symposium on Foundations ofComputer Science, Washington, DC, USA. IEEE Computer Society, Los Alamitos (2008)
18. Faust, S., Rabin, T., Reyzin, L., Tromer, E., Vaikuntanathan, V.: Protecting circuits from leakage: The computationally-bounded and noisy cases. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 135-156. Springer, Heidelberg (2010)
19. Gandolfi, K., Mourtel, C., Olivier, F.: Electromagnetic analysis: Concrete results. In: Koç, Ç.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol. 2162, pp. 251-261. Springer, Heidelberg (2001)
20. Halderman, A.J., Schoen, S.D., Heninger, N., Clarkson, W., Paul, W., Calandrino, J.A., Feld-man, A.J., Appelbaum, J., Felten, E.W.: Lest we remember: cold-boot attacks on encryption keys. Commun. ACM 52(5), 91-98 (2009)
21. Halevi, S. (ed.): CRYPTO 2009. LNCS, vol. 5677. Springer, Heidelberg (2009)
22. Halevi, S., Rabin, T. (eds.): TCC 2006. LNCS, vol. 3876. Springer, Heidelberg (2006)
23. Harnik, D., Naor, M.: On the compressibility of NP instances and cryptographic applications. In: FOCS 2006: Proceedings of the 47th Annual IEEE Symposium on Foundations of Com-puter Science, Washington, DC, USA, pp. 719-728. IEEE Computer Society, Los Alamitos (2006)
24. Ishai, Y., Sahai, A., Wagner, D.: Private Circuits: Securing Hardware against Probing At-tacks. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 463-481. Springer, Heidel-berg (2003)
25. Katz, J., Vaikuntanathan, V.: Signature schemes with bounded leakage resilience. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 703-720. Springer, Heidelberg (2009)
26. Kelsey, J., Schneier, B., Wagner, D., Hall, C.: Side channel cryptanalysis ofproduct ciphers. Journal ofComputer Security 8, 141-158 (2000)
27. Kocher, P.C.: Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 104-113. Springer, Hei-delberg (1996)
28. Kocher, P.C., Jaffe, J., Jun, B.: Differential power analysis. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 388-397. Springer, Heidelberg (1999)
29. Maurer, U.M.: Conditionally-perfect secrecy and a provably-secure randomized cipher. J. Cryptology 5(1), 53-66 (1992)
30. Micali, S., Reyzin, L.: Physically observable cryptography (extended abstract). In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 278-296. Springer, Heidelberg (2004)
31. Naor, M., Segev, G.: Public-key cryptosystems resilient to key leakage. In: Halevi (ed.) [21], pp. 18-35
32. European Network of Excellence (ECRYPT). The side channel cryptanalysis lounge http://www.crypto.ruhr-uni-bochum.de/en-sclounge.html (retrieved on 29.03.2010)
33. Pietrzak, K.: A leakage-resilient mode of operation. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 462-482. Springer, Heidelberg (2010)
34. Quisquater, J.-J., Koene, F.: Side channel attacks: State of the art. In: [32] (October 2002)
35. Quisquater, J.-J., Samyde, D.: Electromagnetic analysis (EMA): Measures and counter-measures for smart cards. In: Attali, S., Jensen, T. (eds.) E-smart 2001. LNCS, vol. 2140, pp. 200-210. Springer, Heidelberg (2001)
36. Rao, A.: An exposition of Bourgain's 2-source extractor. Electronic Colloquium on Compu-tational Complexity (ECCC), 14(034) (2007), http://eccc.hpi-web.de/eccc-reports/2007/TR07-034/index.html
37. Rivest, R.L.: All-or-nothing encryption and the package transform. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 210-218. Springer, Heidelberg (1997)
38. Samyde, D., Skorobogatov, S., Anderson, R., Quisquater, J.-J.: On a new way to read data from memory. In: SISW 2002: Proceedings of the First International IEEE Security in Stor-age Workshop, Washington, DC, USA, p. 65. IEEE Computer Society, Los Alamitos (2002)
39. Shaltiel, R.: How to get more mileage from randomness extractors. In: CCC 2006: Proceed-ings of the 21st Annual IEEE Conference on Computational Complexity, Washington, DC, USA, 2006, pp. 46-60. IEEE Computer Society, Los Alamitos (2006)
40. Shamir, A., Tromer, E.: Acoustic cryptanalysis. on nosy people and noisy machines, http://people.csail.mit.edu/tromer/acoustic/(accessed on 29.03.2010)
41. Trevisan, L., Vadhan, S.P.: Extracting randomness from samplable distributions. In: FOCS, pp. 32-42 (2000)
42. Vazirani, U.V.: Strong communication complexity or generating quasirandom sequences form two communicating semi-random sources. Combinatorica 7(4), 375-392 (1987)
43. von Neumann, J.: Various techniques used in connection with random digits. J. Research Nat. Bur. Stand., Appl. Math. Series 12, 36-38 (1951)
44. Wegener, I.: The Complexity of Boolean Functions. John Wiley and Sons Ltd., B. G. Teubner (1987), http://eccc.hpi-web.de/static/books/The-Complexity- of- Boolean-Functions/