Research Article
An Efficient Searchable Encryption Scheme and Its Application in Network Forensics
514 downloads
@INPROCEEDINGS{10.1007/978-3-642-23602-0_6, author={Xiaodong Lin and Rongxing Lu and Kevin Foxton and Xuemin Shen}, title={An Efficient Searchable Encryption Scheme and Its Application in Network Forensics}, proceedings={Forensics in Telecommunications, Information, and Multimedia. Third International ICST Conference, e-Forensics 2010, Shanghai, China, November 11-12, 2010, Revised Selected Papers}, proceedings_a={E-FORENSICS}, year={2012}, month={10}, keywords={Searchable encryption Network forensics Provable security Efficiency}, doi={10.1007/978-3-642-23602-0_6} }- Xiaodong Lin
Rongxing Lu
Kevin Foxton
Xuemin Shen
Year: 2012
An Efficient Searchable Encryption Scheme and Its Application in Network Forensics
E-FORENSICS
Springer
DOI: 10.1007/978-3-642-23602-0_6
Abstract
Searchable encryption allows an encrypter to send a message, in an encrypted form, to a decryptor who can delegate to a third party to search the encrypted message for keywords without losing encrypted message content’s privacy. In this paper, based on the bilinear pairings, we propose a new efficient searchable encryption scheme, and use the provable security technique to formally prove its security in the random oracle model. Since some time-consuming operations can be pre-computed, the proposed scheme is very efficient. Therefore, it is particularly suitable for time-critical applications, such as network forensics scenarios, especial when the content is encrypted due to privacy concerns.
Copyright © 2010–2024 ICST
