Paper 2015/933

Cryptanalysis of Provably Secure Certicateless Short Signature Scheme

Jayaprakash Kar

Abstract

Recently, Choi et al. proposed certificateless short signature scheme in random oracle model and the author claims that it is provably secure. Certificateless Public Key Cryptography is a new paradigm, where it allows resolving the inherent key escrow and key management problem. Attack to certificateless signature scheme are of two types as Type-I where the adversary can replace the public key of the user and cannot able to retrieve the master secret key from Key Generator Center (KGC). In Type-II, the adversary can able to obtain the master secret key and cannot replace the public key of the user. In this paper we have proven that, the proposed scheme is not secure against Type-I adversary. To prove, we solve linear Diophantine equation and obtain the partial-private key of the user.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
Keywords
Diophantine equationBilinear mapDigital signatureCertificateless signature
Contact author(s)
jayaprakashkar @ yahoo com
History
2015-09-27: received
Short URL
https://ia.cr/2015/933
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2015/933,
      author = {Jayaprakash Kar},
      title = {Cryptanalysis of Provably Secure Certicateless Short Signature Scheme},
      howpublished = {Cryptology ePrint Archive, Paper 2015/933},
      year = {2015},
      note = {\url{https://eprint.iacr.org/2015/933}},
      url = {https://eprint.iacr.org/2015/933}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.