Provably Secure Pairing-Based Convertible Undeniable Signature with Short Signature Length

2007 ◽  
pp. 367-391 ◽  
Author(s):  
Xinyi Huang ◽  
Yi Mu ◽  
Willy Susilo ◽  
Wei Wu
Keyword(s):  
Short Signature ◽  
Undeniable 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.

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 A new provably secure certificateless short signature scheme

2011 ◽  
Vol 61 (7) ◽  
pp. 1760-1768 ◽  
Author(s):  
Kyu Young Choi ◽  
Jong Hwan Park ◽  
Dong Hoon Lee
Keyword(s):  
Signature Scheme ◽  
Short Signature ◽  
Provably Secure

A provably secure code-based short signature scheme and its nontransferable variant

2018 ◽  
Vol 31 (6) ◽  
pp. e3519
Author(s):  
Maryam Rajabzadeh Asaar ◽  
Mahmoud Salmasizadeh ◽  
Mohammad Reza Aref
Keyword(s):  
Signature Scheme ◽  
Short Signature ◽  
Provably Secure
Sign in / Sign up

Export Citation Format

Share Document