Improvement of Identity-Based Threshold Proxy Signature Scheme with Known Signers

0 IntroductionIdentity-based (ID-based) cryptography[1]is rapidly emer-gingin recent years .The concept of the proxy signature scheme was first in-troduced by Mamboet al[2]in 1996 .The concept of thresholdproxy signature was proposed[3 ,4]. Apractical and secure (t,n) threshold proxy signature scheme should satisfy the secre-cy,the proxy protected,the unforgeability,the non-repudia-tion,the ti me constraint ,andthe known signers[5].In 2006 , Baoet al[6]proposed an ID-based thresholdproxy si…     

Another ID-Based Proxy Signature Scheme and Its Extension

So fur, the security of many proxy signatures has seldom been considered in a formal way and most of them cannot satisfy nonepudiation. In this work, a novel ID-based （Identity-based） proxy signature scheme is proposed by combining the proxy signature with ID-based public cryptography, and they formalize the notion of security for ID-based proxy signature schemes. And show that the security of the proposed scheme is secure. Compured with other proxy signature schemes, it does not need a secure channel. Thus, it is particularly suitable for the unreliable network computation environment. Finally, they extend proposed scheme to a proxy multi-signature which has the following advantages （1） the size of proxy multi- signature is independent of the number of delegating users; （2） the computation cost of proxy multi-signature only need two Weil paring.     

A New ID-Based Proxy Multi-Signature Scheme from Bilinear Pairings

ID-based public key cryptosystem can be a good alternative for certifieate-based public key setting. This paper provides an efficient ID-based proxy multi signature scheme from pairings. In the random oracle model, we prove that our new scheme is secure against existential delegation forgery with the assumption that Hess＇s scheme-1 is existential unforgeable, and that our new scheme is secure against existential proxy multi-signature forgery under the hardness assumption of the computational Diffie-Hellman problem.     

一个限制次数的代理签名方案

为解决现有的签名方案中尚没有有效的对签名次数进行限制的问题,结合前向安全签名和一次性限制代理签名的技术,构造了一个能够限制次数的代理签名方案。方案中代理密钥是前向安全的,每一次进化对应一次签名,进化的次数在系统参数中就被限定了。如果代理人两次用同一代理密钥签名,他的私钥就会被破译。方案不需要第三方,其安全性基于解离散对数的困难性。     

无证书一次代理签名

为了解决密钥托管问题,Al-Riyami和Paterson提出了无证书签名方案.通过修改陆等人基于身份的一次代理签名方案密钥的产生算法,提出了无证书一次代理签名方案,并且正式定义了无证书一次代理签名方案的安全模型.在随机预言机模型下,证明方案的安全性依赖于CDH困难问题.     

Publicly Verifiable Distributed Proxy Blind Signature Scheme

In this present paper, we propose a new proxy blind signature scheme, which is publicly verifiable distributed. The algorithm uses the idea of secret sharing schemes to distribute original signer＇s ability and the power of the proxy signer, and ensure the property of publicly verifiable secret sharing schemes. A new concept ＂verifiable time period＂ is also introduced to reduce the time cost in the period of verifications and increases the efficiency of our scheme.     

一种匿名代理签名方案的标记

Fu-Kou-Xiao提出了一种匿名代理签名方案,其特点在于：用户的真实身份隐藏在原始签名人颁发的一个假名中;匿名性撤销时不需要可信第3方的参与.对该方案进行分析发现,原始签名人可以滥用代理授权,代理签名人也能够对自己所生成的有效代理签名进行事后否认,即不满足代理签名权力的不可滥用性和不可否认性.     

A Signature Scheme with Non-Repudiation

Based on the Schnorr signature scheme, a new signature scheme with non-repudiation is proposed. In this scheme, only the signer and the designated receiver can verify the signature signed by the signer, and if necessary, both the signer and the designated receiver can prove and show the validity of the signature signed by the signer. The proof of the validity of the signature is noninteractive and transferable. To verify and prove the validity of the signature, the signer and the nominated receiver needn＇t store extra information besides the signature. At the same time, neither the signer nor the designated receiver can deny a valid signature signed. Then, there is no repudiation in this new signature scheme. According to the security analysis of this scheme, it is found the proposed scheme is secure against existential forgery on adaptive chosen message attack.     

Verifiable （ t, n） Threshold Signature Scheme Based on Elliptic Curve

Based on the difficulty of solving the ECDLP (elliptic curve discrete logarithm problem) on the finite field, we present a (t, n) threshold signature scheme and a verifiable key agreement scheme without trusted party. Applying a modified elliptic curve signature equation, we get a more efficient signature scheme than the existing ECDSA (ellipticcurve digital signature algorithm) from the computability and security view. Our scheme has a shorter key, faster computation, and better security.     

一类增强的代理多重签名体制

在代理多重签名体制中，多个原始签名人可以分别将签名权力委托给各自的代理签名人，再由这些代理签名人联合生成一个代表所有原始签名人的数字签名．文中对现有的这种代理多重签名体制进行分析、改进，利用带委任状的部分代理机制，构造出更安全有效的方案．安全分析表明：新方案生成的代理签名包含代理签名人的真正信息，克服了抵赖问题；可以在委任状中限制代理签名人的签名能力，或在委任状中指定合法代理签名人的集合以防止代理签名人将签名能力向其他人转移，阻止了签名能力的滥用．     

几个提名代理签名方案的安全分析

在提名代理签名中,原始签名方将签名权利委托给代理签名方,这时代理签名方还充当着提名者的角色,代理签名方（提名方）代表原始签名方产生提名签名,随后将生成的提名代理签名传递给被提名方加以验证．在提名代理签名中,除了要求具有代理签名的性质,还应有提名签名的性质,即提名性：仅有被提名者可以验证一个提名代理签名有效与否,而且如果必要,仅有被提名方可以向第三方证实这个代理提名签名有效与否．文章按照提名代理签名应满足的条件分析了Zhang等的方案．指出这些方案不满足提名性．在Zhang等的方案中,提名方也可以验证一个提名代理签名有效与否,而且也可以向第三方证实其有效性．     

Server-assisted forward-secure threshold signature

Forward secure signature can protect the security of signatures previous to the key exposure. Server-assisted signature is a special digital signature in which the signer allies one server to produce the signatures. In this paper, server-assisted for-ward-secure threshold signature is proposed. The system is composed of n1 servers and n2 users. Each user and each server holds a partial secret, respectively. To produce a valid signature, users and servers need to cooperate to complete the work. The partial secrets of the users and servers are updated by a one-way function at regular intervals, while the public key is always fixed. Even if all the current partial secrets are exposed, the signatures pertaining to previous periods are still valid.     

A New （ t, n） Threshold Signature Scheme Withstanding the Conspiracy Attack

A conspiracy attack is proposed to show that Wang-Li‘s scheme is insecure, because any t or more group members can impersonate other t members to sign any message without holding the responsibility. To avoid the conspiracy attack, this paper presents a new (t, n) threshold signature scheme with traceable signers.     

一种改进的定向代理签名方案

在通常的代理签名方案中,任何人都可以验证代理签名的有效性。在定向代理签名方案中,由原始签名人指定一个人作为签名的接收者,以此来防止签名的滥用。当代理签名人产生签名后,只有指定的接收者可以对签名进行验证,进而接受签名。分析了Dai等定向代理签名方案,它不满足不可伪造性,即原始签名人可以成功伪造代理签名人的代理签名。为此,提出了改进的定向代理签名方案,该方案具有不可伪造性,从而有效地防止原始签名人对代理签名人进行恶意攻击,并将其推广到代理多签名方案中。     

Merkle Tree Digital Signature and Trusted Computing Platform

0 IntroductionDigital signatureis a key technique to provide datainteg-rity andsource authenticationcapabilities to enhance da-ta trustworthiness in trusted computing platform. Most cur-rent digital signature schemes are based on complex mathe-matical problems , such as integer factoring, discrete log-arithm,and discrete logarithm on elliptic curves . The hard-ness of these underlying mathematical problems is really un-certain at present . Merkle treeis a method used for authenti-cation and di…     

具有限制性的代理签名方案

针对现有的限制性代理方案尚不能有效地对时间和次数同时控制这个问题,基于一次性代理签名方案和前向安全技术,提出了一个新的具有次数和时间限制的代理签名方案。方案在离散对数和大数分解计算困难下是安全的,并且满足代理签名的所有性质。     

一种指定验证者的代理盲签名方案

将指定验证者的功能引进代理盲签名中,提出一种新的签名方案称为具有指定验证者的代理盲签名方案.代理签名者可以代表原始签名者对消息进行盲签名,只有消息拥有者指定的验证者验证代理签名的有效性.安全性分析表明新方案是安全的.     

一种新的基于身份的代理盲签名

结合代理签名和盲签名，利用双线性映射，构造了一种新的基于身份的代理盲签名方案．通过分析表明，该方案不仅能满足代理盲签名所要求的所有性质，而且其效率也优于已有文献。     

一种新的强代理签名方案及强代理多重签名方案

分析了一种基于G u illou-Q u isquater数字签名方案的代理签名方案存在的一些安全隐患,指出它是弱代理签名,并在此方案的基础上进行改进得到更加安全有效的强代理签名方案.     

新的基于自认证公钥的代理签名方案

代理签名在数字化信息社会中有着广泛的应用.基于自认证公钥系统,提出了一个新的基于自认证公钥的代理签名方案.该方案不仅可以实现代理签名人代表原始签名人生成代理签名的目的,而且在传送签名时,不需要传送消息本身,因为验证人在验证代理签名时可以恢复出消息.和其它代理签名方案,该方案降低了传输消息本身所需的通信开销,适用于对短消息签名.