Research Article
A Searchable Encryption Method Supporting Result Grouping and Sorting
@INPROCEEDINGS{10.1007/978-3-030-94554-1_12, author={HaiYang Peng and GuiShan Dong and Hao Yao and Yue Zhao and YuXiang Chen}, title={A Searchable Encryption Method Supporting Result Grouping and Sorting}, proceedings={Advanced Hybrid Information Processing. 5th EAI International Conference, ADHIP 2021, Virtual Event, October 22-24, 2021, Proceedings, Part II}, proceedings_a={ADHIP PART 2}, year={2022}, month={1}, keywords={Searchable encryption Packet sorting Bilinear pairing}, doi={10.1007/978-3-030-94554-1_12} }- HaiYang Peng
GuiShan Dong
Hao Yao
Yue Zhao
YuXiang Chen
Year: 2022
A Searchable Encryption Method Supporting Result Grouping and Sorting
ADHIP PART 2
Springer
DOI: 10.1007/978-3-030-94554-1_12
Abstract
Aiming at the problem of low search efficiency caused by general searchable encryption schemes that do not sort search results during the search process, we propose a method to support grouping and sorting search results. This method uses the adjacent index structure as the basis, uploads the keywords corresponding to the file to the cloud server in order, and records the upload sequence of each keyword in the file, and stores the upload sequence in the index structure. The index is stored in the form of keyword-keyword sequence number-file address pointer. When the data user performs a keyword search, the keywords on the index are first matched, and then the results are grouped in the form of keyword serial number-file, and the search results are grouped and sorted according to the keyword serial number and returned to the user. The scheme proves the safety of the scheme through the method of bilinear difficulty analysis. At the same time, the scheme can support operations such as index update and deletion, and is easy to maintain.
