共查询到20条相似文献,搜索用时 187 毫秒
1.
利用双线性群,在代理重签名机制和盲签名机制的基础上,提出了一个有效的无证书盲代理重签名方案。方案中解决了密钥托管问题及证书管理带来的额外开销,同时实现了代理者在签名转换中消息隐私特性。基于NGBDH问题和Many-NGBDH的困难性,证明了新方案具有能够抵抗伪造攻击的特性。该方案满足正确性和消息盲性。 相似文献
2.
3.
为解决食用农产品溯源中存在的身份隐私易泄露、难监管以及溯源数据共享困难等问题,该文提出一种基于新型公平盲签名和属性基加密的食用农产品溯源方案。该方案在联盟链授权访问、不可篡改特性的基础上,结合椭圆曲线和零知识证明提出一种新型公平盲签名方法,实现了食用农产品数据上传者身份条件匿名并通过双重ID机制避免了签名方陷害问题;方案同时采用Asmuth-Bloom门限改进的属性基加密结合智能合约技术实现了权限分层的食用农产品溯源数据秘密共享。各项分析及实验结果表明,该方案具备良好的安全性和功能性。 相似文献
4.
属性认证是一种特殊的身份认证方案,旨在解决各类云服务中的细粒度访问控制问题。然而,此类系统的设计必须有效解决用户隐私保护和恶意用户的追责问题。基于直接匿名证明、Boneh-Boyen签名、Waters签名等技术对Liu等人的属性签名方案进行扩展,得到新的可追踪匿名认证方案。新方案允许用户在方案的各个阶段保持匿名,并且能在身份认证阶段隐藏自己的属性值。新方案继承了底层属性签名方案的身份追踪机制,从而允许云服务提供商对恶意用户的失信行为进行问责。此外,新方案的设计引入了可信计算技术,可以在系统被攻破的情况下确保用户端的行为可信。 相似文献
5.
6.
7.
门限签名能够分散签名权力,比普通单人签名具有更高的安全性。目前大多数门限签名方案都存在密钥托管的问题。针对一种新的基于身份的门限签名方案存在的安全性问题,利用椭圆曲线上的双线性对,文中提出了一个改进的方案。新方案由私钥生成中心和签名成员合作生成密钥,由此防止了PKG伪造签名,较好地解决了密钥托管的问题。在标准模型下对该方案进行了安全性证明,表明该方案是不可伪造的和健壮的。与已有的门限签名方案相比,安全性有较大的提高,效率没有明显的降低。 相似文献
8.
传递签名是由Micali和Rivest在2002年首先提出的,主要用于对二元传递关系进行签名.已有的传递签名方案都是无向的,只适用于对等价关系签名,提出有向传递签名方案是个留待解决的公开问题.该文提出一个高效的全序有向传递签名方案,并证明该方案在选择明文攻击下是安全的.在方案中,签名的βuv部分被限定在0和q/2之间,以防止敌手由(u,v)的签名伪造(v,u)的签名,从而保证签名的有向性.将该方案与无向传递签名方案结合,提出一个可对任何有向二元传递关系进行签名的方案. 相似文献
9.
针对当前签名密钥重复使用容易被破译,以及否认签名的攻击等问题,提出了一种基于单粒子的仲裁量子签名方案(AQS).该协议结合单向哈希函数和随机数,通过引入会话密钥从而使固有密钥可以重复使用,在仲裁者验证签名的合法性之后,不再把相应的签名信息返回给接收者做进一步的验证,从而解决否认签名攻击.同时,使用单粒子可以提高传输效率.经安全性分析,此签名方案可有效抵御各种主动攻击和被动攻击. 相似文献
10.
11.
通过分析基于大整数分解、离散对数和双线性对等数学问题的特殊可传递签名方案,抽象出了可传递签名实现方法的共性。以此为基础,提出了一个基于同态加密体制的通用可传递签名方案,该方案利用同态加密体制能支持密文运算的特性实现了可传递签名及验证的一般模型,为基于同态密码体制构造安全可靠的可传递签名方案提供了一种通用框架。其次,通过适当定义安全目标和设计安全性实验,完成了该通用可传递签名方案的可证明安全性,指出若使用的同态加密方案是CPA安全而标准签名是CMA安全的,则所提出的方案就达到CMA安全。最后,给出了该通用可传递签名方案并进行了性能分析与比较。 相似文献
12.
13.
针对固定维数的格基委托算法或格上基于盆景树生成的代理签名方案中私钥和签名的长度均过大的问题,提出一种较小尺寸的代理签名方案。该方案对随机预言机进行了合并优化,并使用一个更小范数但是向量盲化的消息,从而控制代理签名私钥的维数,其安全性基于格上最短向量问题和小整数解问题的困难性,并且满足代理签名方案所有的安全性要求。与现有方案相比,该方案有效地减小了代理签名私钥和代理签名的长度,使代理私钥长度与原始签名用户私钥长度相当。 相似文献
14.
Chen-Ch Lin Chi-Sung Laih 《Communications Letters, IEEE》2000,4(7):231-232
The standard drafts, P1363 (1996) and ISO 9796-4 (1998), have adopted the discrete-logarithm based on signature equation, S3, which was originally proposed by Nyberg and Rueppel (1994). They also claimed that the signature scheme based on S3 and S5 can resist the known message attack. In this letter, we propose an extended known message attack to show that the message recovery signature scheme based on S3 and S5 has the security problem 相似文献
15.
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. 相似文献
16.
The redactable signature scheme was introduced by Johnson and others in 2002 as a mechanism to support disclosing verifiable subdocuments of a signed document. In their paper, a redactable signature based on RSA was presented. In 2009, Nojima and others presented a redactable signature scheme based on RSA. Both schemes are very efficient in terms of storage. However, the schemes need mechanisms to share random prime numbers, which causes huge time consuming computation. Moreover, the public key in the scheme of Johnson and others is designed to be used only once. In this paper, we improve the computational efficiency of these schemes by eliminating the use of a random prime sharing mechanism while sustaining the storage efficiency of them. The size of our signature scheme is the same as that of the standard RSA signature scheme plus the size of the security parameter. In our scheme, the public key can be used multiple times, and more efficient key management than the scheme of Johnson and others is possible. We also prove that the security of our scheme is reduced to the security of the full domain RSA signature scheme. 相似文献
17.
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 相似文献
18.
Secure mediated certificateless signature scheme 总被引:1,自引:0,他引:1
YANG Chen MA Wen-ping WANG Xin-mei Ministry of Education Key Laboratory of Computer Networks Information Security Xidian University Xi’an China 《中国邮电高校学报(英文版)》2007,14(2):75-78
Ju et al. proposed a certificateless signature scheme with instantaneous revocation by introducing security mediator (SEM) mechanism. This article presents a detailed cryptoanalysis of this scheme and shows that, in their proposed scheme, once a valid signature has been produced, the signer can recover his private key information and the instantaneous revocation property will be damaged. Furthermore, an improved mediated signature scheme, which can eliminate these disadvantages, is proposed, and security proof of the improved scheme under elliptic curve factorization problem (ECFP) assumption and bilinear computational diffie-hellman problem (BCDH) assumption is also proposed. 相似文献
19.
20.
一种基于ElGamal体制的前向安全强盲签名方案 总被引:1,自引:0,他引:1
将前向安全特性和盲签名基本思想融为一体,设计了一种基于ElGamal体制的前向安全强盲签名方案,方案的安全性基于有限域上离散对数难解性假设。通过详细的安全性分析表明,新方案具有前向安全性、强盲性、抗伪造性等性质,有一定的理论和实用价值。 相似文献