An Efficient Identity-Based Short Signature Scheme from Bilinear Pairings

2007 ◽  
Author(s):  
Hongzhen Du ◽  
Qiaoyan Wen
Keyword(s):  
Bilinear Pairings ◽  
Signature Scheme ◽  
Identity Based ◽  
Short Signature

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.

Another Attack on Tso's Short Signature Scheme Based on Bilinear Pairings

2011 ◽  
Vol 63-64 ◽  
pp. 785-788
Author(s):  
Fan Yu Kong ◽  
Lei Wu ◽  
Jia Yu
Keyword(s):  
Random Oracle Model ◽  
Bilinear Pairings ◽  
Random Oracle ◽  
Public Key ◽  
Signature Scheme ◽  
Short Signature ◽  
Provably Secure

In 2009, R. Tso et al. proposed an efficient pairing-based short signature scheme which is provably secure in the Random Oracle Model. In this paper, we propose a new key substitution attack on Raylin Tso et al.’s short signature scheme. For a given message and the corresponding valid signature, the malicious attacker can generate a substituted public key. Everyone verifies the signature successfully with the malicious attacker’s substituted public key. Therefore, Raylin Tso et al.’s short signature scheme has a security flaw in the multi-user setting.

scholarly journals An Identity-Based Multi-Proxy Multi-Signature Scheme Without Bilinear Pairings and its Variants

2014 ◽  
Vol 58 (4) ◽  
pp. 1021-1039 ◽  
Author(s):  
M. R. Asaar ◽  
M. Salmasizadeh ◽  
W. Susilo
Keyword(s):  
Bilinear Pairings ◽  
Signature Scheme ◽  
Identity Based

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.

A Novel ID-Based Strong Designated Verifier Signature Scheme

2012 ◽  
Vol 220-223 ◽  
pp. 2870-2874
Author(s):  
Hong Zhen Du ◽  
Mei Juan Huang
Keyword(s):  
Bilinear Pairings ◽  
Efficiency Analysis ◽  
Security Requirements ◽  
Signature Scheme ◽  
Security Proofs ◽  
Identity Based ◽  
Designated Verifier ◽  
Designated Verifier Signature ◽  
Identity Based Cryptography

We construct an efficient and novel identity-based strong designated verifier signature (IBSDVS) scheme based on bilinear pairings, and provide the security proofs and efficiency analysis for the proposed scheme. Our IBSDVS scheme achieves higher efficiency and satisfies all the security requirements of the designated verifier signatures in identity-based cryptography.

Applied-Information Technology in an Improved Certificateless Signature Scheme without Bilinear Pairings

2014 ◽  
Vol 685 ◽  
pp. 528-531
Author(s):  
Ying Lian Wang ◽  
Jun Yao Ye
Keyword(s):  
Information Technology ◽  
High Efficiency ◽  
Discrete Logarithm ◽  
Simple Algorithm ◽  
Simple Calculation ◽  
Bilinear Pairings ◽  
Signature Scheme ◽  
Short Signature ◽  
Low Efficiency ◽  
Certificateless Signature

This paper analyzed two certificateless signature scheme without bilinear pairings, which pointed out that the Wang scheme had high efficiency, simple algorithm and short signature length, but it had low security. Compared with the Wang scheme, the Chen scheme had high security, but it had high calculation cost, low efficiency and long signature length, which was not practical in wireless network environment requiring low bandwidth. In order to overcome the disadvantages of the two schemes, we proposed a new improved certificateless signature scheme, which had simple calculation, high efficiency and short signature length. We proved the scheme to be secure based on the discrete logarithm problem.

Sign in / Sign up

Export Citation Format

Share Document