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.

Identity-Based Proxy Signcryption Schemes

2013 ◽  
Vol 380-384 ◽  
pp. 2605-2608
Author(s):  
Jian Wu
Keyword(s):  
Digital Signature ◽  
Computational Cost ◽  
Proxy Signature ◽  
Single Step ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Identity Based Encryption ◽  
Encryption Schemes ◽  
Identity Based ◽  
Digital Signature Scheme

Identity-based encryption and signature schemes that allow any pair of users to communicate securely and to verify each other's signatures without verifying certificate. A signcryption is a primitive that provides the properties of both digital signatures and encryption schemes in a way that is more efficient than signing and encrypting separately. Proxy signature schemes are a variation of ordinary digital signature scheme that allow a proxy signer to sign messages on behalf of the original singer which proxy signcryption simultaneously fulfill both the functions of signature and encryption in a single step with a lower computational cost than that required by the traditional signature-then-encryption. In this paper, we present identity-based proxy signcryption schemes with lower efficient..

Proxy Re-Signature Scheme from CBS to IBS

2011 ◽  
Vol 304 ◽  
pp. 355-358
Author(s):  
Hai Bin Yang ◽  
Juan Li Sun ◽  
Xu An Wang ◽  
Jian Cui
Keyword(s):  
Public Key ◽  
Signature Scheme ◽  
Secret Key ◽  
Signature Schemes ◽  
Cryptographic Primitive ◽  
Potential Applications ◽  
Identity Based

In 1998, Blaze, Bleumer and Strauss proposed a new kind of cryptographic primitive called proxy re-signature. In proxy re-signature, a proxy can transform a signature computed under Alice’s secret key into one that can be verified by Bob’s public key. In 2005, Ateniese et al proposed a few re-signature schemes and also discussed its several potential applications. In this paper, we propose the first proxy re-signature scheme from certificate based signature (CBS) to identity based signature (IBS) with the help of PKG.

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.

Sign in / Sign up

Export Citation Format

Share Document