Advertisement

A Secure Keyword Ordered Multiuser Searchable Encryption Framework

  • Kulvaibhav KaushikEmail author
  • Vijayaraghavan Varadharajan
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 625)

Abstract

Recent trends in information technology have triggered the shift in various sectors from traditional methods of operation and data management to web based solutions. Cloud computing provides the best alternative, providing storage as a service and ensures efficient data operations. Data outsourcing reduces high cost and increases efficiency but it is vulnerable to leakage and manipulation hence rendering it unusable for most of the practical applications. Data encryption makes it safe but limits the scope for search and multiuser access. The model proposed supports efficient data encryption and search over the encrypted data by legitimate users and facilitates multiuser access to the data. Multiuser searchable encryption allows multiple users to access the data in both read and write mode with their distinct keys and facilitates addition and re-invocation of users with less overhead. The proposed scheme is based on encryption of data, keyword generation and search based on bilinear pairing. The system provides a proxy server which manipulates user queries making the system faster and more secure. The search is performed on keyword ordered list which makes the search faster as compared to the traditional methods of comparing trapdoor with keywords associated with the different files.

Keywords

Multiuser searchable encryption Keyword ordering Proxy server Bilinear pairing Discrete log problem 

References

  1. 1.
    Boneh, D., Franklin, M.: Identity-Based Encryption from the Weil Pairing. SIAM J. of Computing 32(3), 586–615 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Certicom Research: Standards for Efficient Crpytography Group (SECG) – SEC 1: Elliptic Curve Cryptography. Version 1.0, 20 September 2000. http://www.secg.org/secg_docs.htm
  3. 3.
    Meffert, D.: Bilinear pairings in cryptography. Master’s thesis, Radboud Universiteit Nijmegen (2009)Google Scholar
  4. 4.
    Studholme, C.: The discrete log problem. Research paper requirement (milestone) of the Ph.D. program at the University of Toronto, June 2002Google Scholar
  5. 5.
    Menezes, A.: Evaluation of security level of cryptography: the Elliptic Curve Discrete Logarithm Problem (ECDLP), University of Waterloo (2001)Google Scholar
  6. 6.
    Galbraith, S., Hess, F., Vercauteren, F.: Aspects of pairing inversion. IEEE Transactions on Information Theory 54, 5719–5728 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Kamara, S., Lauter, K.: Cryptographic cloud storage. In: Proceedings of Financial Cryptography: Workshop on Real-Life Cryptographic Protocols and Standardization, January 2010Google Scholar
  8. 8.
    Dong, C., Russello, G., Dulay, N.: Shared and searchable encrypted data for untrusted servers. J. Comput. Secur. 19(3), 367–397 (2011)Google Scholar
  9. 9.
    Yang, Y.J., Ding, X.H., Deng, R.H., Bao, F.: Multi-user private queries over encrypted databases. Int J High Perform. Comput. Netw. 1(1/2/3), 64–074 (2008)MathSciNetGoogle Scholar
  10. 10.
    Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: The Proceedings of the 2012 ACM conference on Computer and communications security. ACM (2012)Google Scholar
  11. 11.
    Raso Mattos, L.R., Varadharajan, V., Nallusamy, R.: Data protection and privacy preservation using searchable encryption on outsourced databases. In: Thampi, S.M., Zomaya, A.Y., Strufe, T., Alcaraz Calero, J.M., Thomas, T. (eds.) SNDS 2012. CCIS, vol. 335, pp. 178–184. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  12. 12.
    Varadharajan, V., Mani, R., Nallusamy, R.: Anonymous searchable encryption scheme for multi-user databases. In: Proceedings of the 2013 IEEE International Conference on Cloud Engineering, pp. 225–232Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2016

Authors and Affiliations

  • Kulvaibhav Kaushik
    • 1
    Email author
  • Vijayaraghavan Varadharajan
    • 1
  1. 1.Infosys Ltd.BengaluruIndia

Personalised recommendations