On the connection between leakage tolerance and adaptive security

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

Volumn 7778 LNCS, Issue , 2013, Pages 497-515

  Nielsen, Jesper Buus ^a   Venturi, Daniele ^a   Zottarel, Angela ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

adaptive security; arguments of knowledge; leakage tolerance; simulation based security

Indexed keywords

ADAPTIVE CORRUPTIONS; ADAPTIVE SECURITY; ADAPTIVITY; ARGUMENTS OF KNOWLEDGE; ENCRYPTION PROTOCOLS; INTERACTIVE PROTOCOLS; INTERNAL STATE; KEY PAIRS; LEAKAGE TOLERANCE; LEAKAGE-TOLERANT; MESSAGE SPACE; PROTOCOL EXECUTION; SECRET KEY; SECURE MESSAGE TRANSMISSION; SEMI-ADAPTIVE; SIMULATION-BASED SECURITY;

ARTIFICIAL INTELLIGENCE;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84873968328     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-36362-7_30     Document Type: Conference Paper

References (36)

1. Barak, B., Goldreich, O.: Universal arguments and their applications. SIAM J. Comput. 38(5), 1661-1694 (2008)
2. Bellare, M., Goldreich, O.: On Defining Proofs of Knowledge. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 390-420. Springer, Heidelberg (1993)
3. Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: ACM Conference on Computer and Communications Security, pp. 62-73 (1993)
4. Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In: ITCS, pp. 326-349 (2012)
5. Bitansky, N., Canetti, R., Halevi, S.: Leakage-Tolerant Interactive Protocols. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 266-284. Springer, Heidelberg (2012)
6. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS, pp. 136-145 (2001)
7. Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively secure multi-party computation. In: STOC, pp. 639-648 (1996)
8. Daví, F., Dziembowski, S., Venturi, D.: Leakage-Resilient Storage. In: Garay, J.A.,De Prisco, R. (eds.) SCN 2010. LNCS, vol. 6280, pp. 121-137. Springer, Heidelberg (2010)
9. Dodis, Y., Haralambiev, K., López-Alt, A., Wichs, D.: Efficient Public-Key Cryptography in the Presence of Key Leakage. In: Abe, M. (ed.) ASIACRYPT 2010.LNCS, vol. 6477, pp. 613-631. Springer, Heidelberg (2010)
10. Dodis, Y., Kalai, Y.T., Lovett, S.: On cryptography with auxiliary input. In: STOC, pp. 621-630 (2009)
11. Dodis, Y., Lewko, A.B., Waters, B., Wichs, D.: Storing secrets on continually leaky devices. In: FOCS, pp. 688-697 (2011)
12. Dziembowski, S., Faust, S.: Leakage-Resilient Cryptography from the Inner-Product Extractor. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 702-721. Springer, Heidelberg (2011)
13. Dziembowski, S., Faust, S.: Leakage-Resilient Circuits without Computational Assumptions. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 230-247. Springer, Heidelberg (2012)
14. Dziembowski, S., Pietrzak, K.: Leakage-resilient cryptography. In: FOCS, pp. 293-302 (2008)
15. Faust, S., Kiltz, E., Pietrzak, K., Rothblum, G.N.: Leakage-Resilient Signatures. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 343-360. Springer, Heidelberg (2010)
16. 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)
17. Fiat, A., Shamir, A.: How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263,pp. 186-194. Springer, Heidelberg (1987)
18. Garg, S., Jain, A., Sahai, A.: Leakage-Resilient Zero Knowledge. In: Rogaway, P.(ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 297-315. Springer, Heidelberg (2011)
19. Gentry, C., Wichs, D.: Separating succinct non-interactive arguments from all falsifiable assumptions. In: STOC, pp. 99-108 (2011)
20. Halevi, S., Lin, H.: After-the-Fact Leakage in Public-Key Encryption. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 107-124. Springer, Heidelberg (2011)
21. Halevi, S., Myers, S., Rackoff, C.: On Seed-Incompressible Functions. In: Canetti,R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 19-36. Springer, Heidelberg (2008)
22. 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)
23. Jain, A., Pietrzak, K.: Parallel Repetition for Leakage Resilience Amplification Revisited. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 58-69. Springer, Heidelberg (2011)
24. 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)
25. Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: STOC, pp. 723-732 (1992)
26. 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, Heidelberg (1996)
27. 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)
28. Micali, S.: Computationally sound proofs. SIAM J. Comput. 30(4), 1253-1298 (2000)
29. Micali, S., Reyzin, L.: Physically Observable Cryptography (Extended Abstract). In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 278-296. Springer, Heidelberg (2004)
30. Naor, M., Segev, G.: Public-key cryptosystems resilient to key leakage. IACR CryptologyePrint Archive, 2009:105 (2009)
31. Nielsen, J.B.: Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case. In: Yung, M. (ed.) CRYPTO 2002.LNCS, vol. 2442, pp. 111-126. Springer, Heidelberg (2002)
32. Pietrzak, K.: A Leakage-Resilient Mode of Operation. In: Joux, A. (ed.) EUROCRYPT2009. LNCS, vol. 5479, pp. 462-482. Springer, Heidelberg (2009)
33. Pietrzak, K., Wikstrom, D.: Parallel repetition of computationally sound protocols revisited. J. Cryptology 25 (1), 116-135 (2012)
34. 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)
35. Unruh, D.: Quantum Proofs of Knowledge. In: Pointcheval, D., Johansson, T. (eds.)EUROCRYPT 2012. LNCS, vol. 7237, pp. 135-152. Springer, Heidelberg (2012)
36. Wee, H.: On Round-Efficient Argument Systems. In: Caires, L., Italiano, G.F.,Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp.140-152. Springer, Heidelberg (2005)