메뉴 건너뛰기




Volumn 4117 LNCS, Issue , 2006, Pages 142-159

A method for making password-based key exchange resilient to server compromise

Author keywords

[No Author keywords available]

Indexed keywords

CLIENT SERVER COMPUTER SYSTEMS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; SECURITY OF DATA; SECURITY SYSTEMS; SERVERS;

EID: 33749542277     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11818175_9     Document Type: Conference Paper
Times cited : (66)

References (51)
  • 2
    • 33749582730 scopus 로고    scopus 로고
    • Protocol initialization for the framework of universal composability
    • Report 2004/006
    • B. Barak, Y. Lindell, and T. Rabin. Protocol initialization for the framework of universal composability. In Cryptology ePrint Archive, Report 2004/006, http://eprint.iacr.org/, 2004.
    • (2004) Cryptology ePrint Archive
    • Barak, B.1    Lindell, Y.2    Rabin, T.3
  • 3
    • 84873466407 scopus 로고    scopus 로고
    • Authenticated key exchange secure against dictionary attacks
    • M. Bellare, D. Pointcheval, and P. Rogaway. Authenticated key exchange secure against dictionary attacks. In EUROCRYPT, pp. 139-155, 2000.
    • (2000) Eurocrypt , pp. 139-155
    • Bellare, M.1    Pointcheval, D.2    Rogaway, P.3
  • 5
    • 84945119254 scopus 로고
    • Entity authentication and key distribution
    • M. Bellare and P. Rogaway. Entity authentication and key distribution. In CRYPTO, pp. 232-249, 1993.
    • (1993) Crypto , pp. 232-249
    • Bellare, M.1    Rogaway, P.2
  • 6
    • 35048832490 scopus 로고    scopus 로고
    • An uninstantiable random-oracle-model scheme for a hybrid-encryption problem
    • M. Bellare, A. Boldyreva and A. Palacio. An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem. In EUROCRYPT, pp. 171-188, 2004.
    • (2004) Eurocrypt , pp. 171-188
    • Bellare, M.1    Boldyreva, A.2    Palacio, A.3
  • 7
    • 0026850091 scopus 로고
    • Encrypted key exchange: Password-based protocols secure against dictionary attacks
    • S. M. Bellovin and M. Merritt. Encrypted key exchange: Password-based protocols secure against dictionary attacks. In IEEE Symp. on Research in Security and Privacy, pp. 72-84, 1992.
    • (1992) IEEE Symp. on Research in Security and Privacy , pp. 72-84
    • Bellovin, S.M.1    Merritt, M.2
  • 8
    • 0027741529 scopus 로고
    • Augmented encrypted key exchange: A password-based protocol secure against dictionary attacks and password file compromise
    • S. M. Bellovin and M. Merritt. Augmented encrypted key exchange: A password-based protocol secure against dictionary attacks and password file compromise. In 1st ACM Conf. on Computer and Communications Security, pp. 244-250, 1993.
    • (1993) 1st ACM Conf. on Computer and Communications Security , pp. 244-250
    • Bellovin, S.M.1    Merritt, M.2
  • 9
    • 84941147044 scopus 로고    scopus 로고
    • Personal communication
    • D. Bleichenbacher. Personal communication.
    • Bleichenbacher, D.1
  • 10
    • 84937550984 scopus 로고    scopus 로고
    • Provably secure password authentication and key exchange using Diffie-Hellman
    • V. Boyko, P. MacKenzie, and S. Patel. Provably secure password authentication and key exchange using Diffie-Hellman. In EUROCRYPT, pp. 156-171, 2000.
    • (2000) Eurocrypt , pp. 156-171
    • Boyko, V.1    MacKenzie, P.2    Patel, S.3
  • 11
    • 28144462281 scopus 로고    scopus 로고
    • Universally composable security: A new paradigm for cryptographic protocols
    • Report 2000/067
    • R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In Cryptology ePrint Archive, Report 2000/067. http://eprint.iacr.org/, 2005.
    • (2005) Cryptology ePrint Archive
    • Canetti, R.1
  • 12
    • 35048875340 scopus 로고    scopus 로고
    • On the random-oracle methodology as applied to length-restricted signature schemes
    • R. Canetti, O. Goldreich, and S. Halevi. On the random-oracle methodology as applied to length-restricted signature schemes. In Theory of Cryptography Conference - TCC, pp. 40-57, 2004.
    • (2004) Theory of Cryptography Conference - TCC , pp. 40-57
    • Canetti, R.1    Goldreich, O.2    Halevi, S.3
  • 13
    • 4243180376 scopus 로고    scopus 로고
    • The random oracle methodology, revisited
    • R. Canetti, O. Goldreich and S. Halevi. The random oracle methodology, revisited. J. ACM, 51(4):557-594, 2004.
    • (2004) J. ACM , vol.51 , Issue.4 , pp. 557-594
    • Canetti, R.1    Goldreich, O.2    Halevi, S.3
  • 15
    • 35248819315 scopus 로고    scopus 로고
    • Universal Composition with Joint State
    • R. Canetti and T. Rabin. Universal Composition with Joint State In CRYPTO, pp. 265-281, 2003.
    • (2003) Crypto , pp. 265-281
    • Canetti, R.1    Rabin, T.2
  • 16
    • 35248822669 scopus 로고    scopus 로고
    • Provably secure threshold password authenticated key exchange
    • M. Di Raimondo and R. Gennaro. Provably Secure Threshold Password Authenticated Key Exchange. In EUROCRYPT, pp. 507-523, 2003.
    • (2003) Eurocrypt , pp. 507-523
    • Di Raimondo, M.1    Gennaro, R.2
  • 18
    • 35248830706 scopus 로고    scopus 로고
    • A framework for password-based authenticated key exchange
    • R. Gennaro and Y. Lindell. A Framework for Password-Based Authenticated Key Exchange. In EUROCRYPT, pp. 524-543, 2003.
    • (2003) Eurocrypt , pp. 524-543
    • Gennaro, R.1    Lindell, Y.2
  • 20
    • 84880888233 scopus 로고    scopus 로고
    • Session-key generation using human passwords only
    • O. Goldreich and Y. Lindell. Session-Key Generation using Human Passwords Only. In CRYPTO, pp. 408-432, 2001.
    • (2001) Crypto , pp. 408-432
    • Goldreich, O.1    Lindell, Y.2
  • 21
    • 0023985465 scopus 로고
    • A digital signature scheme secure against adaptive chosen-message attacks
    • April
    • S. Goldwasser, S. Micali, and R. L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal of Computing 17(2):281-308, April 1988.
    • (1988) SIAM Journal of Computing , vol.17 , Issue.2 , pp. 281-308
    • Goldwasser, S.1    Micali, S.2    Rivest, R.L.3
  • 23
    • 0029531472 scopus 로고
    • Optimal authentication protocols resistant to password guessing attacks
    • L. Gong. Optimal authentication protocols resistant to password guessing attacks. In 8th IEEE Computer Security Foundations Workshop, pp. 24-29, 1995.
    • (1995) 8th IEEE Computer Security Foundations Workshop , pp. 24-29
    • Gong, L.1
  • 27
    • 0013443819 scopus 로고    scopus 로고
    • Extended password key exchange protocols immune to dictionary attack
    • D. Jablon. Extended password key exchange protocols immune to dictionary attack. In WETICE'97 Workshop on Enterprise Security, 1997.
    • (1997) WETICE'97 Workshop on Enterprise Security
    • Jablon, D.1
  • 31
    • 84945132563 scopus 로고    scopus 로고
    • Practical password-authenticated key exchange provably secure under standard assumptions
    • J. Katz, R. Ostrovsky, and M. Yung. Practical password-authenticated key exchange provably secure under standard assumptions. In EUROCRYPT, pp. 475-494, 2001.
    • (2001) Eurocrypt , pp. 475-494
    • Katz, J.1    Ostrovsky, R.2    Yung, M.3
  • 34
    • 0345686108 scopus 로고    scopus 로고
    • Open key exchange: How to defeat dictionary attacks without encrypting public keys
    • S. Lucks. Open key exchange: How to defeat dictionary attacks without encrypting public keys. In Proc. of the Workshop on Security Protocols, 1997.
    • (1997) Proc. of the Workshop on Security Protocols
    • Lucks, S.1
  • 35
    • 84937579448 scopus 로고    scopus 로고
    • More Efficient password-authenticated key exchange
    • P. MacKenzie. More Efficient Password-Authenticated Key Exchange. In RSA Conference, Cryptographer's Track, pp. 361-377, 2001.
    • (2001) RSA Conference, Cryptographer's Track , pp. 361-377
    • MacKenzie, P.1
  • 36
    • 12544256011 scopus 로고    scopus 로고
    • The PAK suite: Protocols for password-authenticated key exchange
    • October
    • P. MacKenzie. The PAK suite: Protocols for password-authenticated key exchange. DIMACS Technical Report 2002-46, October, 2002.
    • (2002) DIMACS Technical Report , vol.2002 , Issue.46
    • MacKenzie, P.1
  • 37
    • 84937402236 scopus 로고    scopus 로고
    • Password authenticated key exchange based on RSA
    • P. MacKenzie, S. Patel, and R. Swaminathan. Password authenticated key exchange based on RSA. In ASIACRYPT, pp. 599-613, 2000.
    • (2000) Asiacrypt , pp. 599-613
    • MacKenzie, P.1    Patel, S.2    Swaminathan, R.3
  • 38
    • 29644437598 scopus 로고    scopus 로고
    • Threshold passwordauthenticated key exchange
    • P. MacKenzie, T. Shrimpton, and M. Jakobsson. Threshold PasswordAuthenticated Key Exchange. J. Cryptology, 19(1):27-66, 2006.
    • (2006) J. Cryptology , vol.19 , Issue.1 , pp. 27-66
    • MacKenzie, P.1    Shrimpton, T.2    Jakobsson, M.3
  • 39
    • 35048817517 scopus 로고    scopus 로고
    • Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology
    • U. Maurer, R. Renner, and C. Holenstein. Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology. In Theory of Cryptography Conference - TCC, pp. 21-39, 2004.
    • (2004) Theory of Cryptography Conference - TCC , pp. 21-39
    • Maurer, U.1    Renner, R.2    Holenstein, C.3
  • 41
    • 84941161127 scopus 로고    scopus 로고
    • National Institute of Standards and Technology (NIST). Announcing the Secure Hash Standard, PIPS 180-1, U.S. Department of Commerce, April, 1995
    • National Institute of Standards and Technology (NIST). Announcing the Secure Hash Standard, PIPS 180-1, U.S. Department of Commerce, April, 1995.
  • 42
    • 35048854655 scopus 로고    scopus 로고
    • Simpler session-key generation from short random passwords
    • M. Nguyen and S. Vadhan. Simpler Session-Key Generation from Short Random Passwords. In Theory of Cryptography Conference - TCC, pp. 428-445, 2004.
    • (2004) Theory of Cryptography Conference - TCC , pp. 428-445
    • Nguyen, M.1    Vadhan, S.2
  • 43
    • 84937420653 scopus 로고    scopus 로고
    • Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case Jesper Buus Nielsen
    • J. B. Nielsen. Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-Committing Encryption Case Jesper Buus Nielsen. In CRYPTO, pp. 111-126, 2002
    • (2002) CRYPTO , pp. 111-126
    • Nielsen, J.B.1
  • 44
    • 35248858454 scopus 로고    scopus 로고
    • Making a faster cryptanalytic time-memory trade-off
    • P. Oechslin. Making a faster cryptanalytic time-memory trade-off. In CRYPTO, pp. 617-630, 2003.
    • (2003) Crypto , pp. 617-630
    • Oechslin, P.1
  • 46
    • 84927727752 scopus 로고    scopus 로고
    • Security proofs for signature schemes
    • D. Pointcheval and J. Stern. Security proofs for signature schemes. In EURO-CRYPT, pp. 387-398, 1996.
    • (1996) Euro-crypt , pp. 387-398
    • Pointcheval, D.1    Stern, J.2
  • 47
    • 0000537828 scopus 로고
    • Efficient identification and signatures for smart cards
    • C. P. Schnorr. Efficient identification and signatures for smart cards. In CRYPTO, pp. 235-251, 1989.
    • (1989) Crypto , pp. 235-251
    • Schnorr, C.P.1
  • 51
    • 33745922955 scopus 로고    scopus 로고
    • New approaches to password authenticated key exchange based on RSA
    • M. Zhang. New Approaches to Password Authenticated Key Exchange Based on RSA. In ASIACRYPT, pp. 230-244, 2004.
    • (2004) Asiacrypt , pp. 230-244
    • Zhang, M.1


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