Inverted Index Based Ranked Keyword Search in Multi-user Searchable Encryption

  • Manju S. NairEmail author
  • M. S. Rajasree
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 969)


Cloud storage is a promising technology for large scale data storage. Searchable encryption protocols are developed to securely store and efficiently retrieve encrypted data stored in cloud without revealing any sensitive information. As data grows faster, even search schemes requiring linear time are not feasible to handle big data. We propose a sub-linear search scheme using inverted index supporting fine grained search control to multiple users. The documents are ranked to return the most relevant results and to reduce the communication cost. The scheme hides the document-ids and access patten from the cloud provider and proves the security.


Searchable encryption Inverted index Blind storage 


  1. 1.
    Akinyele, J.A., et al.: Charm: a framework for rapidly prototyping cryptosystems. J. Cryptogr. Eng. 3(2), 111–128 (2013). 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). Scholar
  3. 3.
    Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. SIAM J. Comput. 32(3), 586–615 (2003)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Chang, Y.-C., Mitzenmacher, M.: Privacy preserving keyword searches on remote encrypted data. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 442–455. Springer, Heidelberg (2005). Scholar
  5. 5.
    Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. J. Comput. Secur. 19(5), 895–934 (2011)CrossRefGoogle Scholar
  6. 6.
    Gentry, C., Halevi, S.: Implementing gentry’s fully-homomorphic encryption scheme. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 129–148. Springer, Heidelberg (2011). Scholar
  7. 7.
    Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious rams. J. ACM (JACM) 43(3), 431–473 (1996)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security, pp. 965–976. ACM (2012)Google Scholar
  9. 9.
    Lynn, B.: PBC Library (2006).
  10. 10.
    Naveed, M., Prabhakaran, M., Gunter, C., et al.: Dynamic searchable encryption via blind storage. In: 2014 IEEE Symposium on Security and Privacy (SP), pp. 639–654. IEEE (2014)Google Scholar
  11. 11.
    Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: Proceedings of the 2000 IEEE Symposium on Security and Privacy, S&P 2000, pp. 44–55. IEEE (2000)Google Scholar
  12. 12.
    Wang, B., Song, W., Lou, W., Hou, Y.T.: Inverted index based multi-keyword public-key searchable encryption with strong privacy guarantee. In: 2015 IEEE Conference on Computer Communications (INFOCOM), pp. 2092–2100. IEEE (2015)Google Scholar
  13. 13.
    Wang, C., Cao, N., Li, J., Ren, K., Lou, W.: Secure ranked keyword search over encrypted cloud data. In: 2010 IEEE 30th International Conference on Distributed Computing Systems (ICDCS), pp. 253–262. IEEE (2010)Google Scholar
  14. 14.
    Wu, D.J.: Fully homomorphic encryption: cryptography’s holy grail. XRDS Crossroads ACM Mag. Students 21(3), 24–29 (2015)CrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.College of EngineeringTrivandrumIndia
  2. 2.Government Engineering CollegeTrivandrumIndia

Personalised recommendations