caa a22 4500 445852186 CHVBK 20180317145416.0 cr unu---uuuuu 170323e20110201xx s 000 0 eng 10.1007/s11227-010-0427-x doi (NATIONALLICENCE)springer-10.1007/s11227-010-0427-x Efficient and short certificateless signatures secure against realistic adversaries [Elektronische Daten] [Raylin Tso, Xun Yi, Xinyi Huang] 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. Springer Science+Business Media, LLC, 2010 Bilinear pairing nationallicence Certificateless signature nationallicence Cryptographic protocol nationallicence Digital signature nationallicence Random oracle model nationallicence Short signature nationallicence Tso Raylin Department of Computer Science, National Chengchi University, Taipei, Taiwan aut Yi Xun School of Computer Science and Mathematics, Victoria University, Melbourne, Australia aut Huang Xinyi School of Information Systems, Singapore Management University, Singapore, Republic of Singapore aut The Journal of Supercomputing Springer US; http://www.springer-ny.com 55/2(2011-02-01), 173-191 0920-8542 55:2<173 2011 55 11227 https://doi.org/10.1007/s11227-010-0427-x text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s11227-010-0427-x text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Tso Raylin Department of Computer Science, National Chengchi University, Taipei, Taiwan aut NATIONALLICENCE 700 1- Yi Xun School of Computer Science and Mathematics, Victoria University, Melbourne, Australia aut NATIONALLICENCE 700 1- Huang Xinyi School of Information Systems, Singapore Management University, Singapore, Republic of Singapore aut NATIONALLICENCE 773 0- The Journal of Supercomputing Springer US; http://www.springer-ny.com 55/2(2011-02-01), 173-191 0920-8542 55:2<173 2011 55 11227 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer