메뉴 건너뛰기




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

Intrusion-resilience via the bounded-storage model

Author keywords

[No Author keywords available]

Indexed keywords

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

EID: 33745532541     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11681878_11     Document Type: Conference Paper
Times cited : (91)

References (32)
  • 2
    • 24144439329 scopus 로고    scopus 로고
    • Two remarks on public key cryptology
    • [And02] University of Cambridge, Computer Laboratory
    • [And02] R. Anderson. Two remarks on public key cryptology. Technical report, University of Cambridge, Computer Laboratory, 2002.
    • (2002) Technical Report
    • Anderson, R.1
  • 5
    • 33745583251 scopus 로고    scopus 로고
    • ISBN 3-89649-185-7, HartungGorre Verlag, Konstanz
    • Reprint as vol. 1 of ETH Series in Information Security and Cryptography, ISBN 3-89649-185-7, HartungGorre Verlag, Konstanz, 1997
    • (1997) ETH Series in Information Security and Cryptography , vol.1
  • 8
    • 35248897599 scopus 로고    scopus 로고
    • A forward-secure public-key encryption scheme
    • [CHK03] Advances in Cryptology - EUROCRYPT 2003, International Conference on the Theory and Applications of Cryptographic Techniques, Warsaw, Poland, May 4-8, 2003, Proceedings
    • [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.
    • (2003) Lecture Notes in Computer Science , vol.2656 , pp. 255-271
    • Canetti, R.1    Halevi, S.2    Katz, J.3
  • 9
    • 35048860626 scopus 로고    scopus 로고
    • Analysis of key-exchange protocols and their use for building secure channels
    • [CK01] Advances in Cryptology - EUROCRYPT 2001, International Conference on the Theory and Application of Cryptographic Techniques, Innsbruck, Austria, May 6-10, 2001, Proceeding
    • [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.
    • (2001) Lecture Notes in Computer Science , vol.2045 , pp. 453-474
    • Canetti, R.1    Krawczyk, H.2
  • 10
    • 84958598231 scopus 로고    scopus 로고
    • Unconditional security against memorybounded adversaries
    • [CM97] Burton S. Kaliski Jr., editor, CRYPTO, Springer
    • [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.
    • (1997) Lecture Notes in Computer Science , vol.1294 , pp. 292-306
    • Cachin, C.1    Maurer, U.2
  • 11
    • 35248884707 scopus 로고    scopus 로고
    • Intrusionresilient public-key encryption
    • [DFK+03] Topics in Cryptology - CT-RSA 2003, The Cryptographers ' Track at the RSA Conference 2003, San Francisco, CA, USA, April 13-17, 2003, Proceedings
    • [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.
    • (2003) Lecture Notes in Computer Science , vol.2612 , pp. 19-32
    • Dodis, Y.1    Franklin, M.K.2    Katz, J.3    Miyaji, A.4    Yung, M.5
  • 12
    • 35048834253 scopus 로고    scopus 로고
    • A generic construction for intrusion-resilient public-key encryption
    • [DFK+04] Tatsuaki Okamoto, editor, CT-RSA, Springer
    • [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.
    • (2004) Lecture Notes in Computer Science , vol.2964 , pp. 81-98
    • Dodis, Y.1    Franklin, M.K.2    Katz, J.3    Miyaji, A.4    Yung, M.5
  • 13
    • 35048840744 scopus 로고    scopus 로고
    • Constant-round oblivious transfer in the bounded storage model
    • [DHRS04] M. Naor, editor, TCC, Springer
    • [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.
    • (2004) Lecture Notes in Computer Science , vol.2951 , pp. 446-472
    • Ding, Y.Z.1    Harnik, D.2    Rosen, A.3    Shaltiel, R.4
  • 14
    • 84880895217 scopus 로고    scopus 로고
    • Oblivious transfer in the bounded storage model
    • [Din01] Joe Kilian, editor, CRYPTO, Springer
    • [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.
    • (2001) Lecture Notes in Computer Science , vol.2139 , pp. 155-170
    • Ding, Y.Z.1
  • 15
    • 24144491268 scopus 로고    scopus 로고
    • Error correction in the bounded storage model
    • [Din05] J. Kilian, editor, TCC, Springer
    • [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.
    • (2005) Lecture Notes in Computer Science , vol.3378 , pp. 578-599
    • Ding, Y.Z.1
  • 17
    • 35048832981 scopus 로고    scopus 로고
    • On generating the initial key in the bounded-storage model
    • [DM04a] Jan Camenisch and Christian Cachin, editors, Advances in Oryptology -EUROCRYPT '04, Springer-Verlag, May
    • [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.
    • (2004) Lecture Notes in Computer Science , vol.3027 , pp. 126-137
    • Dziembowski, S.1    Maurer, U.2
  • 18
    • 4344699394 scopus 로고    scopus 로고
    • Optimal randomizer efficiency in the bounded-storage model
    • [DM04b] January
    • [DM04b] S. Dziembowski and U. Maurer. Optimal randomizer efficiency in the bounded-storage model. Journal of Cryptology, 17(1):5-26, January 2004.
    • (2004) Journal of Cryptology , vol.17 , Issue.1 , pp. 5-26
    • Dziembowski, S.1    Maurer, U.2
  • 19
    • 0344839024 scopus 로고    scopus 로고
    • [Dod00] PhD thesis, Massachusetts Institute of Technology, August
    • [Dod00] Y. Dodis. Exposure-Resilient Cryptography. PhD thesis, Massachusetts Institute of Technology, August 2000.
    • (2000) Exposure-resilient Cryptography
    • Dodis, Y.1
  • 21
    • 33745567999 scopus 로고    scopus 로고
    • Intrusion-resilience via the bounded-storage model
    • [Dzi05]
    • [Dzi05] S. Dziembowski, Intrusion-resilience via the bounded-storage model. Cryp tology ePrint Archive.Report 2005/179, 2005. http://eprint.iacr.org/ .
    • (2005) Cryp Tology EPrint Archive. Report , vol.2005 , Issue.179
    • Dziembowski, S.1
  • 24
    • 84937422774 scopus 로고    scopus 로고
    • Sibir: Signer-base intrusion-resilient signatures
    • [IR02] Advances in Cryptology - CRYPTO 2002, 22nd Annual International Cryptology Conference, Santa Barbara, California, USA, August 18-82, 2002, Proceedings
    • [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.
    • (2002) Lecture Notes in Computer Science , vol.2442 , pp. 499-514
    • Itkis, G.1    Reyzin, L.2
  • 26
    • 33745581489 scopus 로고    scopus 로고
    • Authenticating secure tokens using slow memory access
    • [KS99] USENIX Press
    • [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.
    • (1999) USENIX Workshop on Smart Card Technology , pp. 101106
    • Kelsey, J.1    Schneier, B.2
  • 28
    • 4344636292 scopus 로고    scopus 로고
    • Encryption against storage-bounded adversaries from on-line strong extractors
    • [Lu04] January
    • [Lu04] C.-J. Lu. Encryption against storage-bounded adversaries from on-line strong extractors. Journal of Cryptology, 17(1):27-42, January 2004.
    • (2004) Journal of Cryptology , vol.17 , Issue.1 , pp. 27-42
    • Lu, C.-J.1
  • 29
    • 0026698501 scopus 로고
    • Conditionally-perfect secrecy and a provably-secure randomized cipher
    • [Mau92]
    • [Mau92] U. Maurer. Conditionally-perfect secrecy and a provably-secure randomized cipher. Journal of Cryptology, 5(1):53-66, 1992.
    • (1992) Journal of Cryptology , vol.5 , Issue.1 , pp. 53-66
    • Maurer, U.1
  • 30
    • 35048857905 scopus 로고    scopus 로고
    • Non-interactive timestamping in the bounded storage model
    • [MSTS04] Advances in Cryptology - CRYPTO 2004, 24th Annual International Cryptology Conference, Santa Barbara, California, USA, August 15-19, 2004, Proceedings
    • [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.
    • (2004) Lecture Notes in Computer Science , vol.3152 , pp. 460-476
    • Moran, T.1    Shaltiel, R.2    Ta-Shma, A.3
  • 32
    • 4344628859 scopus 로고    scopus 로고
    • Constructing locally computable extractors and cryptosystems in the bounded-storage model
    • [Vad04] January
    • [Vad04] S. P. Vadhan. Constructing locally computable extractors and cryptosystems in the bounded-storage model. Journal of Cryptology, 17(1):43-77, January 2004.
    • (2004) Journal of Cryptology , vol.17 , Issue.1 , pp. 43-77
    • Vadhan, S.P.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.