Nam Junghyun, Choo Kim-Kwang Raymond, Kim Junghwan, Kang Hyun-Kyu, Kim Jinsoo, Paik Juryon, Won Dongho
Department of Computer Engineering, Konkuk University, 268 Chungwondaero, Chungju, Chungcheongbukdo 380-701, Republic of Korea.
Information Assurance Research Group, Advanced Computing Research Centre, University of South Australia, Mawson Lakes, SA 5095, Australia.
ScientificWorldJournal. 2014;2014:825072. doi: 10.1155/2014/825072. Epub 2014 Apr 14.
Protocols for password-only authenticated key exchange (PAKE) in the three-party setting allow two clients registered with the same authentication server to derive a common secret key from their individual password shared with the server. Existing three-party PAKE protocols were proven secure under the assumption of the existence of random oracles or in a model that does not consider insider attacks. Therefore, these protocols may turn out to be insecure when the random oracle is instantiated with a particular hash function or an insider attack is mounted against the partner client. The contribution of this paper is to present the first three-party PAKE protocol whose security is proven without any idealized assumptions in a model that captures insider attacks. The proof model we use is a variant of the indistinguishability-based model of Bellare, Pointcheval, and Rogaway (2000), which is one of the most widely accepted models for security analysis of password-based key exchange protocols. We demonstrated that our protocol achieves not only the typical indistinguishability-based security of session keys but also the password security against undetectable online dictionary attacks.
三方环境下仅使用密码认证的密钥交换(PAKE)协议允许在同一认证服务器注册的两个客户端从各自与服务器共享的密码中导出一个公共密钥。现有的三方PAKE协议在存在随机预言机的假设下或在不考虑内部攻击的模型中被证明是安全的。因此,当随机预言机用特定哈希函数实例化或对伙伴客户端发动内部攻击时,这些协议可能会变得不安全。本文的贡献在于提出首个三方PAKE协议,其安全性在一个捕捉内部攻击的模型中无需任何理想化假设即可得到证明。我们使用的证明模型是Bellare、Pointcheval和Rogaway(2000)基于不可区分性的模型的一个变体,该模型是基于密码的密钥交换协议安全分析中最广泛接受的模型之一。我们证明了我们的协议不仅实现了会话密钥典型的基于不可区分性的安全性,还实现了针对不可检测的在线字典攻击的密码安全性。