排序方式: 共有111条查询结果,搜索用时 15 毫秒
1.
为了解决XUE-CAO代理盲签名方案的可伪造性问题,首先对XUE-CAO方案进行了安全性分析,在此基础上,提出一种改进的抗伪造攻击的代理盲签名方案。新方案克服了原方案中两处设计缺陷,防止了广泛伪造和原始签名者的伪造攻击,而且还保留了原方案的可验证性、强不可否认性、强可注销性和不可连接性等安全特性,从而可以用于构造安全的代理盲签名系统。 相似文献
2.
3.
现有的具有固定签名长度的无证书聚合签名(certificateless aggregate signatures, CLAS)方案要么存在安全缺陷,要么通信开销较大。提出一种改进的CLAS方案,由聚合人选择整数域上的随机参数替代状态信息,并且广播给所有签名者。在随机预言模型下,改进方案被规约为多项式时间敌手求解CDH(computational Diffie- Hellman)难题,具有可证明安全性。对比分析表明,改进CLAS方案的状态信息协商阶段仅需要1次广播通信,通信开销更低,易于实现。改进方案可用于在资源受限的网络环境下构建多对一的认证方案。 相似文献
4.
5.
6.
近些年来,盲签名的研究取得了很多的成果,但也存在着计算过程复杂、传输效率低、交互次数频繁等问题。基于Boneh等人提出的签名,首先给出一个不包含随机预言模型的盲签名方案。不包括随机预言机,盲签名就是一个可实现的安全的标准方案,而考虑到交互次数问题,该方案还可以引入公共参考串(common reference string, CRS)来完成签名方的非交互零知识证明,使得盲签名算法仅包含两次交互,实现了轮优先round optimal,在此基础上也可以实现盲签名算法的并发执行。该盲签名算法构造简单且计算复杂度较低,因此比现有的盲签名方案更加有效,节省了传输带宽,提高了传输效率。 相似文献
7.
8.
Current techniques for transforming unforgeable signature schemes (the forged message has never been signed) to strongly unforgeable ones (the forged message could have been signed) require supplementary components to be added onto the original key pairs of the schemes. In addition, some of them can only be applied to a certain type of signature schemes. In this paper, we propose a new generic transformation technique which converts any unforgeable signature scheme into a strongly unforgeable one without modifying any component in the original key pair. This makes our technique especially compatible for practical use. Our technique is based on strong one-time signature schemes. We show that they can be constructed efficiently from any one-time signature scheme that is based on one-way functions. The performance of our technique also compares favorably with that of current ones. Besides, it is shown in this paper that our transformation can further be applied to schemes satisfying only a weak variant of unforgeability without any further modification. Furthermore, our technique can also be used for constructing strongly unforgeable signature schemes in other cryptographic settings which include certificateless signature, identity-based signature, and several others. To the best of our knowledge, similar extent of versatility is not known to be supported by any of those comparable techniques. Finally and of independent interest, we show that our generic transformation technique can be modified to an on-line/off-line signature scheme, which possesses a very efficient signing process. 相似文献
9.
10.