ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Secure and efficient wildcard search over encrypted data

Chatterjee, S and Kesarwani, M and Modi, J and Mukherjee, S and Parshuram Puria, SK and Shah, A (2020) Secure and efficient wildcard search over encrypted data. In: International Journal of Information Security .

[img] PDF
INT_JOU_INF_SEC_2020.pdf - Published Version
Restricted to Registered users only

Download (3MB) | Request a copy
Official URL: https://dx.doi.org/ 10.1007/s10207-020-00492-w

Abstract

In this work, we investigate the problem of secure wildcard search over encrypted data. The setting comprises of three entities, viz. the data owner, the server and the client. The data owner outsources the encrypted data to the server, who obliviously services the clients� queries. We first analyze efficiency and security of two recent proposals from International Journal of Information Security, called, respectively, the Wei�Reiter (WR) and Hu�Han (HH) protocol. We demonstrate that HH protocol is completely insecure while WR is not scalable for the problem of wildcard search over encrypted data. Our main contribution consists of three protocols, viz. ΠOXT, ΠBS and ΠOTE, to support secure wildcard search over encrypted data. Protocols ΠOXT and ΠBS reduce the problem of secure wildcard search to that of boolean search. The search time in ΠOXT and ΠBS is sub-linear in the number of keywords. ΠOXT and ΠBS do not rule out false positives completely, but our experiment results indicate that the false positive rate of both the protocols is very less. Our third protocol ΠOTE utilizes Oblivious Transfer Extension protocols to achieve linear time wildcard search with no false positive. ΠOXT/ΠBS and ΠOTE can be easily combined to obtain the first construction that addresses the problem of wildcard search in the three-party setting achieving sub-linear search time with no false positives or false negatives. We provide performance analysis based on our prototype implementations to depict the feasibility of our proposed constructions.

Item Type: Journal Article
Publication: International Journal of Information Security
Publisher: Springer
Additional Information: Copy right for this article belongs to Springer
Keywords: Security of data, False positive rates; First constructions; International journals; Performance analysis; Private information retrieval; Prototype implementations; Searchable encryptions; Wildcard search, Cryptography
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 30 Sep 2020 09:49
Last Modified: 30 Sep 2020 09:49
URI: http://eprints.iisc.ac.in/id/eprint/65179

Actions (login required)

View Item View Item