Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Anonymous Fingerprinting with Direct Non-repudiation
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Short Signatures from the Weil Pairing
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Energy aware lossless data compression
Proceedings of the 1st international conference on Mobile systems, applications and services
Multi-signatures in the plain public-Key model and a general forking lemma
Proceedings of the 13th ACM conference on Computer and communications security
Certificateless signature: a new security model and an improved generic construction
Designs, Codes and Cryptography
Malicious KGC attacks in certificateless cryptography
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Efficient and provably-secure certificateless short signature scheme from bilinear pairings
Computer Standards & Interfaces
Efficient and Short Certificateless Signature
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
Efficient Short Signatures from Pairing
ITNG '09 Proceedings of the 2009 Sixth International Conference on Information Technology: New Generations
Certificateless signature revisited
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Efficient and short certificateless signatures secure against realistic adversaries
The Journal of Supercomputing
On the security of certificateless signature schemes from asiacrypt 2003
CANS'05 Proceedings of the 4th international conference on Cryptology and Network Security
Strongly unforgeable signatures based on computational diffie-hellman
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Certificateless public-key signature: security model and efficient construction
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
New directions in cryptography
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Short certificateless signatures have come into limelight in recent years. On the one hand, the property of certificateless eliminates the certificate management problem in traditional PKI and the key-escrow problem in some ID-based signature schemes. On the other hand, due to the short signature length, short certificateless signatures can be applied to systems where signatures are typed in by human or systems with low-bandwidth channels and/or low-computation power, such as PDAs or cell phones. However, there has been a trade-off between short certificateless signature schemes and their security levels. All existing short certificateless signature schemes can only be proven secure against a normal type adversary rather than a stronger one, who can obtain valid certificateless signatures under public keys replaced by the adversary. In this paper, we solve this open problem by given an efficient strongly secure short certificateless signature scheme. The proposed scheme has the following features. Firstly, it is strongly unforgeable. Secondly, the security can be reduced to the Computational Diffie-Hellman (CDH) assumption - a classic complexity assumption. Lastly, the proposed scheme is provably secure against adversaries with access to a super signing oracle which generates valid certificateless signatures of messages and public keys chosen by the adversary (without providing the corresponding secret values).