scholarly journals A Novel Anonymous Proxy Signature Scheme

2012 ◽  
Vol 2012 ◽  
pp. 1-10
Author(s):  
Jue-Sam Chou
Keyword(s):  
Bilinear Pairings ◽  
Proxy Signature ◽  
Random Numbers ◽  
Signature Scheme ◽  
Signature Schemes

Recently, several studies about proxy signature schemes have been conducted. In 2009, Yu et al. proposed an anonymous proxy signature scheme attempting to protect the proxy signer's privacy from outsiders. They claimed that their scheme can make the proxy signer anonymous. However, based on our research, we determined that this was not the case and the proxy signer's privacy was not anonymous. Hence, in this paper, we propose a new anonymous proxy signature scheme that truly makes the proxy signer anonymous while making it more secure and efficient when compared with Yu et al.'s scheme. Our proxy signature scheme consists of two contributions. First, we mainly use random numbers and bilinear pairings to attain the anonymous property. Secondly, we increase the security and efficiency of our proxy in the design.

An Anonymity-Revoking Proxy Signature Scheme

2012 ◽  
Vol 263-266 ◽  
pp. 2906-2910
Author(s):  
De Dong Zhang ◽  
Zhao Feng Ma ◽  
Yi Xian Yang
Keyword(s):  
Bilinear Pairings ◽  
Proxy Signature ◽  
The Other ◽  
Signature Scheme ◽  
Signature Schemes ◽  
The Real ◽  
Other Hand

The revocation of delegated rights and anonymity of proxy signer are essential issues of the proxy signature schemes. Based on the bilinear pairings, an anonymity-revoking proxy signature scheme was proposed. In this scheme, when an original signer found that a proxy signer was malicious or the delegation period was expired, he/she could revoke the malicious proxy signer’s signing capability efficiently through a trusted authority. On the other hand, only the signature from delegation of the original signer could be confirmed by the verifier and the identity of the proxy signer could not be known to the verifier. In appearing of disputation, the verifier could reveal the real identity of the proxy signer with the help of the original signer. This scheme can protect not only the original signer’s benefit but also the proxy signer s privacy.

Certificateless Short Signature Scheme from Bilinear Pairings

2013 ◽  
Vol 380-384 ◽  
pp. 2435-2438 ◽  
Author(s):  
Shu Rong Feng ◽  
Jiao Mo ◽  
Hua Zhang ◽  
Zheng Ping Jin
Keyword(s):  
Bilinear Pairings ◽  
Public Key ◽  
Security Level ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Short Signature ◽  
Certificateless Signature ◽  
Provably Secure

Certificateless short signature schemes can not only have the advantage of certificateless signature, but also provide a short signature size in communication. However, all existing certificateless short signature schemes only proven secure against a normal adversary which can only obtain the valid signature for the original public key rather than a super adversary which can obtain the valid signature for the replaced public key. Recently, Fan et al. proposed a certificateless short signature scheme which is very efficient, but we found it is still cannot against super adversary. In this paper, we first analysis their scheme, and then present an improved scheme which can against super adversaries. Furthermore, our scheme can provide both the strongest security level and the shortest signature size compared the existed provably secure certificateless short signature scheme.

A Blind Proxy Re-Signatures Scheme Based on Random Oracle

2011 ◽  
Vol 204-210 ◽  
pp. 1062-1065 ◽  
Author(s):  
Yu Qiao Deng
Keyword(s):  
Digital Signature ◽  
Digital Signatures ◽  
Random Oracle ◽  
Proxy Signature ◽  
Public Key ◽  
Signature Scheme ◽  
Signature Schemes

Digital signature schemes allow a signer to transform any message into a signed message, such that anyone can verify the validity of the signed message using the signer’s public key, but only the signer can generate signed messages. A proxy re-signature, which is a type of digital signatures, has significant applications in many areas. Proxy signature scheme was first introduced by Blaze, Bleumer, and Strauss, but that scheme is inefficient and with limited features. After that, some Proxy re-signature schemes were proposed by researchers. This paper constructs a blind proxy re-signatures scheme. Comparing to the previous proxy re-signature schemes, the scheme adds a message blinded feature, and then the security of the scheme is proven.

ID-Based Deniable Ring Signature with Constant-Size Signature

2011 ◽  
Vol 255-260 ◽  
pp. 2192-2196
Author(s):  
Cheng Yu Hu ◽  
Peng Tao Liu
Keyword(s):  
Bilinear Pairings ◽  
The Other ◽  
Ring Size ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Ring Signature ◽  
Constant Size ◽  
Identity Based ◽  
Verification Process

The ring signature can guarantee the signer’s anonymity. Most proposed ring signature schemes have two problems: One is that the size of ring signature depends linearly on the ring size, and the other is that the signer can shift the blame to victims because of the anonymity. Some authors have studied the constant-size ring signature and deniable ring signature to solve these two problems. This paper shows that an identity-based ring signature scheme with constant size has some security problems by using an insecure accumulator and its verification process does not include the message m. Then we combine the concepts of “constant-size” and “deniable” to form an id-based deniable ring signature with constant-size signature. The new scheme with constant-size signature length is proposed based on an improved accumulator from bilinear pairings and it solves the problem of anonymity abuse.

scholarly journals Strong Identity-Based Proxy Signature Schemes, Revisited

2018 ◽  
Vol 2018 ◽  
pp. 1-11
Author(s):  
Weiwei Liu ◽  
Yi Mu ◽  
Guomin Yang ◽  
Yangguang Tian
Keyword(s):  
Proxy Signature ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Cryptographic Primitive ◽  
Identity Based

Proxy signature is a useful cryptographic primitive that has been widely used in many applications. It has attracted a lot of attention since it was introduced. There have been lots of works in constructing efficient and secure proxy signature schemes. In this paper, we identify a new attack that has been neglected by many existing proven secure proxy signature schemes. We demonstrate this attack by launching it against an identity-based proxy signature scheme which is proven secure. We then propose one method that can effectively prevent this attack. The weakness in some other proxy signature schemes can also be fixed by applying the same method.

ID-based directed proxy signature scheme from bilinear pairings

2010 ◽  
Vol 13 (5) ◽  
pp. 487-500 ◽  
Author(s):  
P. Vasudeva Reddy ◽  
B. Umaprasada Rao ◽  
T. Gowri
Keyword(s):  
Bilinear Pairings ◽  
Proxy Signature ◽  
Signature Scheme

A provably secure proxy signature scheme from bilinear pairings

2010 ◽  
Vol 27 (3) ◽  
pp. 298-304 ◽  
Author(s):  
Aiqin Wang ◽  
Jiguo Li ◽  
Zhijian Wang
Keyword(s):  
Bilinear Pairings ◽  
Proxy Signature ◽  
Signature Scheme ◽  
Provably Secure
Sign in / Sign up

Export Citation Format

Share Document