An efficient disjunctive query enabled ranked searchable encryption scheme

Tahir, S. F., Ruj, S. & Rajarajan, M. (2017). An efficient disjunctive query enabled ranked searchable encryption scheme. 2017 IEEE Trustcom/BigDataSE/ICESS, pp. 425-433. doi: 10.1109/Trustcom/BigDataSE/ICESS.2017.267

Text - Accepted Version
Download (338kB) | Preview


Cloud computing motivates data owners to economically outsource large amounts of data to the cloud. To preserve the privacy and confidentiality of the documents, the documents need to be encrypted prior to being outsourced to the cloud. In this paper, we propose a lightweight construction that facilitates ranked disjunctive keyword (multi-keyword) searchable encryption based on probabilistic trapdoors. The security analysis yieldsthat the probabilistic trapdoors help resist distinguishability attacks. Through the computational complexity analysis we realize that our scheme outperforms similar existing schemes. We explore the use of searchable encryption in the telecom domain by implementing and deploying our proof of concept prototypeonto the British Telecommunication's Public Cloud offering and testing it over a real corpus of audio transcriptions. The extensive experimentation thereafter validates our claim that our scheme is lightweight.

Item Type: Article
Additional Information: © 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works
Uncontrolled Keywords: Probabilistic Trapdoors; Indistinguishability; Privacy Preservation; Inverted Index
Divisions: School of Engineering & Mathematical Sciences > Engineering

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics