A Modified Efficient Certificateless Signature Scheme without Bilinear Pairings

2015 ◽  
Author(s):  
Liangliang Wang ◽  
Kefei Chen ◽  
Yu Long ◽  
Xianping Mao ◽  
Huige Wang
Keyword(s):  
Bilinear Pairings ◽  
Signature Scheme ◽  
Certificateless 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.

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.

An efficient certificateless signature scheme without bilinear pairings

2014 ◽  
Vol 74 (16) ◽  
pp. 6519-6530 ◽  
Author(s):  
Kuo-Hui Yeh ◽  
Kuo-Yu Tsai ◽  
Chuan-Yen Fan
Keyword(s):  
Bilinear Pairings ◽  
Signature Scheme ◽  
Certificateless Signature
Sign in / Sign up

Export Citation Format

Share Document