Title: Multi-key searchable encryption technique for index-based searching

Authors: Putta Srivani; Sirandas Ramachandram; Rangu Sridevi

Addresses: Department of Computer Science and Engineering, Jawaharlal Nehru Technological University, Hyderabad, Telangana, India ' Department of Computer Science and Engineering, Osmania University College of Engineering, Hyderabad, Telangana, India ' Department of Computer Science and Engineering, Jawaharlal Nehru Technological University College of Engineering, Hyderabad, Telangana, India

Abstract: Multi-key searchable encryption scheme enables keyword search on encrypted data with different keys. The scheme is practical to apply for client server applications to achieve data confidentiality and makes the server to perform the search operation on the encrypted data. So far, this algorithm can be implemented for sequential search. This paper presents an improved version of multi-key searchable encryption algorithm implemented for index-based searching and also shows the experimental results of index-based multi key searchable encryption scheme implemented using C and pbc library. This research uses elliptic curve cryptography (ECC) technique for key improving security. This ECC technique contains the sequence of steps for a secure key generation by the user using hash function. Through the use of the hash function in ECC, performance is enhanced for index-based searching. Experimental results show the execution time of an improved version of multi key searchable scheme for index-based search constructed for different elliptic curves. An application is also designed by using new scheme to perform the search on one lakh encrypted collections with Java as front end and MongoDB as back end.

Keywords: encryption; search token; delta; token; client; server; confidentiality; searchable; multi key; index; public key; elliptic curve cryptography.

DOI: 10.1504/IJAIP.2022.123017

International Journal of Advanced Intelligence Paradigms, 2022 Vol.22 No.1/2, pp.84 - 98

Received: 13 Jan 2017
Accepted: 02 Jan 2018
Published online: 23 May 2022 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article