Indexing Encrypted Documents for Supporting Efficient Keyword Search

  • Bijit Hore
  • Ee-Chien Chang
  • Mamadou H. Diallo
  • Sharad Mehrotra
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7482)


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.


Index Structure Security Analysis Range Query Common Word Encrypt Data 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    Briney, A.: Information Security Industry Survey (2001), (cited in October 2002)
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: CCS (2006)Google Scholar
  7. 7.
    Goh, E.: Secure Indexes (2003) (unpubished manuscript)Google Scholar
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    Hore, B., Mehrotra, S., Canim, M., Kantarcioglu, M.: Secure Multidimensional Range Queries over Outsourced Data. VLDB Journal (2012)Google Scholar
  10. 10.
    Hore, B., Mehrotra, S., Tsudik, G.: A Privacy-Preserving Index for Range Queries. In: VLDB (2004)Google Scholar
  11. 11.
    Krauthgamer, R., Mehta, A., Raman, V., Rudra, A.: Greedy list intersection. In: ICDE (2008)Google Scholar
  12. 12.
    Li, J., Omiecinski, E.: Efficiency and Security Trade-Off in Supporting Range Queries on Encrypted Databases. In: DBSec (2005)Google Scholar
  13. 13.
    Raman, V., Qiao, L., Han, W., Narang, I., Chen, Y.: Lazy, adaptive rid-list intersection, and its application to index anding. In: SIGMOD (2007)Google Scholar
  14. 14.
    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)Google Scholar
  15. 15.
    Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: IEEE S&P (2000)Google Scholar
  16. 16.
    Waters, B., Balfanz, D., Durfee, G., Smetters, D.: Building and encrypted and searchable audit log. In: NDSS (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Bijit Hore
    • 1
  • Ee-Chien Chang
    • 2
  • Mamadou H. Diallo
    • 1
  • Sharad Mehrotra
    • 1
  1. 1.Donald Bren School of Information and Computer SciencesUniversity of CaliforniaIrvineUSA
  2. 2.School of ComputingNational University of SingaporeSingapore

Personalised recommendations