An Eflicient Anonymous Password - Authenticated Key EXchange Protocol

• Item type: SIG Technical Reports(1)
• 公開日: 2006-07-21
• タイトル: An Eflicient Anonymous Password - Authenticated Key EXchange Protocol
• タイトル / 言語: en
• タイトル: An Efficient Anonymous Password-Authenticated Key Exchange Protocol
• 言語: eng
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_18gh
• 資源タイプ: technical report
• 著者所属: 産業技術総合研究所情報セキュリティ研究センター
• 著者所属: 産業技術総合研究所情報セキュリティ研究センター
• 著者所属: 産業技術総合研究所情報セキュリティ研究センター/中央大学理工学部電気電子通信工学科
• 著者所属(英): en
• 著者所属(英): Research Center for Information Security, AIST,
• 著者所属(英): en
• 著者所属(英): Research Center for Information Security, AIST,
• 著者所属(英): en
• 著者所属(英): Research Center for Information Security, AIST/Chuo University
• 著者名: 辛星漢; 古原和邦; 今井, 秀樹
• 著者名(英): SeongHan, SHIN; Kazukuni, KOBARA; Hideki, IMAI
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: Recently Viet et aL [21] have proposed an anonymous password-authenticated key exchange (PAKE) protocol against a passive server who follows the protocol honestly but it is curious about identity of client. In this paper we propose an efficient construction for anonymous PAKE protocol (we call it the EAP protocol) which provides semantic security of session keys in the random oracle model with the reduction to the computational Diffie-Hellman problem as well as anonymity against a passive server. Specially the EAP protocol has about 50% reduction (com pared to [21]) in the number of modular exponentiations for both client and server and its communication bandwidth for the modular size of prime p is independent from the number of clients while [21] is not.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: Recently, Viet et aL, [21] have proposed an anonymous password-authenticated key exchange (PAKE) protocol against a passive server, who follows the protocol honestly but it is curious about identity of client. In this paper, we propose an efficient construction for anonymous PAKE protocol (we call it the EAP protocol) which provides semantic security of session keys in the random oracle model, with the reduction to the computational Diffie-Hellman problem, as well as anonymity against a passive server. Specially, the EAP protocol has about 50% reduction (com pared to [21]) in the number of modular exponentiations for both client and server, and its communication bandwidth for the modular size of prime p is independent from the number of clients while [21] is not.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AA11235941
• 書誌情報: 情報処理学会研究報告コンピュータセキュリティ（CSEC）; 巻 2006, 号 81(2006-CSEC-034), p. 337-344, 発行日 2006-07-21
• Notice: SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc.
• 出版者 / 言語: ja
• 出版者: 情報処理学会