scholarly journals An efficient and provably-secure certificateless signature scheme without bilinear pairings

2011 ◽  
Vol 25 (11) ◽  
pp. 1432-1442 ◽  
Author(s):  
D. He ◽  
J. Chen ◽  
R. Zhang
Keyword(s):  
Bilinear Pairings ◽  
Signature Scheme ◽  
Certificateless Signature ◽  
Provably Secure

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 pairing-free and provably secure certificateless signature scheme

2018 ◽  
Vol 450 ◽  
pp. 378-391 ◽  
Author(s):  
Arijit Karati ◽  
SK Hafizul Islam ◽  
G.P. Biswas
Keyword(s):  
Signature Scheme ◽  
Certificateless Signature ◽  
Provably Secure

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.

An efficient provably-secure certificateless signature scheme for Internet-of-Things deployment

2018 ◽  
Vol 71 ◽  
pp. 78-87 ◽  
Author(s):  
Xiaoying Jia ◽  
Debiao He ◽  
Qin Liu ◽  
Kim-Kwang Raymond Choo
Keyword(s):  
Internet Of Things ◽  
Signature Scheme ◽  
Certificateless Signature ◽  
Provably Secure

Provably Secure and Lightweight Certificateless Signature Scheme for IIoT Environments

2018 ◽  
Vol 14 (8) ◽  
pp. 3701-3711 ◽  
Author(s):  
Arijit Karati ◽  
SK Hafizul Islam ◽  
Marimuthu Karuppiah
Keyword(s):  
Signature Scheme ◽  
Certificateless Signature ◽  
Provably Secure

An Improved RSA-Based Certificateless Signature Scheme

2014 ◽  
Vol 687-691 ◽  
pp. 2165-2168
Author(s):  
Xue Dong Dong ◽  
Hui Min Lu
Keyword(s):  
Random Oracle Model ◽  
Random Oracle ◽  
Type I ◽  
Signature Scheme ◽  
The Public ◽  
Public Keys ◽  
Security Properties ◽  
Identity Based ◽  
Certificateless Signature ◽  
Provably Secure

Certificateless-based signature can eliminate the need of certificates in the Public Key Infrastructure and solve the inherent key escrow problem in the identity-based cryptography. In 2012 Zhang et al. [J. Zhang and J. Mao, An efficient RSA-based certificateless signature scheme, Journal of Systems and Software, vol. 85, pp. 638-642, 2012] proposed the first certificateless signature scheme based on RSA operations and showed that their scheme is provably secure in the random oracle model. However, He et al. [D. He, M.Khan, and S. Wu, On the security of a RSA-based certificateless signature scheme, International Journal of Network Security, vol.16, no.1, pp.78-80, 2014] recently showed that Zhang et al.'s scheme is insecure against a type I adversary who can replace users' public keys. In this paper, we propose an improved version based on RSA which not only keeps the original security properties of the signature, but also is secure against a type I adversary.

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