Further observations on certificateless public key encryption Wang, Xu An, Huang, Xinyi and Yang, Xiaoyuan 2009, Further observations on certificateless public key encryption. In Yung, Moti, Liu, Peng and Lin, Dongdai (ed), Information security and cryptology, Springer-Verlag, Berlin, Germany, pp.217-239, doi: 10.1007/978-3-642-01440-6_18. Attached Files Name Description MIMEType Size Downloads Title Further observations on certificateless public key encryption Author(s) Wang, Xu An Huang, Xinyi Yang, Xiaoyuan Title of book Information security and cryptology Editor(s) Yung, Moti Liu, Peng Lin, Dongdai Publication date 2009 Series Lecture Notes in Computer Science ; v.5487 Chapter number 18 Total chapters 31 Start page 217 End page 239 Total pages 23 Publisher Springer-Verlag Place of Publication Berlin, Germany Keyword(s) data encryption systems and data security management of computing and information systems computers and society computer communication networks algorithm analysis problem complexity Summary Certificateless public key encryption can be classified into two types, namely, CLE and CLE † , both of which were introduced by Al-Riyami and Paterson in Asiacrypt 2003. Most works about certificateless public key encryption belong to CLE, where the partial secret key is uniquely determined by an entity’s identity. In CLE † , an entity’s partial secret key is not only determined by the identity information but also by his/her (partial) public key. Such techniques can enhance the resilience of certificateless public key encryption against a cheating KGC. In this paper, we first formalize the security definitions of CLE † . After that, we demonstrate the gap between the security model of CLE † and CLE, by showing the insecurity of a CLE † scheme proposed by Lai and Kou in PKC 2007. We give an attack that can successfully break the indistinguishability of their CLE † scheme, although their scheme can be proved secure in the security model of CLE. Therefore, it does not suffice to consider the security of CLE † in the security model of CLE. Finally, we show how to secure Lai-Kou’s scheme by providing a new scheme with the security proof in the model of CLE † ISBN 9783642014406 Language eng DOI 10.1007/978-3-642-01440-6_18 Field of Research 109999 Technology not elsewhere classified Socio Economic Objective 970110 Expanding Knowledge in Technology HERDC Research category B1.1 Book chapter Copyright notice ©2009, Springer Persistent URL http://hdl.handle.net/10536/DRO/DU:30064135 Document type: Book Chapter Collections: Faculty of Science, Engineering and Built Environment School of Information Technology Related Links Link Description Connect to published version (restricted access) Go to link with your DU access privileges     Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved. Versions Version Filter Type Mon, 09 Jun 2014, 14:10:39 EST Fri, 13 Jun 2014, 14:35:38 EST Mon, 16 Jun 2014, 11:32:07 EST Wed, 18 Jun 2014, 11:10:07 EST Thu, 20 Nov 2014, 11:51:21 EST Filtered Full Citation counts:   Cited 0 times in TR Web of Science Cited 0 times in Scopus Search Google Scholar Access Statistics: 170 Abstract Views, 2 File Downloads  -  Detailed Statistics Created: Mon, 09 Jun 2014, 14:10:39 EST