The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
이산대수 문제, Diffie-Hellman 문제 등 잘 알려진 어려운 문제를 기반으로 키 합의 및 비밀번호 인증 프로토콜을 일반화하는 방법을 연구합니다. 키 계약 및 비밀번호 인증 프로토콜은 네트워크 또는 상호 연결된 환경에서 사용자 지식 기반 인증을 제공하고 추가 보안 세션을 위한 새로운 암호화 키를 설정하는 데 필요합니다. 일반화된 프로토콜은 이 논문에서 약한 제약만 요구하고 두 가지 어려운 문제를 보존하는 다른 순환 그룹에서 쉽게 일반화될 수 있음을 의미합니다. 비밀번호의 엔트로피가 낮기 때문에 이러한 프로토콜을 설계하고 보안 건전성을 입증하는 것이 어렵습니다. 본 논문에서는 일반화가 용이하고 랜덤 오라클 모델에서 보안 건전성을 보이는 프로토콜을 고안한다. 제안된 프로토콜은 부드러운 프라임 모듈러스를 피하기 위해 제약 조건을 극도로 줄입니다. 우리의 주요 기여는 일반화를 위한 곱셈 그룹에서 비밀번호의 낮은 엔트로피 문제를 해결하는 것입니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Taekyoung KWON, Jooseok SONG, "A Study on the Generalized Key Agreement and Password Authentication Protocol" in IEICE TRANSACTIONS on Communications,
vol. E83-B, no. 9, pp. 2044-2050, September 2000, doi: .
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 internetworked 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e83-b_9_2044/_p
부
@ARTICLE{e83-b_9_2044,
author={Taekyoung KWON, Jooseok SONG, },
journal={IEICE TRANSACTIONS on Communications},
title={A Study on the Generalized Key Agreement and Password Authentication Protocol},
year={2000},
volume={E83-B},
number={9},
pages={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 internetworked 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.},
keywords={},
doi={},
ISSN={},
month={September},}
부
TY - JOUR
TI - A Study on the Generalized Key Agreement and Password Authentication Protocol
T2 - IEICE TRANSACTIONS on Communications
SP - 2044
EP - 2050
AU - Taekyoung KWON
AU - Jooseok SONG
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E83-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2000
AB - 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 internetworked 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.
ER -