A strong provably secure IBE scheme without bilinear map

Zheng, Minghui, Xiang, Yang and Zhou, Huihua 2015, A strong provably secure IBE scheme without bilinear map, Journal of computer and system sciences, vol. 81, no. 1, pp. 125-131, doi: 10.1016/j.jcss.2014.06.020.

Attached Files
Name Description MIMEType Size Downloads

Title A strong provably secure IBE scheme without bilinear map
Author(s) Zheng, Minghui
Xiang, YangORCID iD for Xiang, Yang orcid.org/0000-0001-5252-0831
Zhou, Huihua
Journal name Journal of computer and system sciences
Volume number 81
Issue number 1
Start page 125
End page 131
Total pages 7
Publisher Elsevier
Place of publication Amsterdam, The Netherlands
Publication date 2015-02
ISSN 0022-0000
1090-2724
Keyword(s) Bilinear map
Combined public-key scheme
Identity-based encryption
Provable security
Science & Technology
Technology
Computer Science, Hardware & Architecture
Computer Science, Theory & Methods
Computer Science
RANDOM ORACLES
Summary Identity-based encryption (IBE) allows one party to send ciphered messages to another using an arbitrary identity string as an encryption key. Since IBE does not require prior generation and distribution of keys, it greatly simplifies key management in public-key cryptography. According to the Menezes-Okamoto-Vanstone (MOV) reduction theory, the IBE scheme based on bilinear map loses the high efficiency of elliptic curve because of the requirement of large security parameters. Therefore, it is important to build a provably secure IBE scheme without bilinear map. To this end, this paper proposes an improved IBE scheme that is different from the previous schemes because this new scheme does not use symmetric encryption algorithm. Furthermore, it can be proven to be secure against adaptively chosen identity and chosen plaintext attacks in the standard model. Elaborated security and performance analysis demonstrate that this new scheme outperforms the previous ones in terms of the time complexity for encryption and decryption.
Language eng
DOI 10.1016/j.jcss.2014.06.020
Field of Research 0802 Computation Theory And Mathematics
0805 Distributed Computing
080402 Data Encryption
Socio Economic Objective 890205 Information Processing Services (incl. Data Entry and Capture)
HERDC Research category C1 Refereed article in a scholarly journal
ERA Research output type C Journal article
Copyright notice ©2015, Elsevier
Persistent URL http://hdl.handle.net/10536/DRO/DU:30072736

Document type: Journal Article
Collection: School of Information Technology
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 6 times in TR Web of Science
Scopus Citation Count Cited 7 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 86 Abstract Views, 3 File Downloads  -  Detailed Statistics
Created: Wed, 17 Feb 2016, 16:10:03 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.