共查询到18条相似文献,搜索用时 125 毫秒
1.
聚合签名是一种将n个来自不同的签名者对n个不同的消息m的签名聚合成一个单一的签名的数字签名技术。分析了两种签名方案,证明了这两个基于身份聚合签名方案的不安全性。在此基础上,利用双线性技术,提出了改进的基于身份的聚合签名方案。在随机预言模型下,基于Diffie-Hellman问题的计算困难性,证明了提出方案在适应性选择消息和身份攻击下的不可伪造性。 相似文献
2.
一种基于身份的聚合签名方案 总被引:3,自引:0,他引:3
赵林森 《计算机应用与软件》2009,26(9):279-281
基于身份的聚合签名方案的提出为验证人员对多个基于身份的签名(这些签名是多个用户分别用自己的身份对多个不同的消息进行签名所得)进行一次性验证提供了方便.基于椭圆曲线中的m-挠群给出一种基于身份的聚合签名方案,并证明该方案在随机预言模型下是安全的.该方案具有两大优点:一是聚合签名减少了签名验证的工作量,提高了工作效率;二是以签名人员的身份作为验证公钥,解决了公钥管理问题. 相似文献
3.
4.
聚合签名方案允许n个用户对n个消息产生一个签名。2010年,周和杜提出了一个基于身份聚合签名方案,指出他们的方案无法抵抗伪造攻击,当攻击者得到某个成员的签名后,就可以对任意的消息产生有效的签名。提出一个改进方案弥补了安全缺陷,并在随机预言模型下证明了安全性。 相似文献
5.
聚合签名主要适用于需要将不同用户对不同消息的签名聚合成一个单一签名的场合。针对已有的基于证书聚合签名方案效率不高的问题,利用双线对构造了一个高效的基于证书聚合签名方案。在随机预言模型中证明了方案在适应性选择消息和身份攻击下是存在性不可伪造的,其安全性归约为计算Diffie-Hellman(CDH)困难问题。分析表明该方案的对运算是常量,而且只需3次双线性对运算,因此运算效率较高。 相似文献
6.
针对基于身份双向代理重签名方案需要复杂双线性对运算的问题, 利用哈希函数提出了一种无双线性对的基于身份代理重签名方案。在离散对数困难问题的假设下,证明了该方案在自适应性选择消息攻击下是不可伪造的。该方案具有双向性、多用性、透明性和密钥最优性,避免了双线性对运算。与基于身份的双向代理重签名方案--Shao方案相比,所提方案能够有效降低重签名算法的计算复杂度,提高签名验证算法的计算效率。作为该方案的一个延伸,在其基础上构造了一个聚合代理重签名方案,能将同一时间段内的重签名进行聚合,大大降低了通信带宽。 相似文献
7.
基于证书公钥密码体制是新近提出的一类新型公钥密码体制,它克服了传统公钥密码体制的证书管理问题和基于身份的密码体制固有的密钥托管问题。聚合签名是一种可将不同签名者对不同消息的签名聚合成一个单一签名的数字签名技术。利用双线性对和Computational Diffie-Hellman困难性问题提出了一个基于证书的聚合签名方案,并在随机预言机模型下证明其安全性。 相似文献
8.
9.
在门限环签名中,任意n个成员组中的t个成员可以代表整个成员组产生(t,n)门限环签名,而对实际的签名者却具有匿名性。目前,基于身份的门限环签名方案大都是在随机预言模型下对其安全性进行证明的,然而在随机预言模型下可证安全的方案却未必是安全的,因此设计标准模型下的门限环签名方案更有意义。利用双线性对技术,提出了一种安全、高效的基于身份门限环签名方案,并在标准模型下基于计算Diffie-Hellman难问题证明方案满足适应性选择消息和身份攻击下的存在不可伪造性;同时,也对方案的无条件匿名性进行了证明。 相似文献
10.
11.
At ACISP 2012, a novel deterministic identity-based (aggregate) signature scheme was proposed that does not rely on bilinear pairing. The scheme was formally proven to be existentially unforgeable under an adaptive chosen message and identity attack. The security was proven under the strong RSA assumption in the random oracle model. In this paper, unfortunately, we show that the signature scheme is universally forgeable, i.e., an adversary can recover the private key of a user and use it to generate forged signatures on any messages of its choice having on average eight genuine signatures. This means, that realizing a deterministic identity-based signature scheme in composite order groups is still an open problem. In addition, we show that a preliminary version of the authenticated key exchange protocol proposed by Okamoto in his invited talk at ASIACRYPT 2007 is vulnerable to the key-compromise impersonation attack and therefore cannot be secure in the eCK model. We also show that the two-party identity-based key agreement protocol of Hölbl et al. is vulnerable to the unknown key-share attack. 相似文献
12.
陈明 《计算机工程与应用》2015,51(19):103-109
由于现有的基于身份代理盲签名方案要么没有得到形式化的安全证明,要么仅在随机预言(Random Oracle,RO)模型下可证明安全,提出一种标准模型下的基于身份代理盲签名方案。该方案的基本签名算法采用了Paterson等人提出的基于身份签名机制。在Paterson等人提出的标准安全模型基础上,引入代理签名敌手模型,并参考盲签名的安全模型,提出基于身份代理盲签名的标准模型。在此安全模型下,该方案被证明满足不可伪造性和盲性,具有可证明安全性。 相似文献
13.
Jia YuAuthor Vitae Fanyu KongAuthor VitaeXiangguo ChengAuthor Vitae Rong HaoAuthor VitaeJianxi FanAuthor Vitae 《Journal of Systems and Software》2012,85(2):382-391
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. 相似文献
14.
在Gentry提出的基于证书加密(CBE)概念的基础上,提出了构造基于证书签名(CBS)方案的一般性方法,并在此基础上,结合代理签名与盲签名,利用间隙Diffie-Hellman(GDH)群的特点,提出了一种基于证书的代理盲签名的新方案,分析表明该方案不仅克服了基于身份的代理盲签名方案不能有效抵抗伪造攻击并缺少不可链接性等缺陷,而且签名算法的效率也有明显提高。 相似文献
15.
Baoyuan Kang Author Vitae Colin Boyd Author Vitae 《Journal of Systems and Software》2009,82(2):270-273
Unlike ordinary digital signatures, a designated verifier signature scheme makes it possible for a signer to convince a designated verifier that she has signed a message in such a way that the designated verifier cannot transfer the signature to a third party. In a strong designated verifier signature scheme, no third party can even verify the validity of a designated verifier signature, since the designated verifier’s private key is required in the verifying phase. Firstly, this paper proposes the model of identity-based strong designated verifier signature scheme based on bilinear pairings by combining identity-based cryptosystem with the designated verifier signature scheme, and then, provides one concrete strong identity-based designated verifier signature scheme, which has short size of signature, low communication and computational cost. We provide security proofs for our scheme. 相似文献
16.
车载自组网(VANET)能提高智能交通系统的安全性和道路通行效率,然而网络通信环境的开放性使其容易遭受攻击进而引发各种安全问题。针对VANET中的隐私泄露和签名验证效率较低等问题,结合基于身份的密码体制和聚合签名技术,设计一个面向VANET的消息认证方案,将多个消息的认证聚合为一个短签名,车辆只需对聚合后的签名进行验证,即可快速判断所有签名的有效性。分析结果表明,在随机预言模型下,该方案的安全性规约于计算Diffie-Hellman困难问题,且能有效缩短车辆对通信消息的认证响应时间。 相似文献
17.
A secure identity-based multi-proxy signature scheme 总被引:1,自引:0,他引:1
Feng Cao 《Computers & Electrical Engineering》2009,35(1):86-95
In a multi-proxy signature scheme, an original signer could authorize a proxy group as his proxy agent. Then only the cooperation of all the signers in the proxy group can generate the proxy signatures on behalf of the original signer. Plenty of multi-proxy signature schemes have been proposed under the certificate-based public key systems. Due to the various applications of the bilinear pairings in cryptography, many identity-based signature schemes have been proposed. In this paper, we give the first formal definition and security model of an identity-based multi-proxy signature scheme, then propose an identity-based multi-proxy signature scheme from bilinear pairings and prove its security in our security model. 相似文献
18.
Improvement of identity-based proxy multi-signature scheme 总被引:2,自引:0,他引:2
Zuhua Shao Author Vitae 《Journal of Systems and Software》2009,82(5):794-800
A proxy signature scheme allows a proxy signer to sign messages on behalf of an original signer, a company or an organization. A proxy multi-signature scheme is an extension of the basic proxy signature scheme, and permits two or more original signers to delegate their signing powers to the same proxy signer. Recently, Wang and Cao proposed an identity-based proxy multi-signature scheme. This scheme is very simple and efficient since it is an extension of the identity-based aggregate signature scheme due to Gentry and Ramzan. Though the identity-based aggregate signature scheme of Gentry and Ramzan is secure in the random oracle model, in this paper, we find that the identity-based proxy multi-signature scheme of Wang and Cao is not secure unless each proxy secret key can only be used to generate at most one proxy signature. Finally, we propose an improvement to overcome this weakness, which is more simple and efficient than the identity-based proxy multi-signature scheme of Wang and Cao. We show that the improvement is existentially unforgettable in the random oracle model under the computational Diffie-Hellman assumption. 相似文献