一种基于椭圆曲线的多方密钥交换协议

在分析已有的Differ-Hellman两方密钥交换协议的基础上,提出了一种基于椭圆曲线的多方密钥协商协议,把椭圆曲线公钥密码体制运用于密钥协商的认证过程,能够有效地防止中间人攻击和重放攻击,保证了密钥协商协议的安全性和实用性.     

基于身份的移动网动态可认证群组密钥协商协议

群组密钥协商是保证无线网络群组安全通信的重要工具之一。2007年,Tseng等提出一种适合无线移动网络的高效群组密钥协商协议。对Tseng协议安全性进行分析,发现Tseng协议不具备认证性,不能抵御主动攻击。因此,通过改进Tseng协议,提出一种新的动态可认证群组密钥协商协议。该协议基于身份的公钥密码体制,降低了建立和管理公钥基础设施的代价;同时,协议支持节点间的相互认证。分析结果表明：协议满足群组密钥所要求的安全准则,降低了普通节点的计算和通信成本。     

基于身份的两方跨域认证密钥协商协议

两方跨域认证密钥协商协议是指来自不同私钥生成中心的两个参与方完成互相认证和协商出相同的会话密钥。基于身份的密码体制能避免公钥基础结构的公钥证书存储问题。双线性对运算复杂度较高,计算成本较大。我们提出了一个新的无双线性对基于身份的两方跨域认证密钥协商协议,并在随机预言模式下证明了协议的安全性。     

基于签密技术的可认证密钥协商协议

对Zheng的可认证密钥协商协议进行改进,提出基于身份签密的可认证密钥协商协议。该协议具有签密技术的优点,在同一个逻辑步内同时实现了认证和加密两项密码功能,提高了协议的效率;基于身份的公钥密码系统的使用,降低了建立和管理公钥基础设施的代价,用户无需存储、管理和传输公钥及其证书;另外,椭圆曲线上双线性对使协议能以短的密钥和小的计算量实现同等安全要求。文中所提的可认证密钥协商协议具有计算量和传输量小,安全性高的特点。     

基于NTRU密码体制的RFID认证协议的研究

对目前基于NTRU的RFID认证协议进行了安全性、效率及成本分析,提出一种基于NTRU密码体制的RFID双向认证协议。其首先将基于SVP问题的密码体制、截联及相关数据相结合从而实现阅读器与标签的双向认证,然后分析了它的安全性及计算性能并采用BAN对其安全性进行了证明,最后将相关协议进行比较分析,结果表明本协议具有更高的安全性与效率以及更低的成本。     

基于EPR协议和Rabin密码的签名方案

提出利用具有可证明无条件安全性的量子密钥分配协议EPR,同具有可证明的数学上大数分解难题与破解其密码体制相等价的Rabin密码相结合的一种数字签名方案.该签名方案采用Rabin公钥密码体制实现数字签名,并以对称量子密钥作为临时会话密钥.经安全性分析,此签名方案可有效抵御各种主动攻击和被动攻击,可用于点对点的保密通信,且同时具有认证的效果.     

一种改进的跨域口令密钥交换协议

跨域的端到端的口令认证密钥交换(C2C-PAKE)协议,可实现不同区域的两个客户通过不同的口令协商出共享的会话密钥.首先对Byun2007的C2C-PAKE协议进行了描述,并针对其安全性进行了分析,发现该协议易遭受口令泄露伪造攻击的安全漏洞,提出了一种高效的改进的跨域口令认证密钥交换协议.该协议引入公钥密码体制能够有效抵抗口令泄露伪造攻击和不可检测在线字典攻击,且只需要6步通信.安全性分析表明该协议是安全有效的.     

基于双线性对的无证书两方认证密钥协商协议

无证书公钥密码体制具有很好的特性,它不需要使用证书,也不存在用户私钥托管问题。该文提出一个基于双线性对的无证书两方认证密钥协商协议,使用数字签名方案实现协议中的身份认证;对数字签名方案的安全性进行了证明,表明该签名方案能够抵抗适应性选择消息攻击下的存在性伪造;对密钥协商协议的安全性进行了分析,结果表明协议具备已知密钥安全、抗未知密钥共享攻击、完美前向安全、密钥俘获伪装攻击和抗临时私钥泄露攻击等安全属性。与其他具备相同安全属性的协议相比,该协议使用的双线性对运算的个数少得多,并且不使用模幂运算,因此计算量要小得多。     

一种安全高效的认证密钥协商协议

SAKA协议不具有密钥泄露安全性。为此,按照L．Law所定义的认证密钥协商协议的安全特性,提出一种基于椭圆曲线密码体制的安全高效认证密钥协商协议——SEAK协议。对本协议的安全性进行分析,证明了它在ECDH难解的前提下是安全的协议;因为SEAK协议平均只需2个整乘和2次信息交换次数,所以它是一个高效率的协议。     

无线传感器网络可认证密钥协商协议

从增强网络安全性和降低节点能耗出发,论述无线传感器网络采用椭圆曲线密码体制进行密钥管理的必要性和可行性.基于椭圆曲线密码理论研究设计了一种适用于无线电传感器网络的可认证的新密钥协商协议,并对该协议进行验证分析,证明该协议能有效抵制节点被俘、消息重放和身份假冒等攻击,安全性高,消耗资源小,可扩展性强.     

Efficient Authenticated Key Agreement Protocol Using Self-Certified Public Keys from Pairings

An efficient authenticated key agreement protocol is proposed, which makes use of bilinear pairings and selfcertified public keys. Its security is based on the security assumptions of the bilinear Diffie-Hellman problem and the computational Diffic-Hellman problem. Users can choose their private keys independently. The public keys and identities of users can bc verified implicitly when the session key being generating in a logically single step. A trusted Key Generation Center is no longer required as in the ID-based authenticated key agreement protocols. Compared with existing authenticated key agreement protocols from pairings, the new proposed protocol is more efficient and secure.     

Escrow-Free Certificate-Based Authenticated Key Agreement Protocol from Pairings

Key agreement protocols are essential for secure communications. In this paper, to solve the inherent key escrow problem of identity-based cryptography, an escrow-free certificate-based authenticated key agreement （CB-AK） protocol with perfect forward secrecy is proposed. Our protocol makes use of pairings on elliptic curves. The protocol is described and its properties are discussed though comparison with Smart＇s protocol.     

A deniable authenticated key agreement protocol

This paper presents a deniable authenticated key agreement protocol. This protocol can provide an authenticated session key while the sender and the receiver can deny their involvement in such a protocol if the protocol is executed successfully. Then both can deny their transmitted messages protected by the authenticated session key. If this protocol fails, no authenticated session key can be established and no protected messages can be transmitted. The protocol can be proved secure against key compromise impersonation attack. The protocol employs a new method to isolate a session key from confirmation keys.     

Efficient Certificateless Authenticated Key Agreement Protocol from Pairings

0 IntroductionKey agreement protocol is vital to Web security,whichallows two communication parties (i .e.the Web cli-ent and Web server) to establish a secret session key overan open network. The session key,generated with contri-butions fromall the communicating parties ,is usually sub-sequently be used to achieve some cryptographic goal be-tweenthe Web clients and servers ,such as confidentialityor dataintegrity. The first two-party key agreement proto-col was first proposed by Diffie and…     

Authenticated group key agreement protocol based on twist conjugacy problem in near-rings

Nowadays some promising authenticated group key agreement protocols are constructed on braid groups, dynamic groups, pairings and bilinear pairings. Hence the non-abelian structure has attracted cryptographers to construct public-key cryptographic protocols. In this article, we propose a new authenticated group key agreement protocol which works in non-abelian near-rings. We have proved that our protocol meets the security attributes under the assumption that the twist conjugacy search problem (TCSP) is hard in near-ring.     

Authenticated Diffie-Hellman key agreement protocol with forward secrecy

Forward secrecy is an important security property in key agreement protocol. Based on Ham＇s protocol, in this paper a new authenticated Diffie-Hellman key agreement protocol with half forward secrecy is proposed. This protocol is also based on a single cryptographic assumption, and is user authentication and shared key authentication. More importantly, our protocol provides forward secrecy with respect to one of the parties. For this reason, besides the advantages of Ham＇s protocol, in practice, our protocol can reduce the damages resulted from the disclosure of the user＇s secret key and it is very beneficial to today＇s communication with portable devices.     

多PKG环境下无双线性对的基于身份AKA协议

提出一种多PKG环境下无双线性对的基于身份AKA协议, 且在随机预言模型下, 将协议的安全性证明规约到标准的计算性CDH假设。提出了相应的基于身份XCR与DCR签名体制, 通过对两处体制进行安全性证明, 实现对新协议的安全性证明。通过与已有协议的相关性能比较体现了新协议的优点。     

Identity Based Group Key Agreement in Multiple PKG Environment

Secure and reliable group communication is an increasingly active research area by growing popularity in group-oriented and collaborative applications. In this paper, we propose the first identity-based authenticated group key agreement in multiple private key generators （PKG） environment. It is inspired on a new two-party identity-based key agreement protocol first proposed by Hoonjung Lee et al. In our scheme, although each member comes from different domain and belongs to different PKGs which do not share the common system parameters, they can agree on a shared secret group key. We show that our scheme satisfies every security requirements of the group key agreement protocols.