共查询到15条相似文献,搜索用时 46 毫秒
1.
2.
3.
量子盲签名作为量子密码的重要组成部分,近年来备受关注,半量子协议为量子盲签名走向实用化提供了可行性方法。结合半量子概念和抵抗集体噪声的逻辑粒子,提出了免疫集体噪声的半量子盲签名协议。在协议中,只有签名方Charlie具备完整的量子能力,这使得该协议对量子资源的依赖大幅降低。通过安全性分析可以证明:本协议能够抵抗内部攻击、纠缠测量攻击和截断重发攻击等,实现了部分密钥的可复用性,同时能够扩展到量子签名网络,实现跨区域的量子签名。 相似文献
4.
5.
6.
提出了一种基于秘密共享原理的量子强盲签名协议。每一组GHZ (Greenberger-Horne-Zeilinger)中的三个光子依次分发给消息拥有者Alice、签名者Trent及验证者Bob,Alice测量自己的光子将消息盲化,Trent测量自己的光子对盲消息进行签名,而Bob根据手中光子的测量结果及量子态的关联性验证签名,但其行为受到量子指纹及审计程序的约束。本协议实现了签名的盲性以及消息拥有者无法被追踪,其安全性不受攻击者所拥有的计算资源的影响。 相似文献
7.
量子多重代理签名协议利用Bell态和单量子比特逻辑门之间的逻辑关系,简单高效地实现多重代理签名操作.协议不受代理签名人数、先后顺序的限制,且操作简单,在现有技术条件下完全可以实现.协议的正确性和安全性分析表明它是一个安全的、可实现的量子多重代理签名协议. 相似文献
8.
量子盲签名作为量子密码学的重要组成部分,近年来受到了越来越多的关注.提出了一个基于两粒子和三粒子最大纠缠态的量子盲签名方案,利用量子纠缠特性实现了消息盲化,并借助量子相干性原理进行了消息恢复.所提方案利用量子逻辑门对量子态进行操作,实现了两比特经典信息的量子态表示.最后证明了该方案满足不可否认性、不可伪造性和盲性.基于... 相似文献
9.
10.
11.
12.
Electronic transaction through e-payment protocol will grow tremendous in the coming years. In this article, by conversely using blind signature, the authors propose a fair electronic payment scheme for electronic commerce, which can ensure two participants' right simultaneously in electronic transaction process. This scheme is different from other existing schemes and it does not require strong trust relation between customer and merchant. In the scheme, a semi-trusted third party (S-TTP) is involved to provide a fair commerce environment. The S-TTP takes part in the protocol on-line and no secure information about the business is leaked. Moreover, the participants do not need to register to S-TTP. This scheme does not require intervention of a third party in case of dispute, if one user cheats or simply crashes. 相似文献
13.
14.
15.
Certificateless signature and blind signature 总被引:3,自引:0,他引:3
Certificateless public key cryptography is a new paradigm introduced by Al-Riyami and Paterson. It eliminates the need of the certificates in traditional public key cryptosystems and the key escrow problem in IDentity-based Public Key Cryptography (ID-PKC). Due to the advantages of the certificateless public key cryptography, a new efficient certificateless pairing-based signature scheme is presented, which has some advantages over previous constructions in computational cost. Based on this new signature scheme, a certificateless blind signature scheme is proposed. The security of our schemes is proven based on the hardness of computational Diffie-Hellman problem. 相似文献