(Enter summary)
Abstract: We propose a new model for key exchange (KE) based on a
combination of di#erent types of keys. In our setting, servers exchange
keys with clients, who memorize short passwords and carry (stealable)
storage cards containing long (cryptographic) keys. Our setting is a generalization
of that of Halevi and Krawczyk [17] (HK), where clients have
a password and the public key of the server. (Update)
Cited by: More
Research Statement - Kolesnikov (2005)
(Correct)
Active bibliography (related documents): More All
0.8: Key Exchange Using Passwords and Long Keys - Vladimir Kolesnikov And (2006)
(Correct)
0.3: A Password-Based Authenticator: Security Proof and.. - Hitchcock, Tin..
(Correct)
0.0: Authentication and Key Agreement via Memorable Password - Kwon (2001)
(Correct)
Similar documents based on text:
6.0: Unknown -
(Correct)
BibTeX entry: (Update)
Vladimir Kolesnikov and Charles Racko#. Key exchange using passwords and long keys. In Third Theory of Cryptography Conference, TCC 2006. http://citeseer.ist.psu.edu/kolesnikov06key.html More
@misc{ kolesnikov06key,
author = "V. Kolesnikov and C. Racko",
title = "Key exchange using passwords and long keys",
text = "Vladimir Kolesnikov and Charles Racko#. Key exchange using passwords and
long keys. In Third Theory of Cryptography Conference, TCC 2006.",
year = "2006",
url = "citeseer.ist.psu.edu/kolesnikov06key.html" }
Citations (may not include all citations):
188
Entity authentication and key distribution (context) - Bellare, Rogaway - 1994
150
Encrypted key exchange: Password-based protocols secureagain..
- Bellovin, Merritt - 1992
120
A modular approach to the design and analysis of authenticat.. (context) - Bellare, Canetti et al. - 1998
110
Authenticated key exchange secure against dictionary attacks
- Bellare, Pointcheval et al. - 2000
49
Provably Secure Password-Authenticated Key Exchange Using Di..
- Boyko, MacKenzie et al. - 2000
3
Public-key cryptography and password protocols: the multi-us.. (context) - Boyarsky - 1999
2
Secure short key cryptosystems: 40 bits are enough (context) - Buss, Yianilos - 1999
Documents on the same site (http://www.cs.toronto.edu/~vlad/): More
Multidimensional Subset Sum Problem - Kolesnikov (1997)
(Correct)
Gate Evaluation Secret Sharing and Secure One-Round Two-Party.. - Kolesnikov (2005)
(Correct)
Multidimensional Subset Sum Problem - Kolesnikov (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC