On Anonymous Password-Authenticated Key Exchange

• Item type: SIG Technical Reports(1)
• 公開日: 2007-07-19
• タイトル: On Anonymous Password-Authenticated Key Exchange
• タイトル / 言語: en
• タイトル: On Anonymous Password-Authenticated Key Exchange
• 言語: 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
• 著者名: 辛星漢; 古原和邦; 今井, 秀樹
• 著者名(英): Seong, HanSHIN; Kazukuni, KOBARA; Hideki, IMAI
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: An anonymous password-authenticated key exchange (PAKE) protocol is designed to provide both user's password-based authentication and anonymity against a semi-honest server. However the computation and communication costs of the previous construction grow linearly with the number of users. In this paper we propose two efficient anonymous PAKE (called MEAP and VEAP) protocols which provide unconditional anonymity of the involved user. If the pre-computation is allowed the overall computation cost of the MEAP protocol is independent of the number of users. We also show how the VEAP protocol works where the overall computation and communication costs are completely independent of the number of users. In the VEAP protocol user (resp. server) needs only 2 (resp. 3) on-line modular exponentiations. The security of both protocols is based on the CT-CDH (Chosen Target CDH) problem in the random oracle model.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: An anonymous password-authenticated key exchange (PAKE) protocol is designed to provide both user's password-based authentication and anonymity against a semi-honest server. However, the computation and communication costs of the previous construction grow linearly with the number of users. In this paper, we propose two efficient anonymous PAKE (called, MEAP and VEAP) protocols which provide unconditional anonymity of the involved user. If the pre-computation is allowed, the overall computation cost of the MEAP protocol is independent of the number of users. We also show how the VEAP protocol works where the overall computation and communication costs are completely independent of the number of users. In the VEAP protocol, user (resp., server) needs only 2 (resp., 3) on-line modular exponentiations. The security of both protocols is based on the CT-CDH (Chosen Target CDH) problem in the random oracle model.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AA11235941
• 書誌情報: 情報処理学会研究報告コンピュータセキュリティ（CSEC）; 巻 2007, 号 71(2007-CSEC-038), p. 145-151, 発行日 2007-07-19
• Notice: SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc.
• 出版者 / 言語: ja
• 出版者: 情報処理学会