Zobraziť v EDS

Less leakage and more precise: Efficient wildcard keyword search over encrypted data

Uložené v:
Podrobná bibliografia
Názov: Less leakage and more precise: Efficient wildcard keyword search over encrypted data
Autori: Yunling Wang, Chenyang Gao, Yifei Huang, Lei Fu, Yong Yu
Zdroj: High-Confidence Computing, Vol 5, Iss 3, Pp 100297- (2025)
Informácie o vydavateľovi: Elsevier, 2025.
Rok vydania: 2025
Zbierka: LCC:Electronic computers. Computer science
Predmety: Symmetric searchable encryption, Wildcard keyword search, Symmetric subset predicate encryption, Electronic computers. Computer science, QA75.5-76.95
Popis: Wildcard searchable encryption allows the server to efficiently perform wildcard-based keyword searches over encrypted data while maintaining data privacy. A promising solution to achieve wildcard SSE is to extract the characteristics of the queried keyword and check the existence based on a membership test structure. However, existing schemes have false positives of character order, that is, the server cannot identify the order between the first and the last wildcard character. Besides, the schemes also suffer from characteristic matching pattern leakage due to the one-by-one membership testing. In this paper, we present the first efficient wildcard SSE scheme to eliminate the false positives of character order and characteristic matching pattern leakage. To this end, we design a novel characteristic extraction technique that enables the client to exact the characteristics of the queried keyword maintaining the order between the first and the last wildcard character. Then, we utilize the primitive of Symmetric Subset Predicate Encryption, which supports checking if one set is a subset of another in one shot to reduce the characteristic matching pattern leakage. Finally, by performing a formal security analysis and implementing the scheme on a real-world database, we demonstrate that the desired security properties are achieved with high performance.
Druh dokumentu: article
Popis súboru: electronic resource
Jazyk: English
ISSN: 2667-2952
Relation: http://www.sciencedirect.com/science/article/pii/S2667295225000017; https://doaj.org/toc/2667-2952
DOI: 10.1016/j.hcc.2025.100297
Prístupová URL adresa: https://doaj.org/article/9927745d9b2d42fe9ce3c8e1a5221988
Prístupové číslo: edsdoj.9927745d9b2d42fe9ce3c8e1a5221988
Databáza: Directory of Open Access Journals
Popis
Abstrakt:Wildcard searchable encryption allows the server to efficiently perform wildcard-based keyword searches over encrypted data while maintaining data privacy. A promising solution to achieve wildcard SSE is to extract the characteristics of the queried keyword and check the existence based on a membership test structure. However, existing schemes have false positives of character order, that is, the server cannot identify the order between the first and the last wildcard character. Besides, the schemes also suffer from characteristic matching pattern leakage due to the one-by-one membership testing. In this paper, we present the first efficient wildcard SSE scheme to eliminate the false positives of character order and characteristic matching pattern leakage. To this end, we design a novel characteristic extraction technique that enables the client to exact the characteristics of the queried keyword maintaining the order between the first and the last wildcard character. Then, we utilize the primitive of Symmetric Subset Predicate Encryption, which supports checking if one set is a subset of another in one shot to reduce the characteristic matching pattern leakage. Finally, by performing a formal security analysis and implementing the scheme on a real-world database, we demonstrate that the desired security properties are achieved with high performance.
ISSN:26672952
DOI:10.1016/j.hcc.2025.100297