共查询到19条相似文献,搜索用时 281 毫秒
1.
2.
在数字签名中使用Hash函数,若Hash函数不安全会使签名遭受相关攻击。降低签名的安全性。提出了一种新的基于椭圆曲线密码体制的代理盲签名方案。该方案不舍Hash函数,避免了使用Hash函数可能面临的不安全性问题:该方案具有不可伪造性,不可抵赖性,且不舍求逆运算从而降低了运算复杂度。 相似文献
3.
一种基于ElGamal签名体制的代理盲签名 总被引:2,自引:0,他引:2
在密码学中,使用Hash函数必然使签名方案因Hash函数的不安全性而遭受相关攻击,从而导致签名方案的安全性降低.提出一种新的基于ElGamal签名体制的代理盲签名方案.该方案不需要使用Hash函数,避免了使用Hash函数带来的威胁;而且新方案实现了电子交易中的不可伪造性和不可链接性,有效地防止了双方事后抵赖,且计算量较低. 相似文献
4.
在随机预言模型下,Hash函数被视为一个完全随机的理想模型,实际应用中却无法构造。利用椭圆曲线上的双线性对性质及门限秘密共享的思想,以Waters的签名方案为基础,设计了一种无随机预言模型的模糊身份签名方案。与已有的模糊签名方案相比,该方案的构造没有采用Hash函数,避免了Hash函数返回值无随机性的缺点;且系统公开参数少,安全性可规约到计算Diffie-Hellman(CDH)困难假定,从而能更好地满足实际应用需求。 相似文献
5.
现有的基于身份的代理环签名方案的安全性大都是在随机预言模型下证明的,随机预言机模型将Hash函数理想化为一个完全随机模型,在实际应用中不一定安全.鉴于此,提出一个新的基于身份的代理环签名方案.在标准模型下证明了该方案能够抵抗存在性伪造攻击,且签名者具有无条件匿名性,因此具有更好的安全可靠性. 相似文献
6.
7.
基于身份的密码学一直是密码界的热点研究方向,因为它节约了证书管理的庞大开销.目前,基于身份的密码方案大量涌现,但是其中绝大部分方案都是基于双线性配对实现的,其安全性依赖于配对困难问题.无需配对的基于身份的密码方案仍然是密码学中值得关注的一个课题.目前,有少量无需配对的身份签名方案被提出,但是其中一些方案未给出安全性证明,另一些则是随机预言模型下的可证安全方案,还没有在标准模型下可证安全的非配对的身份签名方案被提出.基于Hohenberger和Waters 签名提出了一个身份签名方案,该方案在标准模型下被证明是弱安全的,并且其安全性可以归约到强RSA问题.同时,在引入卡梅隆Hash函数后,该方案可被转换成标准安全的身份签名方案. 相似文献
8.
标准模型下可证安全的基于身份的高效签名方案 总被引:13,自引:0,他引:13
基于身份的公钥密码体制克服了传统公钥密码体制所带来的公钥证书存储和管理开销问题;目前大多数基于身份的数字签名方案的安全性足基于随机预言模型进行证明,但随机预言机的实现方式可能会导致方案的不安全,如Hash函数,往往返回的结果并小是随机的.文中提出一种安全、高效的基于身份的签名方案,并且在标准模型下证明该方案对自适应选择消息攻击是存在不可伪造的,方案的安全性可规约为CDH困难假定.与现有的标准模型下安全的基于身份的签名方案相比,方案的通信代价更小,执行效率更高. 相似文献
9.
一种基于身份的不可传递性环签名 总被引:1,自引:0,他引:1
网络环境中的某些应用(如匿名电子举报)要求数字签名同时具备签名者身份模糊性和签名不可传递性,而现存的签名方案都不能完全满足此类需求.为此,提出了一种新的签名方案即基于身份的不可传递性环签名方案,设计了一个基于双线性对的特殊哈希函数,并将该哈希函数引入到环签名中,使方案很好地满足了上述需求.形式化分析表明,方案生成的签名在随机预言模型(Random Oracle Model,ROM)下具有不可伪造性. 相似文献
10.
基于Chameleon签名理论,提出具有时效的Chameleon签名方案,为需要指定签名接收者,且对签名时效有一定要求的签名问题提供了解决途径。该方案保证在时效期限内,只有指定的接收者能够验证签名的有效性;超过时效期限后,签名转换为普通签名,并且签名转换的决定权不再限于签名者,任何人都可以核实监督甚至强制要求签名者按时转换签名。该方案设计简单、易于实现,而且在签名效率与安全性等方面都优于现有的可转换Chameleon签名方案。 相似文献
11.
12.
Xiaofeng Chen Fangguo Zhang Haibo Tian Baodian Wei Willy Susilo Yi Mu Hyunrok Lee Kwangjo Kim 《Information Sciences》2008,178(21):4192-4203
The “hash–sign–switch” paradigm was firstly proposed by Shamir and Tauman with the aim to design an efficient on-line/off-line signature scheme. Nonetheless, all existing on-line/off-line signature schemes based on this paradigm suffer from the key exposure problem of chameleon hashing. To avoid this problem, the signer should pre-compute and store a plenty of different chameleon hash values and the corresponding signatures on the hash values in the off-line phase, and send the collision and the signature for a certain hash value in the on-line phase. Hence, the computation and storage cost for the off-line phase and the communication cost for the on-line phase in Shamir–Tauman’s signature scheme are still a little more overload. In this paper, we first introduce a special double-trapdoor hash family based on the discrete logarithm assumption and then incorporate it to construct a more efficient generic on-line/off-line signature scheme without key exposure. Furthermore, we also present the first key-exposure-free generic on-line/off-line threshold signature scheme without a trusted dealer. Additionally, we prove that the proposed schemes have achieved the desired security requirements. 相似文献
13.
Xiaofeng Chen Fangguo Zhang Haibo Tian Baodian Wei Kwangjo KimAuthor vitae 《Computers & Electrical Engineering》2011,37(4):614-623
Chameleon signatures simultaneously provide the properties of non-repudiation and non-transferability for the signed message. However, the initial constructions of chameleon signatures suffer from the key exposure problem of chameleon hashing. This creates a strong disincentive for the recipient to compute hash collisions, partially undermining the concept of non-transferability. Recently, some constructions of discrete logarithm based chameleon hashing and signatures without key exposure are presented, while in the setting of gap Diffie–Hellman groups with pairings.In this paper, we propose the first key-exposure free chameleon hash and signature scheme based on discrete logarithm systems, without using the gap Diffie–Hellman groups. This provides more flexible constructions of efficient key-exposure free chameleon hash and signature schemes. Moreover, one distinguishing advantage of the resulting chameleon signature scheme is that the property of “message hiding” or “message recovery” can be achieved freely by the signer, i.e., the signer can efficiently prove which message was the original one if he desires. 相似文献
14.
目前基于身份、门限代理签名和盲签名有机结合的研究不多,基于此,利用椭圆曲线上的双线性映射理论和秘密共享门限签名技术,提出一种基于身份的门限代理盲签名方案。该方案解决了代理签名权力过于集中的问题,同时通过盲签名实现了签名的匿名性。理论分析表明,该方案易于实现且安全性高,适合在实际中应用。 相似文献
15.
基于格的变色龙签名方案 总被引:1,自引:1,他引:0
与普通数字签名相比,变色龙签名不仅满足不可否认性,而且具有非交互式、不可传递的特点。然而,基于传统数学难题构造的变色龙签名方案不能抵杭量子计算机的攻击。为了设计在量子计算机环境下依然安全的变色龙签名,利用格上小整数解问题SIS(Small Integer Solution)和非齐次小整数解问题ISIS(Inhomogeneous Small Integer Solution)的困难性假设,构造了基于格的变色龙签名方案。在随机预言模型下,证明了该方案在适应性选择消息攻击下
是安全的。 相似文献
16.
提出了一个新的基于双线性对的基于身份的强代理盲签名方案,并构造了一个基于身份的多级强代理盲签名方案,实现了签名权利在许可范围内逐级向下代理的要求,并对方案的安全性和执行效率进行了分析。同时,方案也满足强代理签名以及强盲签名方案的各种性质,有效地防止了签名权利的滥用,因此,新方案具有实现简单而且安全性高的特点。 相似文献
17.
Emmanuel Bresson Dario Catalano Mario Di Raimondo Dario Fiore Rosario Gennaro 《International Journal of Information Security》2013,12(6):439-465
The notion of off-line/on-line digital signature scheme was introduced by Even, Goldreich and Micali. Informally such signatures schemes are used to reduce the time required to compute a signature using some kind of preprocessing. Even, Goldreich and Micali show how to realize off-line/on-line digital signature schemes by combining regular digital signatures with efficient one-time signatures. Later, Shamir and Tauman presented an alternative construction (which produces shorter signatures) obtained by combining regular signatures with chameleon hash functions. In this paper, we study off-line/on-line digital signature schemes both from a theoretic and a practical perspective. More precisely, our contribution is threefold. First, we unify the Shamir–Tauman and Even et al. approaches by showing that they can be seen as different instantiations of the same paradigm. We do this by showing that the one-time signatures needed in the Even et al. approach only need to satisfy a weak notion of security. We then show that chameleon hashing is basically a one-time signature which satisfies such a weaker security notion. As a by-product of this result, we study the relationship between one-time signatures and chameleon hashing, and we prove that a special type of chameleon hashing (which we call double-trapdoor) is actually a fully secure one-time signature. Next, we consider the task of building, in a generic fashion, threshold variants of known schemes: Crutchfield et al. proposed a generic way to construct a threshold off-line/on-line signature scheme given a threshold regular one. They applied known threshold techniques to the Shamir–Tauman construction using a specific chameleon hash function. Their solution introduces additional computational assumptions which turn out to be implied by the so-called one-more discrete logarithm assumption. Here, we propose two generic constructions that can be based on any threshold signature scheme, combined with a specific (double-trapdoor) chameleon hash function. Our constructions are efficient and can be proven secure in the standard model using only the traditional discrete logarithm assumption. Finally, we ran experimental tests to measure the difference between the real efficiency of the two known constructions for non-threshold off-line/on-line signatures. Interestingly, we show that, using some optimizations, the two approaches are comparable in efficiency and signature length. 相似文献
18.