Abstract

Breaches of data security and privacy have prompted concerns about data outsourcing. Encryption is an ideal solution, yet searching over encrypted data is a challenging task. Traditional data retrieval no longer hold, so searchable encryption (SE) techniques rise in response. Most of the related efforts are narrowly focused and problem-specific. None of them has simultaneously achieved the five keyword search functions (F5): fuzzy, multi-keyword, and ranked search as well as keyword addition/removal and instantaneous search revocation, together with the five privacy preserving requirements (P5): keyword privacy, index privacy, token privacy, search pattern privacy, and access pattern privacy. In this paper, a full-featured approach called F5P5 is presented, which achieves F5 and P5 simultaneously. Analysis and experiments show that F5P5 is secure and privacy preserving, and provides high-precision search results and is efficiency in terms of computation and storage.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call