Achieving efficient conjunctive keyword searches over encrypted data

ICICS, pp. 414-426, 2005.

Cited by: 271|Bibtex|Views15|DOI:https://doi.org/10.1007/11602897_35
EI
Other Links: dl.acm.org|dblp.uni-trier.de|academic.microsoft.com

Abstract:

We present two provably secure and efficient schemes for performing conjunctive keyword searches over symmetrically encrypted data. Our first scheme is based on Shamir Secret Sharing and provides the most efficient search technique in this context to date. Although the size of its trapdoors is linear in the number of documents being searc...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments