对两个自认证公钥签名方案的安全性分析

通过对新近Lin等人提出的自认证公钥签名方案和王等人提出的自认证公钥签密方案进行了安全性分析,指出这两个方案都是不安全的.原因是这两个方案都能够受到替换公钥攻击,使得攻击者能够对任意选择的消息成功伪造签名.然而,在当前的自认证公钥签名方案的安全性证明中都没有考虑到替换公钥攻击,从而得到一个启示:由于自认证公钥签名自身的特点,那么在自认证公钥签名的安全性模型中必须进一步考虑是否能抵抗替换公钥攻击,从而确保方案的真正安全性.     

一个基于自证明公钥的数字签名方案

介绍了Shao的基于自证明公钥密码体制的数字签名方案,指出了一些不足;并提出了一个新的基于自证明公钥密码体制的数字签名方案,它达到了信任标准3。     

Chebyshev多项式的公钥加密和身份认证方案的研究

构成一种公钥加密方案的关键是找到一个带陷门的单向函数.Kocarev利用Chebyshev映射的半群特性,提出了一种基于Chebyshev映射的混沌公钥加密方案,但是经分析发现其是不安全的,由于三角函数的固有周期性,使得攻击者很容易破解,攻击者在已知密文的条件下很容易解出明文.基于此本文作者提出了一种改进方案,该方案将Chebyshev多项式的状态空间扩展到实数域,既利用了Chebyshev多项式的半群特性构成具有单向带陷门的公钥加密算法,又可以避免上述已知密文的攻击,经过对其性能的研究发现,新的改进方案是安全有效的;同时提出了基于这种扩展的Chebyshev多项式的半群特性的网络身份认证方案.     

可撤销的公钥加密方案的形式化分析

通常的密码系统,IBE或者PKI都必须提供从系统中撤销用户私钥的途径,同样PEKS也应该提供撤销陷门的方式.本文研究了可高效撤销的无需安全信道的带关键字搜索公钥加密方案的形式化定义及安全模型.基于BDH问题,可证明方案的安全性.     

基于双线性对和智能卡的远程用户认证方案

文章提出了一种使用双线性对和智能卡的远程用户认证方案.在方案中,如果登录请求为有效时,则远程系统接受请求,并允许用户登入系统.该方案利用了椭圆曲线上离散对数的困难性,使得计算成本更低,安全性更高.另外,该方案主要在注册阶段和登录阶段加强了安全性,能够抵御重放攻击、内部攻击、假冒服务器攻击,同时提供了灵活的密码修改方式,并实现了双向认证.     

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

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

一种基于认证加密的群签名方案

群签名是数字签名的一种新类型,在群签名中任何一个群组成员可以代表整个群实施签名.提出了一种基于认证加密的群签名方案,融合了群签名和加密双重功能,具有通信成本低,传输效率高等特性,可应用于电子商务、电子拍卖中.     

基于双线性对的盲签名方案

双线性对是构建密码体制的重要工具,但双线性对运算是最耗时的运算,直接影响着方案的执行效率.利用双线性对提出的盲签名方案与已有方案的双线性对运算相比,具有运算量少,计算效率高的特点.同时,方案具有盲性、不可伪造性等安全特性.     

基于自认证的多接收者签密方案

基于多接收者签密和自认证密码系统理论,使用双线性对提出了一个基于自认证的多接收者签密方案,并在ECDL问题和BDH问题的难解性下证明了其安全性.所提方案在验证公钥真实性时,不需要额外的证书;可信机构不知道用户的私钥.与已有方案相比,该方案具有计算效率高、通信成本低等优点,更适合于在实际中应用.     

一个双线性对下高效的基于证书签名方案

为了提高基于证书签名方案的效率和保证其不可伪造性,利用k双线Diffie-Hellman求逆问题的困难性和计算Diffie-Hellman问题的困难性构造了一个新的高效基于证书签名方案,并且在随机预言机模型下,形式化证明了其安全性.方案中,利用k双线Diffie-Hellman求逆问题的困难性来设计用户公钥和用户证书生成算法,保证用户公钥和用户证书的单向性质;利用k双线Diffie-Hellman求逆问题的困难性和计算Diffie-Hellman问题的困难性来设计签名算法,保证签名的单向性质和不可伪造性.所构造方案的签名生成算法不需要任何双线性对计算,签名验证算法仅需要一个双线性对计算.与已有的基于证书签名方案进行了效率比较.结果表明:所提出的基于证书签名方案具有较大的效率优势.     

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.     

A certificateless threshold public key encryption scheme

The decryption participant’s private key share for decryption is delegated by key generation center in the threshold IBE scheme.However,a key generation center which is absolutely trustworthy does not exist.So the author presents a certificateless threshold public key encryption scheme.Collaborating with an administrator,the decryption participant generates his whole private key share for decryption in the scheme.The administrator does not know the decryption participant’s private key share for decryption.Making use of q-SDH assumption,the author constructs a certificateless threshold public key encryption scheme.The security of the scheme is eventually reduced to the solving of Decisional Bilinear Diffie-Hellman problem.Moreover,the scheme is secure under the chosen ciphertext attack in the standard model.     

一种改进的基于身份和双线性对的环签名方案

Lin-Wu等人的使用双线性对构造的基于身份的环签名是不合理的,该文对Lin-Wu等人的签名方案进行修改,得到一个合理的使用双线性对构造的基于身份的环签名。     

A New Proxy Signature Scheme with Message Recovery Using Self-Certified Public Key

A proxy signature scheme with message recovery using self-certified public key is proposed, which withstands public key substitution attacks, active attacks, and forgery attacks. The proposed scheme accomplishes the tasks of public key verification, proxy signature verification, and message recovery in a logically single step. In addition, the proposed scheme satisfies all properties of strong proxy signature and does not use secure channel in the communication between the original signer and the proxy signature signer.     

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…     

A New Threshold Signature Scheme Using Self-Certified Public Keys

To prevent active attack, we propose a new threshold signature scheme using self-certified public keys, which makes use of hash function and discrete logarithm problem. The scheme has less commutnication and computation cost than previous schemes. Furthermore, the signature process of the proposed scheme is non-interactive.     

一种基于双线性对的门限签名方案

通过对现有门限签名方案的分析,发现很多门限签名方案存在安全上的缺陷,特别是在抵抗内部恶意成员的攻击方面.使用双线性映射工具,提出基于双线性对的门限签名方案.该方案通过可验证的方法来防止秘密分发者和秘密共享者的欺骗行为,利用可信中心参与和增加签名者的身份信息来阻止抵抗群体内部成员的合谋攻击,克服了门限签名方案上的弱点.同其他方法进行分析对比,结果表明,该方案还具有验证简单,个体密钥能重复使用,效率高,安全性强的特点.     

基于双线性对的域间认证与密钥协商协议

结合代理签名和签密方案的特点,以双线性对为工具,设计了一个域间电子商务的认证与密钥协商协议。该协议能够实现移动用户与服务提供商之间的双向认证和移动用户的匿名性,并且会话密钥保持了新鲜性,做到一次一密钥,保证了协议的公平性和实用性,能够克服重放攻击、拒绝服务攻击、中间人攻击和密钥泄漏假冒攻击。     

A new certificateless public key encryption scheme

Certificateless public key cryptography （CL-PKC） enjoys the advantage of identity based cryptography without suffering from its inherent key escrow problem. In this paper, a new efficient certificateless public key encryption scheme is proposed and its security can reach chosen-ciphertext （CCA2） secure in the random oracle model assuming the CDH and p-BDHI problem are difficult. A comparison shows that the efficiency of the proposed scheme is better than all known paring-based certificateless public key encryption schemes in the random oracle model.     

A New ID-Based Proxy Multi-Signature Scheme from Bilinear Pairings

ID-based public key cryptosystem can be a good alternative for certifieate-based public key setting. This paper provides an efficient ID-based proxy multi signature scheme from pairings. In the random oracle model, we prove that our new scheme is secure against existential delegation forgery with the assumption that Hess＇s scheme-1 is existential unforgeable, and that our new scheme is secure against existential proxy multi-signature forgery under the hardness assumption of the computational Diffie-Hellman problem.