A Secure keyword ordered multiuser searchable encryption framework

Kulvaibhav Kaushik, Vijayaraghavan Varadharajan

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review


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.
Original languageEnglish
Title of host publicationSecurity in Computing and Communications
Subtitle of host publication4th International Symposium, SSCC 2016, Jaipur, India, September 21-24, 2016, Proceedings
EditorsPeter Mueller, Sabu M. Thampi, Md Zakirul Alam Bhuiyan, Ryan Ko, Robin Doss, Jose M. Alcaraz Calero
Place of PublicationSingapore
PublisherSpringer, Springer Nature
Number of pages13
ISBN (Print)9789811027376
Publication statusPublished - 2016
Externally publishedYes
EventInternational Symposium on Security in Computing and Communications (4th : 2016) - Jaipur, India
Duration: 21 Sep 201624 Sep 2016

Publication series

NameCommunications in Computer and Information Science
ISSN (Print)1865-0929


ConferenceInternational Symposium on Security in Computing and Communications (4th : 2016)
CityJaipur, India


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


Dive into the research topics of 'A Secure keyword ordered multiuser searchable encryption framework'. Together they form a unique fingerprint.

Cite this