Searchable encryption (SE) allows a client to store his data in the Cloud in a way that it is encrypted but still searchable by the server. However,when doing multi-keywords search (MKS),most SE schemes seems to be rather inefficient. In this paper,we design and implement an SE scheme that allows the MKS indices to be pre-built secretly at the server side,making fast MKS on very large databases possible. Detailed experiments and analysis are given,showing that our scheme is efficient,while the possible information leakages during the construction are proved to be minimized.
CITATION STYLE
Hong, C., Li, Y., Zhang, M., & Feng, D. (2016). Fast multi-keywords search over encrypted cloud data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10041 LNCS, pp. 433–446). Springer Verlag. https://doi.org/10.1007/978-3-319-48740-3_32
Mendeley helps you to discover research relevant for your work.