Abstract
We propose a scheme to index encrypted documents on an untrusted server and evaluate keyword search queries against them. The proposed scheme provides better security than deterministic encryption schemes and is far more efficient than existing searchable encryption schemes in literature. Furthermore, it provides the user with a set of control parameters to adjust the level of exposure against the efficiency of the indexing scheme. It also allows easy updates and deletions unlike most existing encrypted searching schemes. We carry out preliminary experiments to test the effectiveness of the proposed scheme and give an intuition for the security properties along with a fairly detailed outline of the security formalism that we are currently developing to analyze the security of our scheme.
This is a preview of subscription content, log in via an institution to check access.
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
Ballard, L., Kamara, S., Monrose, F.: Achieving Efficient Conjunctive Keyword Searches over Encrypted Data. In: Qing, S., Mao, W., López, J., Wang, G. (eds.) ICICS 2005. LNCS, vol. 3783, pp. 414–426. Springer, Heidelberg (2005)
Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public Key Encryption with Keyword Search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506–522. Springer, Heidelberg (2004)
Boneh, D., Waters, B.: Conjunctive, Subset, and Range Queries on Encrypted Data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 535–554. Springer, Heidelberg (2007)
Briney, A.: Information Security Industry Survey (2001), http://www.infosecuritymag.com/archives2001.shtml (cited in October 2002)
Chang, Y.-C., Mitzenmacher, M.: Privacy Preserving Keyword Searches on Remote Encrypted Data. In: Ioannidis, J., Keromytis, A.D., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 442–455. Springer, Heidelberg (2005)
Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: CCS (2006)
Goh, E.: Secure Indexes (2003) (unpubished manuscript)
Golle, P., Staddon, J., Waters, B.: Secure Conjunctive Keyword Search over Encrypted Data. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) ACNS 2004. LNCS, vol. 3089, pp. 31–45. Springer, Heidelberg (2004)
Hore, B., Mehrotra, S., Canim, M., Kantarcioglu, M.: Secure Multidimensional Range Queries over Outsourced Data. VLDB Journal (2012)
Hore, B., Mehrotra, S., Tsudik, G.: A Privacy-Preserving Index for Range Queries. In: VLDB (2004)
Krauthgamer, R., Mehta, A., Raman, V., Rudra, A.: Greedy list intersection. In: ICDE (2008)
Li, J., Omiecinski, E.: Efficiency and Security Trade-Off in Supporting Range Queries on Encrypted Databases. In: DBSec (2005)
Raman, V., Qiao, L., Han, W., Narang, I., Chen, Y.: Lazy, adaptive rid-list intersection, and its application to index anding. In: SIGMOD (2007)
Shi, E., Bethencourt, J., Chan, H.T.-H., Song, D.X., Perrig, A.: Multi-Dimensional Range Query over Encrypted Data. In: IEEE S&P (2007)
Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: IEEE S&P (2000)
Waters, B., Balfanz, D., Durfee, G., Smetters, D.: Building and encrypted and searchable audit log. In: NDSS (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hore, B., Chang, EC., Diallo, M.H., Mehrotra, S. (2012). Indexing Encrypted Documents for Supporting Efficient Keyword Search. In: Jonker, W., Petković, M. (eds) Secure Data Management. SDM 2012. Lecture Notes in Computer Science, vol 7482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32873-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-32873-2_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32872-5
Online ISBN: 978-3-642-32873-2
eBook Packages: Computer ScienceComputer Science (R0)