Intrusion-resilience via the bounded-storage model

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

Volumn 3876 LNCS, Issue , 2006, Pages 207-224

  Dziembowski, Stefan ^a,b  

^a UNIVERSITY OF WARSAW   (Poland)

^b CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAMMING; DATA TRANSFER; MATHEMATICAL MODELS; NETWORK PROTOCOLS; SECURITY OF DATA; USER INTERFACES;

BOUNDED-STORAGE MODELS; CRYPTOGRAPHIC PROTOCOLS; CRYPTOGRAPHIC TASKS; INTRUSION-RESILIENCE;

CRYPTOGRAPHY;

EID: 33745532541     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11681878_11     Document Type: Conference Paper

References (32)

1. [ADR02] Y, Aumann, Y. Z. Ding, and M. O. Rabin, Everlasting security in the bounded storage model, IEEE Transactions on Information Theory, 48(6): 1668-1680, 2002
2. [And02] R. Anderson. Two remarks on public key cryptology. Technical report, University of Cambridge, Computer Laboratory, 2002.
3. [BR93] M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In ACM Conference on Computer and Communications Security, pages 62-73, 1993.
4. [Cac97] Christian Cachin. Entropy Measures and Unconditional Security in Cryptography. PhD thesis, ETH Zurich, 1997
5. Reprint as vol. 1 of ETH Series in Information Security and Cryptography, ISBN 3-89649-185-7, HartungGorre Verlag, Konstanz, 1997
6. [CCM98] C. Cachin, C. Crepeau, and J. Mardi, Oblivious transfer with a memorybounded receiver. In 39th Annual Symposium on Foundations of Computer Science, pages 493-502, 1998.
7. [CDD+05] D. Cash, Y. Z. Ding, Y. Dodis, W. Lee, R. Lipton, and S. Walfish, Intrusion-resilient authentication and key agreement in the limited communication model. Manuscript, 2005.
8. [CHK03] R. Canetti, S. Halevi, and J. Katz. A forward-secure public-key encryption scheme. In Advances in Cryptology - EUROCRYPT 2003, International Conference on the Theory and Applications of Cryptographic Techniques, Warsaw, Poland, May 4-8, 2003, Proceedings, volume 2656 of Lecture Notes in Computer Science, pages 255-271, 2003.
9. [CK01] R. Canetti and H. Krawczyk. Analysis of key-exchange protocols and their use for building secure channels. In Advances in Cryptology - EUROCRYPT 2001, International Conference on the Theory and Application of Cryptographic Techniques, Innsbruck, Austria, May 6-10, 2001, Proceeding, volume 2045 of Lecture Notes in Computer Science, pages 453-474, 2001.
10. [CM97] C. Cachin and U. Maurer. Unconditional security against memorybounded adversaries. In Burton S. Kaliski Jr., editor, CRYPTO, volume 1294 of Lecture Notes in Computer Science, pages 292-306, Springer, 1997.
11. [DFK+03] Y. Dodis, M. K. Franklin, J. Katz, A. Miyaji, and M. Yung. Intrusionresilient public-key encryption, In Topics in Cryptology - CT-RSA 2003, The Cryptographers ' Track at the RSA Conference 2003, San Francisco, CA, USA, April 13-17, 2003, Proceedings, volume 2612 of Lecture Notes in Computer Science, pages 19-32, 2003.
12. [DFK+04] Y. Dodis, M. K. Franklin, J. Katz, A. Miyaji, and M. Yung. A generic construction for intrusion-resilient public-key encryption. In Tatsuaki Okamoto, editor, CT-RSA, volume 2964 of Lecture Notes in Computer Science, pages 81-98. Springer, 2004.
13. [DHRS04] Y. Z. Ding, D. Harnik, A. Rosen, and R. Shaltiel. Constant-round oblivious transfer in the bounded storage model. In M. Naor, editor, TCC, volume 2951 of Lecture Notes in Computer Science, pages 446-472. Springer, 2004.
14. [Din01] Y. Z. Ding. Oblivious transfer in the bounded storage model. In Joe Kilian, editor, CRYPTO, volume 2139 of Lecture Notes in Computer Science, pages 155-170. Springer, 2001.
15. [Din05] Y. Z. Ding. Error correction in the bounded storage model. In J. Kilian, editor, TCC, volume 3378 of Lecture Notes in Computer Science, pages 578-599. Springer, 2005.
16. [DLL05] D. Dagon, W. Lee, and R. J. Lipton. Protecting secret data from insider attacks, In Financial Cryptography and Data Security, 9th International Conference, FC 2005, Roseau, The Commonwealth of Dominica, February 28 - March 3, 2005, pages 16-30, 2005.
17. [DM04a] S. Dziembowski and U. Maurer. On generating the initial key in the bounded-storage model. In Jan Camenisch and Christian Cachin, editors, Advances in Oryptology -EUROCRYPT '04, volume 3027 of Lecture Notes in Computer Science, pages 126-137, Springer-Verlag, May 2004.
18. [DM04b] S. Dziembowski and U. Maurer. Optimal randomizer efficiency in the bounded-storage model. Journal of Cryptology, 17(1):5-26, January 2004.
19. [Dod00] Y. Dodis. Exposure-Resilient Cryptography. PhD thesis, Massachusetts Institute of Technology, August 2000.
20. [DvOW92] W. Diffie, P. C. van Oorschot, and M. J. Wiener. Authentication and authenticated key exchanges. Designs, Codes and Cryptography, 2(2): 107-125, 1992.
21. [Dzi05] S. Dziembowski, Intrusion-resilience via the bounded-storage model. Cryp tology ePrint Archive.Report 2005/179, 2005. http://eprint.iacr.org/ .
22. [GM84] S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(2):270-299, 1984.
23. [Go104] O. Goldreich. Foundations of Cryptography: Volume 2, Basic Applications. Cambridge University Press, New York, NY, USA, 2004.
24. [IR02] G. Itkis and L. Reyzin. Sibir: Signer-base intrusion-resilient signatures. In Advances in Cryptology - CRYPTO 2002, 22nd Annual International Cryptology Conference, Santa Barbara, California, USA, August 18-82, 2002, Proceedings, volume 2442 of Lecture Notes in Computer Science, pages 499-514, 2002.
25. [Kra96] H. Krawczyk. A versatile secure key-exchange mechanism for the internet. In Proceedings of the 1996 Symposium on Network and Distributed System Security (SNDSS '96), pages 114-127. IEEE Computer Society, 1996.
26. [KS99] J, Kelsey and B. Schneier. Authenticating secure tokens using slow memory access. In USENIX Workshop on Smart Card Technology, pages 101106. USENIX Press, 1999.
27. [KSWH00] J. Kelsey, B. Schneier, D. Wagner, and C. Hall. Side channel cryptanalysis of product ciphers. Journal of Computer Security, 8(2/3), 2000.
28. [Lu04] C.-J. Lu. Encryption against storage-bounded adversaries from on-line strong extractors. Journal of Cryptology, 17(1):27-42, January 2004.
29. [Mau92] U. Maurer. Conditionally-perfect secrecy and a provably-secure randomized cipher. Journal of Cryptology, 5(1):53-66, 1992.
30. [MSTS04] T. Moran, R. Shaltiel, and A. Ta-Shma. Non-interactive timestamping in the bounded storage model. In Advances in Cryptology - CRYPTO 2004, 24th Annual International Cryptology Conference, Santa Barbara, California, USA, August 15-19, 2004, Proceedings, volume 3152 of Lecture Notes in Computer Science, pages 460-476, 2004.
31. [NZ96] N. Nisan and D. Zucker man, Randomness is linear in space. Journal of Computer and System Sciences, 52(1):43-52, 1996.
32. [Vad04] S. P. Vadhan. Constructing locally computable extractors and cryptosystems in the bounded-storage model. Journal of Cryptology, 17(1):43-77, January 2004.