TSED: Top-k Ranked Searchable Encryption for Secure Cloud Data Storage

  • B. Lydia Elizabeth
  • A. John Prakash
  • V. Rhymend Uthariaraj
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 645)

Abstract

With the proliferation of data and appealing features of cloud storage, a large amount of data are outsourced to the public cloud. To ensure privacy of sensitive data and defend against unauthorized access, data owners encrypt the data. Therefore, it is essential to build efficient and secure searchable encryption techniques. In this paper, we address two problems. Firstly, most of the existing work uses inverted index for faster retrieval; however, inverted index is not inherently dynamic. Secondly, due to a large amount of data and on-demand users, secure and efficient ranked retrieval sorted by relevance is desired especially in the pay-as-you-use cloud model. In this paper, we construct TSED: top-k ranked searchable encryption for secure cloud data storage. TSED uses a dynamic and secure index using homomorphic encryption and efficient ranked retrieval. Performance analysis on real-world dataset shows that TSED is efficient and practical.

Keywords

Cloud security Privacy Top-k ranked search Confidentiality 

References

  1. 1.
    Armbrust, M., Fox, A., Griffith, R., Joseph, A., Katz, R.H.: Above the Clouds: A Berkeley View of Cloud Computing. University of California, Berkeley, Technical report UCB. 07-013 (2009)Google Scholar
  2. 2.
    Naveed, M., Prabhakaran, M., Gunter, C.A.: Dynamic Searchable Encryption via Blind Storage. In: 2014 IEEE Symposium on Security and Privacy, pp. 639–654 (2014)Google Scholar
  3. 3.
    Cash, D., Jaeger, J., Jarecki, S., Jutla, C., Krawczyk, H., Roşu, M.-C., Steiner, M.: Dynamic searchable encryption in very-large databases: data structures and implementation. In: Proceedings of the 2014 Network and Distributed System Security Symposium, pp. 1–32 (2014)Google Scholar
  4. 4.
    Kamara, S., Papamanthou, C., Roeder, T.: Dynamic Searchable Symmetric Encryption, pp. 1–24Google Scholar
  5. 5.
    Zerr, S., Olmedilla, D., Nejdl, W., Siberski, W.: Zerber +R. top-k retrieval from a confidential index. In: Proceedings 12th International Conference on Extending Database Technology. Advances in Database Technology—EDBT ’09, p. 439 (2009)Google Scholar
  6. 6.
    Baldimtsi, F., Ohrimenko, O.: Sorting and Searching Behind the Curtain, pp. 1–25Google Scholar
  7. 7.
    Goldwasser, S., Bellare, M.: Lecture notes on cryptography. Cryptogr. Comput. Secur. 1–289 (2008)Google Scholar
  8. 8.
    Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. Int. Conf. Theory. (1999)Google Scholar
  9. 9.
    Cao, N., Wang, C., Li, M., Ren, K., Lou, W.: Privacy-preserving multi-keyword ranked search over encrypted cloud data. IEEE Trans. Parallel Distrib. Syst. 25, 222–233 (2014)CrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  • B. Lydia Elizabeth
    • 1
  • A. John Prakash
    • 1
  • V. Rhymend Uthariaraj
    • 1
  1. 1.Anna University ChennaiChennaiIndia

Personalised recommendations