Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
A steady on the generalized key agreement and password authentication protocol
Autore:
Kwon, T; Song, J;
Indirizzi:
Univ Calif Berkeley, Div Comp Sci, Berkeley, CA 94720 USA Univ Calif Berkeley Berkeley CA USA 94720 omp Sci, Berkeley, CA 94720 USA Yonsei Univ, Fac Dept Comp Sci, Seoul 120749, South Korea Yonsei Univ Seoul South Korea 120749 Comp Sci, Seoul 120749, South Korea
Titolo Testata:
IEICE TRANSACTIONS ON COMMUNICATIONS
fascicolo: 9, volume: E83B, anno: 2000,
pagine: 2044 - 2050
SICI:
0916-8516(200009)E83B:9<2044:ASOTGK>2.0.ZU;2-S
Fonte:
ISI
Lingua:
ENG
Keywords:
security; key agreement; password authentication; discrete logarithm problem;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
21
Recensione:
Indirizzi per estratti:
Indirizzo: Kwon, T Univ Calif Berkeley, Div Comp Sci, Berkeley, CA 94720 USA Univ Calif Berkeley Berkeley CA USA 94720 Berkeley, CA 94720 USA
Citazione:
T. Kwon e J. Song, "A steady on the generalized key agreement and password authentication protocol", IEICE TR CO, E83B(9), 2000, pp. 2044-2050

Abstract

We study how to generalize a key agreement and password authentication protocol on the basis of the well known hard problems such as a discrete logarithm problem and a Diffie-Hellman problem. The key agreement and password authentication protocol is necessary for networked or internet-worked environments to provide the user knowledge-based authentication and to establish a new cryptographic key for the further secure session. The generalized protocol implies in this paper to require only weak constraints and to be generalized easily in any other cyclic groups which preserve two hard problems. The low entropy of password has made it difficult to design such a protocol and to prove its security soundness. In this paper, we devise a protocol which is easy to be generalized and show its security soundness in the random oracle model. The proposed protocol reduces the constraints extremely only to avoiding a smooth prime modulus. Our main contribution is in solving the password's low entropy problem in the multiplicative group for the generalization.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 04/04/20 alle ore 08:46:16