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
Efficient Algorithms for Pairing-Based Cryptosystems
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
On the Existence of 3-Round Zero-Knowledge Protocols
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on 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
Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
New traitor tracing schemes using bilinear map
Proceedings of the 3rd ACM workshop on Digital rights management
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
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Malicious KGC attacks in certificateless cryptography
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Efficient Certificateless Signature Schemes
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Security Mediated Certificateless Signatures
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Efficient and provably-secure certificateless short signature scheme from bilinear pairings
Computer Standards & Interfaces
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
New efficient certificateless signature scheme
EUC'07 Proceedings of the 2007 conference on Emerging direction in embedded and ubiquitous computing
An efficient certificateless signature scheme
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
On the security of certificateless signature schemes from asiacrypt 2003
CANS'05 Proceedings of the 4th international conference on Cryptology and Network Security
An efficient certificateless signature scheme
EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
Certificateless public-key signature: security model and efficient construction
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
Strongly secure certificateless short signatures
Journal of Systems and Software
An efficient and provably-secure certificateless signature scheme without bilinear pairings
International Journal of Communication Systems
| Hi-index | 0.00 |
The notion of certificateless cryptography is aimed to eliminate the use of certificates in traditional public key cryptography and also to solve the key-escrow problem in identity-based cryptography. Many kinds of security models have been designed for certificateless cryptography and many new schemes have been introduced based on the correspondence of the security models. In generally speaking, a stronger security model can ensure a certificateless cryptosystem with a higher security level, but a realistic model can lead to a more efficient scheme. In this paper, we focus on the efficiency of a certificateless signature (CLS) scheme and introduce an efficient CLS scheme with short signature size. On one hand, the security of the scheme is based on a realistic model. In this model, an adversary is not allowed to get any valid signature under false public keys. On the other hand, our scheme is as efficient as BLS short signature scheme in both communication and computation and, therefore, turns out to be more efficient than other CLS schemes proposed so far. We provide a rigorous security proof of our scheme in the random oracle model. The security of our scheme is based on the k-CAA hard problem and a new discovered hard problem, namely the modified k-CAA problem. Our scheme can be applied to systems where signatures are typed in by human or systems with low-bandwidth channels and/or low-computation power.