Intrusion-resilient identity-based signature: Security definition and construction

Traditional identity-based signatures depend on the assumption that secret keys are absolutely secure. Once a secret key is exposed, all signatures associated with this secret key have to be reissued. Therefore, limiting the impact of key exposure in identity-based signature is an important task. In this paper, we propose to integrate the intrusion-resilient security into identity-based signatures to deal with their key exposure problem. Compared with forward-secure identity-based signatures and key-insulated identity-based signatures, our proposal can achieve higher security. The proposed scheme satisfies that signatures in any other time periods are secure even after arbitrarily many compromises of base and signer, as long as the compromises do not happen simultaneously. Furthermore, the intruder cannot generate signatures pertaining to previous time periods, even if she compromises base and signer simultaneously to get all their secret information. The scheme enjoys nice average performance. There are no cost parameters including key setup time, key extract time, base (signer) key update time, base (signer) key refresh time, signing time, verifying time, and signature size, public parameter size, base (signer) storage size having complexity more than O(log T) in terms of the total number of time periods T in this scheme. We also give the security definition of intrusion-resilient identity-based signature scheme and prove that our scheme is secure based on this security definition in the random oracle model assuming CDH problem is hard.     

An efficient ID-based cryptographic encryption based on discrete logarithm problem and integer factorization problem

ID-based encryption (identity-based) is a very useful tool in cryptography. It has many potential applications. The security of traditional ID-based encryption scheme wholly depends on the security of secret keys. Exposure of secret keys requires reissuing all previously assigned encryptions. This limitation becomes more obvious today as key exposure is more common with increasing use of mobile and unprotected devices. Under this background, mitigating the damage of key exposure in ID-based encryption is an important problem. To deal with this problem, we propose to integrate forward security into ID-based encryption. In this paper, we propose a new construction of ID-based encryption scheme based on integer factorization problem and discrete logarithm problem is semantically secure against chosen plaintext attack (CPA) in random oracle model. We demonstrate that our scheme outperforms the other existing schemes in terms of security, computational cost and the length of public key.     

Efficient forward secure identity-based shorter signature from lattice

All regular cryptographic schemes rely on the security of the secret key. However, with the explosive use of some relatively insecure mobile devices, the key exposure problem has become more aggravated. In this paper, we propose an efficient forward secure identity-based signature (FSIBS) scheme from lattice assumption, with its security based on the small integer solution problem (SIS) in the random oracle model. Our scheme can guarantee the unforgeability of the past signatures even if the current signing secret key is revealed. Moreover, the signature size and the secret key size of our scheme are unchanged and much shorter. To the best of our knowledge, our construction is the first FSIBS scheme based on lattice which can resist quantum attack. Furthermore, we extend our FSIBS scheme to a forward secure identity-based signature scheme in the standard model.     

基于身份和Weil对的聚合签名方案

提出了一种基于身份和Weil对的聚合签名方案。方案中密钥生成中心负责系统公、私钥的生成,消息的分配和签名者公、私钥的生成。签名者是具有某种特殊身份的个体,并且这种身份是唯一的,这一身份是签名者从密钥生成中心获得签名私钥的唯一凭证。每个签名者只负责对某一段消息的签名,总的签名由签名聚合者结合每位签名者的单个签名生成。这样就避免了暴露整个消息给所有的签名者,这一特性在某些对消息保密要求性较高的场合得以广泛应用。该方案在签名时用到了双线性映射,从而减少了验证时的对运算。     

无证书的环签名方案

在传统数字签名机制中,用户的公钥需要由经过可信第三方(TTP)签名的证书来保证其可靠性,而Shamir的基于身份的签名机制尽管不再需要证书,但用户的私钥将无法避免地被TTP所托管。在2003年Asiacrypt上无证书签名的概念被提出,采用这种签名机制不仅无需证书,而且也解决了密钥托管的问题。文章在此基础上,首次提出了无证书环签名的概念,并且给出了一种构造无证书环签名方案的一般性方法.安全性分析表明用该方法构造的方案是安全的.作为例子,文章中还给出了一个具体的无证书环签名方案的实例。     

高效的基于身份签名方案的安全性分析

基于身份的签名方案是许多密码协议的基础。通过对谷科等(谷科,贾维嘉,姜春林.高效安全的基于身份的签名方案.软件学报,2011,22(6):1350-1360)提出的基于身份的高效签名方案进行分析,提出了两种等价的签名生成算法,指出该方案不满足基于身份签名方案的基本安全性质。分析表明,任何攻击者都可以利用所提出的等价的私钥和签名生成算法来伪造任意用户的私钥以及任何用户对任意消息的有效签名。同时也分析了原方案不安全的原因,并指出设计比经典方案更加高效的基于身份签名方案是几乎不可能的。     

一个基于双线性映射的前向安全门限签名方案的标注

前向安全门限签名是一种重要的分布式签名,它继承了前向安全签名和门限签名的优点,通过每个成员持有的份额周期性地更新密钥,而公钥在整个时间周期中保持不变.这种签名技术可以使得敌手更难危及签名的安全性:如果敌手不能在一个时间段中攻击法定数量的成员就不能伪造任何签名,即使能够在某个时间段内攻击法定数量的成员得到他们的密钥份额,也不能伪造以前时间段的签名.2007年,彭华熹等人提出了一个基于双向性映射的前向安全门限签名方案.对此方案的安全性进行了分析,给出了几种安全性攻击的方法,指出了该方案是不安全的,同时也给出了一些改进的方法.     

紧致安全的基于身份的签名方案

本文提出了第一个紧致安全的基于身份的签名(IBS)方案.我们的构造基于Bellare等人提出的基于证书思想的通用转化方法,包括两个组件,即选择消息攻击下不可伪造安全(EUF-CMA安全)的签名方案S,和多用户场景中选择消息攻击&动态密钥窃取攻击下不可伪造安全(MU-EUF-CMAcorr安全)的签名方案S.组件S的公私钥用作IBS的主公钥和主私钥,用户id的签名私钥包含了组件S所产生的一对公私钥,以及主私钥对id和S的公钥的签名证书.用户对消息的签名包含了组件S的公钥和证书,以及S的私钥对此消息的签名.IBS的安全性可以紧致归约到组件S的EUF-CMA安全性和组件S的MU-EUF-CMAcorr安全性.最后,我们给出了组件S和S的实例化,并分别在随机预言机模型和标准模型下得到了紧致(与几乎紧致)EUF-CMA&CIA安全的IBS方案.     

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

目前双线性映射作为一种构建密码体制的新工具,在密码学领域中引起了普遍的关注,并在数字签名中得到应用。而环签名因没有群管理员、没有加入和撤出群体过程,签名者只要随机选择若干签名人,利用自己私钥和其他人的公钥进行签名,环签名方案在保护签名人身份不泄露情况下非常有用。利用双线性映射的特性介绍了一个数字签名方案,并在此基础上提出一个新的环签名方案,并对其安全性进行了分析。