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.

Multi-proxy quantum group signature scheme with threshold shared verification

A multi-proxy quantum group signature scheme with threshold shared verification is proposed. An original signer may authorize a proxy group as his proxy agent. Then only the cooperation of all the signers in the proxy group can generate the proxy signature on behalf of the original signer. In the scheme, any t or more of n receivers can verify the message and any t - 1 or fewer receivers cannot verify the validity of the proxy signature.

A Nominative Multi-Proxy Signature Scheme Based on ECC

A nominative multi-proxy signature in which the original signer authorizes a group of proxy signers is presented. Meanwhile, our proposed scheme is based on elliptic curve cryptosystem which is more efficient than the corresponding one based on traditional discrete logarithm.

Provable Security of ID-Based Proxy Multi-Signature Schemes

In the last couple of years, D-based cryptography has got fruitful achievements. Proxy multi-signature allows a designated person, called a proxy signer, to sign on behalf of two or more original signers. In this paper, we present a general security model for ID-based proxy multi-signature （ID-PMS） schemes. Then, we show how to construct a secure ID-PMS scheme from a secure ID-based signature scheme, and prove that the security of the construction can be reduced to the security of the original ID-based signature scheme.

Improvement of M-U-O and K-P-W proxy signature schemes

The concept of proxy signature introduced by Mambo, Usuda, and Okamoto allows a designated person, called a proxy signer, to sign on behalf of an original signer in 1996. However, most existing proxy signature schemes does not support nonrepudiation. In this paper, we propose two secure nonrepudiable proxy signature schemes, which overcome disadvantages of M U O and K P W proxy signature schemes, respectively. The schemes proposed can withstand public key substitution attack and forge attack. In addition, our new schemes have some other advantages such as proxy signature key generation and updating using insecure channels. Our approach can also be applied to other ElGamal like proxy signature schemes.

Improved certificateless multi-proxy signature

Multi-proxy signature is a scheme that an original signer delegates his or her signing capability to a proxy group. In the scheme, only the cooperation of all proxy signers in the proxy group can create a signature on behalf of the original signer. Jin and Wen firstly defined the formal security model of certificateless multi-proxy signature （CLMPS） and proposed a concrete CLMPS scheme. However, their construction model is inaccurate, the concrete signature scheme has has three problems： the definition of the strengthened security a security flaw, and the proof of the security is imperfect. With further consideration, a remedial strengthened security model is redefined, and an improved scheme is also proposed, which is existentially unforgeable against adaptively chosen-warrant, chosen-message and chosen-identity attacks in the random oracles. In this condition, the computational Diffie-Hellman （CDH） assumption is used to prove full security for our CLMPS scheme.

An Improved Proxy Multi-Signature Scheme

Based on the Kim-like's proxy multi-signature scheme, an improved proxymulti-signature scheme is proposed. The new scheme overcomes the two problems in the Kim-like'sproxy multi-signature scheme: (1) Security issue ( every original signer can forge a valid proxymulti-signature for any message); (2) Efficiency issue ( both the size of the proxy multi-signatureand the efficiency of signature checking are dependent on the number of the original signers).

A Practical E-Payment Protocol Based on Quantum Multi-Proxy Blind Signature

A practical E-payment protocol is presented in this paper. It is based on quantum multi-proxy blind signature. Adopting the techniques of quantum key distribution, one-time pad and quantum multi-proxy blind signature, our E-payment system could protect user's anonymity as the traditional E-payment systems do, and also have unconditional security, which the classical E-payment systems can not provide. Furthermore, compared with the existing quantum E-payment systems, this practical system could not only support mobile E-payment transactions but also inter-bank transactions.

Efficient ID-based proxy multi-signature scheme secure in random oracle

Proxy signature schemes enable an entity to del- egate its signing rights to any other party, called proxy signer. As a variant of proxy signature primitive, proxy multi- signature allows a group of original signers to delegate their signing capabilities to a single proxy signer in such a way that the proxy signer can sign a message on behalf of the group of original signers. We propose a concrete ID-based proxy multi-signature scheme from bilinear pairings. The proposed scheme is existential unforgeable against adaptively chosen message and given ID-attack in random oracle model under the computational Diltie-Hellman （CDH） assumption. The fascinating property of new scheme is that the size of a proxy multi-signature is independent of the number of original sign- ers. Furthermore the proposed scheme is simple and com- putationally more efficient than other ID-based proxy multi- signature schemes.

基于Nyberg-Rueppel签名体制的盲代理多重签名方案

为了实现一个盲代理签名能够同时代表多个原始签名人签名,在对盲代理签名研究的基础上,首次提出了盲代理多重签名这一概念,该签名克服了一个盲代理签名只能代表一个原始签名人签名的局限性。此外,在Nyberg-Rueppel盲代理签名和代理多重签名2种体制研究的基础上,基于离散对数,分别提出了具有盲代理签名和代理多重签名双重性质的第一类盲代理多重签名方案和第二类盲代理多重签名方案,并对2方案的安全性进行了论证。

Hwang-多重代理多重签名方案的改进

多重代理多重签名就是由多个人组成的原始签名者组授权由多个人组成的代理签名者组对消息进行签名.通过对Hwang-多重代理多重签名方案的研究,发现了它的弱点,即可伪造对任意消息的签名.对此提出了改进方案,并详细分析了其安全性.改进后方案可抵抗现在已知的攻击,更加完善.

基于强Diffie-Hellman假设的多级代理签名方案

以Boneh和Boyen提出的强Diffie-Hellman(q-SDH)假设为基础,结合Wei和Yuen的短签名方案,提出了一种新的多级代理签名方案。该方案具有不可否认性、不可伪造性、不可抵赖性以及多级代理需具备的其它性质,实现了签名权在允许范围内的逐级代理。

一种新的基于身份的代理多重盲签名方案

代理签名是解决签名权利委托的一种方案,代理签名可以结合其他特殊的签名方案生成一些新的代理签名方案.代理多重签名可以解决一个签名人代替多个原始签名人签名的问题,盲签名用于隐藏原始消息.结合代理多重签名和盲签名的特性,从双线性对的角度提出一种基于身份的代理多重盲签名方案,私钥生成器利用每个签名人本人身份生成不同的密钥.通过对方案的安全性分析,发现该方案可以抵抗原始签名者内部攻击,防止代理签名权的滥用,具有不可伪造性、不可否认性、不可链接性、盲性和计算效率高的特点.

N-R签名体制的盲代理多重签名方案的改进

对基于Nyberg-Rueppel签名体制的盲代理多重签名方案进行密码分析,发现此方案中多处存在孤悬因子,且代理签名密钥不包含代理签名人的秘密密钥。对此方案的伪造攻击正是因为孤悬因子的存在,代理签名密钥不包含代理签名人的秘密密钥,则原始签名人可以伪造代理签名密钥并产生有效的盲代理签名。提出了两个对基于Nyberg-Rueppel签名体制的盲代理多重签明方案的改进方案,消除了孤悬因子,使代理签名密钥包含了代理签名人的秘密密钥;对改进后的方案进行了安全性分析。

基于离散对数新的多重代理多重盲签名方案

为了抵抗原始签名者内部攻击,代理授权信息以及签名信息不需要通过安全信道被安全传递,对提高签名方案的速率具有重要意义.在基于离散对数的多重代理多重盲签名方案的基础上,通过改进代理私钥,结合哈希求逆函数困难的方法,提出一种新的基于离散对数的多重代理多重盲签名方案.同时给出签名方案详细的授权过程、签名过程和验证过程.通过对方案的正确性和安全性分析,表明该方案具有不可否认性、不可链接性和盲性等特点.

改进的前向安全代理多重盲签名方案

前向安全的代理多重盲签名(Forward-secure proxy blind multi-signature,FSPBMS)同时具备前向安全性、代理多重签名及盲签名的优势。将前向安全特性和代理多重盲签名的基本思想融为一体,提出了一种改进的前向安全代理多重盲签名方案,并给出它的形式化定义和安全性证明。方案在具有前向安全性的基础上保护了消息拥有者的隐私权。证明了FSPBMS方案的正确性,并分析其安全性和复杂度。结果表明了FSPBMS方案具有快速且易于实现的优点。

代理多重签名方案的密码分析与修改

对伊丽江等提出的的代理多重签名方案进行了详细的分析,指出该方案是不安全的,不能抵抗公钥替换攻击和合谋攻击,并给出了两个改进的代理多重签名方案。改进后的方案具有不可否认性,不使用安全信道,以及抵抗公钥替换攻击和合谋攻击等优点。

代理多重签名

在代理签名方案中 ,代理签名人可以代表原始签名人生成签名 .然而 ,在已知的各种代理签名方案中 ,代理签名人生成的每个代理签名都只代表一个原始签名人 .有些情形需要一个代理签名能够同时代表多个原始签名人 ,而已知的代理签名方案都不能满足这个需要 .给出了一类称为代理多重签名的新代理签名方案 .在这种新方案中 。

代理多重签名:一类新的代理签名方案

在代理签名方案中 ,代理签名人可以代表原始签名人生成签名 .然而 ,在已知的各种代理签名方案中 ,代理签名人生成的每个代理签名都只代表一个原始签名人 .在有些情形 ,需要一个代理签名能够同时代表多个原始签名人 ,而已知的代理签名方案都不能满足这个需要 .本文给出一类称为代理多重签名的新代理签名方案 .在这种新方案中 。

一类新的代理多重签名体制

代理多重签名是一种特殊的数字签名体制 .利用一个代理多重签名体制 ,可以有效地解决多个签名人对同一个文件进行签名的问题 .文中将代理签名和多重签名的思想结合起来 ,提出了一类新的代理多重签名体制 ,给出了一个具体的实现方案 。