In the area of secure Web information system, mutual authentication and key agreement are essential between Web clients and servers. An efficient certificateless authenticated key agreement protocol for Web client/ser...In the area of secure Web information system, mutual authentication and key agreement are essential between Web clients and servers. An efficient certificateless authenticated key agreement protocol for Web client/server setting is proposed, which uses pairings on certain elliptic curves. We show that the newly proposed key agreement protocol is practical and of great efficiency, meanwhile, it satisfies every desired security require ments for key agreement protocols.展开更多
通过对Liu-Au-Susilo(2007)、Goranlta-Saxena(2005)、Cao-Paterson-Kou(2006)、Yap-Heng-Goi(2006)和Je Hong Park(2006)提出的无证书数字签名方案进行分析,指出了这几个方案中所存在的公钥替换攻击,并给出了攻击方法。列举出这些方案...通过对Liu-Au-Susilo(2007)、Goranlta-Saxena(2005)、Cao-Paterson-Kou(2006)、Yap-Heng-Goi(2006)和Je Hong Park(2006)提出的无证书数字签名方案进行分析,指出了这几个方案中所存在的公钥替换攻击,并给出了攻击方法。列举出这些方案安全性分析中所存在的缺陷,为避免这些缺陷,利用了Castro-Dahab(2007)的无证书数字签名方案的一般模式和分叉引理对原方案进行改进,改进后的方案是可证安全的。展开更多
As an improtant cryptographic scheme, signcryption scheme has been widely used in applications since it could provide both of signature and encryption. With the development of the certificateless public key cryptograp...As an improtant cryptographic scheme, signcryption scheme has been widely used in applications since it could provide both of signature and encryption. With the development of the certificateless public key cryptography （CLPKC）, many certificatelss signcryption （CLSC） schemes using bilinear pairing hve been proposed. Comparated other operations, the bilinear pairing operaion is much more compulicated. Therefore, CLSC scheme without bilinear pairing is more suitable for applications. Recently, Jing et al. proposed a CLSC scheme without bilinear pairing and claimed their scheme is secure against two types of adversaries. In this paper, we will show their scheme provide neither unforgeability property nor confidentiality property. To improve security, we also propose a new CLSC scheme without pairing and demonstrate it is provably secure in the random oracle model.展开更多
基金Supported bythe National Natural Science Foundationof China (60225007 ,60572155) the Science and Technology ResearchProject of Shanghai (04DZ07067)
文摘In the area of secure Web information system, mutual authentication and key agreement are essential between Web clients and servers. An efficient certificateless authenticated key agreement protocol for Web client/server setting is proposed, which uses pairings on certain elliptic curves. We show that the newly proposed key agreement protocol is practical and of great efficiency, meanwhile, it satisfies every desired security require ments for key agreement protocols.
文摘通过对Liu-Au-Susilo(2007)、Goranlta-Saxena(2005)、Cao-Paterson-Kou(2006)、Yap-Heng-Goi(2006)和Je Hong Park(2006)提出的无证书数字签名方案进行分析,指出了这几个方案中所存在的公钥替换攻击,并给出了攻击方法。列举出这些方案安全性分析中所存在的缺陷,为避免这些缺陷,利用了Castro-Dahab(2007)的无证书数字签名方案的一般模式和分叉引理对原方案进行改进,改进后的方案是可证安全的。
基金This research was supported by the National Natural Science Foundation of China （Grant No. 61202447）, Natural Science Foundation of Hebei Province of China （F2013501066）, Northeastern University at Qinhuangdao Science and Technology Support Program （xnk201307）.
文摘As an improtant cryptographic scheme, signcryption scheme has been widely used in applications since it could provide both of signature and encryption. With the development of the certificateless public key cryptography （CLPKC）, many certificatelss signcryption （CLSC） schemes using bilinear pairing hve been proposed. Comparated other operations, the bilinear pairing operaion is much more compulicated. Therefore, CLSC scheme without bilinear pairing is more suitable for applications. Recently, Jing et al. proposed a CLSC scheme without bilinear pairing and claimed their scheme is secure against two types of adversaries. In this paper, we will show their scheme provide neither unforgeability property nor confidentiality property. To improve security, we also propose a new CLSC scheme without pairing and demonstrate it is provably secure in the random oracle model.
