Abstract
This work presents a SSE scheme that provides a practical trade-off between performance and privacy. Our scheme supports highly efficient one-round multi-keyword query over symmetrically encrypted large-scale data. Meanwhile, our scheme provides semantic security against chosen-keyword attacks (IND2-CKA) and mitigates the leakage of search pattern. We present the security analysis and the query accuracy analysis of our scheme. Experimental evaluations conducted on large representative real-word data set show that compared to the state-of-the-art, the proposed solution indeed introduces high query performance and accuracy, and low overhead of index updates.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hacigms, H., Lyer, B., Li, C., Mhrotra, S.: Executing sql over encrypted data in the database-server-provider model. In: SIGMOD, pp. 216–227. ACM (2002)
Kamara, S., Lauter, K.: Cryptographic cloud storage. In: Sion, R., Curtmola, R., Dietrich, S., Kiayias, A., Miret, J.M., Sako, K., Sebé, F. (eds.) RLCPS, WECSR, and WLC 2010. LNCS, vol. 6054, pp. 136–149. Springer, Heidelberg (2010)
Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: IEEE Symposium on Security and Privacy, pp. 44–55. IEEE (2000)
Goh, E.J.: Secure indexes. In: IACR (2003)
Curtmola, R., Garay, J.A., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: Improved definitions and efficient constructions. In: ACM CCS, pp. 79–88. ACM (2006)
Cao, N., Wang, C., Li, M., Ren, K., Lou, W.: Privacy-preserving multi-keyword ranked search over encrypted cloud data. In: INFOCOM, pp. 829–837. IEEE (2011)
Cash, D., Jarecki, S., Jutla, C., Krawczyk, H., Roşu, M.-C., Steiner, M.: Highly-scalable searchable symmetric encryption with support for boolean queries. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 353–373. Springer, Heidelberg (2013)
Wong, W.K., Cheung, D.W.-L., Kao, B., Mamoulis, N.: Secure knn computation on encrypted databases. In: SIGMOD, pp. 139–152. ACM (2009)
van Liesdonk, P., Sedghi, S., Doumen, J., Hartel, P., Jonker, W.: Computationally efficient searchable symmetric encryption. In: Jonker, W., Petković, M. (eds.) SDM 2010. LNCS, vol. 6358, pp. 87–100. Springer, Heidelberg (2010)
Kuzu, M., Islam, M.S., Kantarcioglu, M.: Efficient similarity search over encrypted data. In: ICDE, pp. 1156–1167. IEEE (2012)
Hu, H., Xu, J., Ren, C., Choi, B.: Processing private queries over untrusted sata cloud through privacy homomorphism. In: ICDE, pp. 601–612. IEEE (2011)
Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: ACM CCS, pp. 965–976. ACM (2012)
Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506–522. Springer, Heidelberg (2004)
Boneh, D., Kushilevitz, E., Ostrovsky, R., Skeith III, W.E.: Public key encryption that allows pir queries. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 50–67. Springer, Heidelberg (2007)
Cohen, W.W.: Enron email dataset, http://www.cs.cmu.edu/~enron/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Cheng, F., Wang, Q., Zhang, Q., Peng, Z. (2014). Highly Efficient Indexing for Privacy-Preserving Multi-keyword Query over Encrypted Cloud Data. In: Li, F., Li, G., Hwang, Sw., Yao, B., Zhang, Z. (eds) Web-Age Information Management. WAIM 2014. Lecture Notes in Computer Science, vol 8485. Springer, Cham. https://doi.org/10.1007/978-3-319-08010-9_37
Download citation
DOI: https://doi.org/10.1007/978-3-319-08010-9_37
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08009-3
Online ISBN: 978-3-319-08010-9
eBook Packages: Computer ScienceComputer Science (R0)