Secure and efficient wildcard search over encrypted data

Chatterjee, Sanjit; Kesarwani, Manish; Modi, Jayam; Mukherjee, Sayantan; Puria, Shravan Kumar Parshuram; Shah, Akash

doi:10.1007/s10207-020-00492-w

Cited by 6 publications

(3 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[9][10][11][12] The wildcard searchable encryption has been an attractive topic for many years since it not only can facilitate the users in mentioned scene but also be suitable to the era of big data since the overwhelming volumes of outsourced encrypted data brings users the problem of remembering the exactly keywords. Many researchers contributed to this study by using homomorphic encryption, 9,13 hidden vector encryption (HVE), 12 proxy middle ware or servers, [14][15][16] secure multiparty computing, [17][18][19] and bloom filter. 10,11,20 We mainly concentrate on the symmetric wildcard search encryption because of its efficiency.…”

Section: Introductionmentioning

confidence: 99%

“…Hua et al 15 rewrote the query with the help of a proxy middleware. Chatterjee et al 19 used boolean search protocol

Π_{O X T}

and

Π_{B S}

to reduce the problem of secure wildcard search to that of boolean search. More studies related wildcard can be found in [15,16,24,25].…”

Section: Introductionmentioning

confidence: 99%

“…In the study of Zhao and Nishide, 23 the model they defined does not distinguish the keyword and the keyword/token characteristic set that may leak more information. As for the model followed the IND‐CKA, 10 it was demonstrate to be completely insecure in the work of Chatterjee et al 19 …”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Practical wildcard searchable encryption with tree‐based index

Zhang

Zhao

Qin

et al. 2021

Int J of Intelligent Sys

View full text Add to dashboard Cite

Wildcard searchable encryption is an advanced variant of searchable encryption that can simultaneously maintain the searchability and confidentiality of the encrypted data. The wildcard searchable encryption outperforms the standard one for the fact that the users can use it to search the desired data even with the inexact keywords. Considering the millisecond level response time in the era of 5G, there are higher demands on the efficiency and accuracy that may be a pair of contradictions in wildcard searchable encryption. To improve the efficiency without sacrificing the accuracy, we put forward a novel scheme, tree-based index scheme (TBIS), through filtering the search results step by step instead of enumeration in the prior works and in the instantiation of TBIS, the search time drops sharply to the millisecond level. By using more kinds of characters, the accuracy of search result is improved visibly. TBIS achieves nonadaptive security that is indistinguishable against chosen character set attacks proposed in this paper. The security criteria can capture the relationship among characters, keywords and documents. At last, we put forward a frame structure in machine learning as an application of the proposed scheme.Abbreviations: IND-CCSA, indistinguishability against chosen character set attacks; TBIS, tree-based index scheme.

show abstract