Open AccessSecurity analysis of two certificateless short signature schemes
Author(s) -
Du Hongzhen,
Wen Qiaoyan
Publication year - 2014
Publication title -
iet information security
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.308
H-Index - 34
eISSN - 1751-8717
pISSN - 1751-8709
DOI - 10.1049/iet-ifs.2013.0080
Subject(s) - public key cryptography , computer science , computer security , random oracle , key escrow , cryptography , signature (topology) , certificate , scheme (mathematics) , id based cryptography , theoretical computer science , mathematics , key distribution , encryption , mathematical analysis , geometry
Certificateless public key cryptography (CL‐PKC) combines the advantage of both traditional PKC and identity‐based cryptography (IBC) as it eliminates the certificate management problem in traditional PKC and resolves the key escrow problem in IBC. Recently, Choi et al . and Tso et al . proposed two different efficient CL short signature schemes and claimed that the two schemes are secure against super adversaries and satisfy the strongest security. In this study, the authors show that both Choi et al .’s scheme and Tso et al .’s scheme are insecure against the strong adversaries who can replace users’ public keys and have access to the signing oracle under the replaced public keys.