有效的口令认证的三方密钥交换协议

对于口令认证的密钥交换协议的安全性要求,提出一种口令认证的三方密钥交换协议,利用服务器存储客户端口令的验证值、双线性对与基于身份加密算法等内容进行协议的设计,并对协议进行了安全性和效率的两个方面的分析。分析表明,所提出的协议具有口令认证的三方密钥交换协议的安全属性要求,也具有较好的效率。     

两轮的口令认证的两方密钥交换协议

对于口令认证密钥交换协议的要求,利用基于身份加密算法、双线性对与哈希函数的相关内容,提出一种口令认证的两方密钥交换协议,并对该协议进行安全性和效率的两个方面的分析。分析表明,该协议具有较高的效率,并具有两方密钥交换协议的安全属性。     

改进的跨域口令认证密钥交换协议

描述一个跨域口令认证密钥交换协议,在其基础上对跨域C2C-PAKE协议的安全模型进行改进。通过引入公钥密码体制,结合离散对数高可靠等特点,提出改进的跨域口令认证密钥交换协议。该协议步骤简单,具有语义安全性、密钥保密性,实现了服务器与用户之间的双向认证,能对抗不可检测在线字典攻击等常见攻击。安全性分析表明该协议是安全有效的。     

基于移动端协助的硬口令认证密钥交换协议

针对现有口令认证密钥交换协议易受各种网络攻击,影响用户私密信息安全的问题,提出一种基于移动端协助的硬口令认证密钥交换协议,在移动端的辅助下,允许用户使用单一口令建立与服务器之间的安全会话。协议中,用户无须记忆任何复杂的私钥信息,即使移动设备丢失、被盗或遭受恶意软件侵袭,也不会损害用户信息。安全性和性能分析表明,协议明显降低了服务器的计算消耗,大大提高了用户私密信息的安全性,可以抵御字典攻击、中间人攻击等的影响,减轻用户记忆负担,缓解存储压力,易于部署。     

强安全性的三方口令认证密钥交换协议

基于可证明安全的AugPAKE协议,提出一种具有强安全性的三方口令认证密钥交换(3PAKE)协议,协议中避免使用服务器的公钥进行认证,以保证执行效率.安全性分析结果表明,该协议可抵抗字典攻击、服务器泄露攻击等已知攻击,并具有对服务器的密钥保密性以及前向安全性.在随机预言模型下,基于DDH、SDH假设证明了该协议的安全性.     

一个前向安全的基于口令认证的三方密钥交换协议

目前,文献中提出的基于口令认证的密钥交换协议,很多都是针对两方的情形设计的,即通信双方为客户与服务器,它们通过一个预先共享的口令来进行认证的密钥交换.随着现代通信环境的快速变化,需要能为任意客户间构建一个端到端的安全信道,这种应用的情形与那些文献中所考虑的有很大区别.针对这种情形,文中提出了一个可证前向安全的基于口令认证的三方密钥交换协议,使通信双方在认证服务器的帮助下能相互进行认证并建立一个会话密钥.与前人提出的基于口令认证的三方密钥交换协议相比,该协议在计算代价和通信代价上都较有效,因而更适用于资源受限的环境.此协议的安全性是在口令型的选择基Gap Diffie-Hellman问题难解的假设前提下在随机谕示模型下证明的.     

一种可证安全的两方口令认证密钥交换协议

口令认证的两方密钥交换协议无法抵御口令字典攻击和服务器泄漏伪装攻击。为此,提出一种改进的PAKA-X协议,用户保存自己的口令明文,服务器存储用户口令明文的验证值,由此弥补原协议的安全漏洞。理论分析结果表明,改进协议具有完美前向安全性,能抵抗Denning-Sacco攻击、服务器泄漏攻击、在线和离线字典攻击以及中间人攻击,并且仅需9次指数运算、6次哈希运算和6次异或运算,运行效率较高。     

基于椭圆曲线的加密密钥交换协议

加密密钥交换协议(EKE)的目的是利用安全性低的口令协商安全性高的密钥,进而利用密钥对以后的通信进行加密或身份认证,从而实现安全通信.基于验证元的EKE是针对服务器泄露攻击问题提出的.本文基于椭圆曲线密码系统的特点,给出了一个基于验证元的3EKE,该协议中,服务器通过口令实现对用户的认证;协议能够抵抗服务器泄露等攻击,...     

基于ECDSA的三方口令认证密钥交换协议

提出一种基于椭圆曲线数字签名算法(ECDSA)的三方口令认证密钥交换协议。将ECDSA分为公钥生成、签名过程和验证过程 3个阶段,在此基础上,设计协议过程、双向认证机制,使任意2个用户通过服务器能进行身份认证和密钥交换。分析结果表明,该协议能降低计算难度和存储开销,抵抗字典攻击和服务器泄露攻击。     

基于百万富翁算法的口令认证密钥交换协议

口令认证密钥交换（PAKE）协议由于其便于记忆、运行成本低等特点受到广泛关注。文章在百万富翁协议算法的基础上,通过简化和改进,提出一种口令认证的密钥交换协议。该协议使用一个低熵的口令进行双方的认证,并得到一个高熵的密钥。文章同时分析了该协议对抵御中间人攻击和离线字典攻击的安全性。     

Weakness in a RSA-based password authenticated key exchange protocol

Recently, an efficient password-authenticated key exchange protocol based on RSA has been proposed by Park et al. with formal security proof. In this letter, we analyze their protocol, and show that, unfortunately, it is insecure against an adversary who performs a dictionary attack.     

一种强安全性的多密钥交换协议

当前的两方多密钥交换协议都不能抵抗临时密钥泄露攻击.针对该问题,基于双线性对提出一种新的两方认证密钥交换协议.协议中参与会话的2个用户通过一次会话可以生成4个不同的会话密钥.分析结果表明,该协议可以抵抗临时密钥泄露攻击,与已有同类协议相比,具有更强的安全性,能实现双向认证功能.     

Password authenticated key exchange protocols among diverse network domains

Up to now, all papers in password-authenticated key exchange protocols are constrained to two-party or three-party models. Under these two models, the clients are registered or authenticated by the same server. However, in reality two communicants may register under two different servers. In this case, the above models are inefficient or not suitable any more. This paper will discuss password authenticated key exchange protocol where both communicants are registered in two distinct servers.     

Password-authenticated key exchange based on RSA

There have been many proposals in recent years for password-authenticated key exchange protocols, i.e., protocols in which two parties who share only a short secret password perform a key exchange authenticated with the password. However, the only ones that have been proven secured against offline dictionary attacks were based on Diffie–Hellman key exchange. We examine how to design a secure password-authenticated key exchange protocol based on RSA. In this paper, we first look at the OKE and protected-OKE protocols (both RSA-based) and show that they are insecure. Then we show how to modify the OKE protocol to obtain a password-authenticated key exchange protocol that can be proven secure (in the random oracle model). This protocol is very practical; in fact, it requires about the same amount of computation as the Diffie–Hellman-based protocols. Finally, we present an augmented protocol that is resilient to server compromise, meaning (informally) that an attacker who compromises a server would not be able to impersonate a client, at least not without running an offline dictionary attack against that client’s password.     

基于椭圆曲线的跨域端到端口令认证密钥协商协议

跨域端到端口令认证密钥协商协议(C2C-PAKA)的主要目的是使分布在不同域中持有不同口令的两个客户端可以在各自服务器的协助下实现相互认证并协商出共同的会话密钥。本文中,我们基于椭圆曲线上的离散对数问题,在直接通信架构下给出一个跨域的口令认证的密钥协商协议。该协议中,诚实的服务器是不能获取任何关于会话密钥的值。各参与方之间能够实现相互认证。与同类协议比较,该协议具有较小的通信负担和计算负担,更易于实现。此外,协议还能够抵抗字典攻击、口令泄露模仿攻击和未知会话密钥共享攻击等通用攻击类型,同时能够实现前向安全、无密钥控制和已知会话密钥安全等安全属性。     

Security analysis and improvements of a communication-efficient three-party password authenticated key exchange protocol

Three-party password-authenticated key exchange (3PAKE) protocols allow two clients to establish secure communication channels over a public network merely by sharing a human-memorable (low-entropy) password with a trusted server. In this paper, we first show that the 3PAKE protocol introduced by Chang, Hwang, and Yang is insecure against even passive attackers. Thereafter, we propose two kinds of improvement that can remedy the security flaw in their protocol. Finally, we present simulations to measure the execution time to show the efficiency of our two improvements.     

An efficient protocol for anonymous and fair document exchange

Fairness in document exchange has been well studied, while anonymity in the exchange, which protects the privacy of personal information such as identities and locations, has been either ignored or handled with partial or inappropriate considerations. In this paper we propose a new protocol for anonymous and fair document exchange between two parties with the assistance of an off-line trusted third party. The new protocol treats both fairness and anonymity as essential properties, employs an efficient method for off-line key recovery, and places weak requirements on the security of the third party.