共查询到18条相似文献,搜索用时 156 毫秒
1.
一个安全有效的RSA门限签名体制 总被引:2,自引:2,他引:0
提出一种新的RSA门限签名体制,具有如下性质:(1)利用知识证明构造子签名方案,从而子签名是安全的;(2)组签名的安全性是基于RSA问题及离散对数问题;(3)可以对签名者的身份进行追踪。 相似文献
2.
3.
4.
文中给出基于背包和有限域上圆锥曲线相结合的代理签名方案,并具体分析了该代理签名方案的安全性是基于求解有限域上圆锥曲线的离散对数问题和求解变形的背包问题,只有这两个问题都被攻破了,才能破解该代理签名方案,所以该代理签名方案具有很强的安全性。 相似文献
5.
6.
一种基于ElGamal体制的前向安全强盲签名方案 总被引:1,自引:0,他引:1
将前向安全特性和盲签名基本思想融为一体,设计了一种基于ElGamal体制的前向安全强盲签名方案,方案的安全性基于有限域上离散对数难解性假设。通过详细的安全性分析表明,新方案具有前向安全性、强盲性、抗伪造性等性质,有一定的理论和实用价值。 相似文献
7.
8.
具有强安全性的不含双线性对的无证书签名方案 总被引:6,自引:0,他引:6
该文提出了一种满足强安全性的不需双线性对运算的无证书签名方案,能抵抗适应性选择消息和适应性选择身份的存在性伪造攻击,并且在随机预言模型下基于离散对数难题给出了完整的安全性证明。与现有的绝大多数无证书签名方案都是基于双线性对的不同,该文提出的新方案没有复杂的双线性对运算,具有明显的效率优势。另外,通过对王会歌等人的无证书签名方案进行分析,指出此方案是不安全的,并给出了具体的攻击方法。 相似文献
9.
10.
C-Y Yang等人提出了一个安全性基于求解离散对数困难性的门限代理签名方案,该方案具有较少的通信量及较高的计算效率。基于数论知识分析该方案存在缺陷:不满足不可伪造性和不可否认性,提出了改进方案将代理密钥以门限的方式在成员间共享,使得每个成员的子代理密钥都包含个体随机数,其他成员无法获知某成员的子代理密钥。改进方案的安全性基于求解离散对数的困难性,能抵御密钥替换攻击,具备不可伪造性和不可否认性。 相似文献
11.
12.
13.
The author proposes digital signature schemes without using a one-way function to sign Diffie-Hellman public keys. The advantage of this approach is, instead of relying overall security on either the security of the signature scheme or the security of the one-way function, the security of this proposed scheme is based on the discrete logarithm problem 相似文献
14.
15.
Proxy signature is an active research area in cryptography. A proxy signature scheme allows an entity to delegate his or her signing capability to another entity in such a way that the latter can sign messages on behalf of the former. Many proxy signature schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is more than 10 times of the scalar multiplication over elliptic curve group. In order to save the running time and the size of the signature, we propose a proxy signature scheme without bilinear pairings and prove its security against adaptive chosen‐message attack in random oracle model. The security of our scheme is based on the hardness of the elliptic curve discrete logarithm problem. With the running time being saved greatly, our scheme is more practical than the previous related scheme for practical applications. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
16.
17.
We propose and analyze two efficient signature schemes whose security is tightly related to the Diffie-Hellman problems in
the random oracle model. The security of our first scheme relies on the hardness of the computational Diffie-Hellman problem;
the security of our second scheme - which is more efficient than the first-is based on the hardness of the decisional Diffie-Hellman
problem, a stronger assumption. Given the current state of the art, it is as difficult to solve the Diffie-Hellman problems
as it is to solve the discrete logarithm problem in many groups of cryptographic interest. Thus, the signature schemes shown
here can currently offer substantially better efficiency (for a given level of provable security) than existing schemes based
on the discrete logarithm assumption. The techniques we introduce can also be applied in a wide variety of settings to yield
more efficient cryptographic schemes (based on various number-theoretic assumptions) with tight security reductions. 相似文献
18.
Yuh-Min Tseng Jinn-Ke Jan 《Electronics letters》1999,35(1):37-38
In 1998, an efficient group signature scheme (the Lee-Chang scheme) was proposed based on the discrete logarithm problem. In this scheme, different group signatures of a signer for different messages contain some identical information. Once one group signature is identified, all previous group signatures are also identified at the same time. This is impractical for applications of group signatures. The authors propose an improvement on the Lee-Chang scheme to solve the above problem. The improved group signature scheme preserves the main merits inherent in most of the Lee-Chang scheme. The security of the improved scheme is also based on the discrete logarithm problem 相似文献