How Can We Achieve Query Keyword Frequency Analysis in Privacy-Preserving Situations?

Yiming Zhu, Dehua Zhou (), Yuan Li, Beibei Song and Chuansheng Wang
Additional contact information
Yiming Zhu: College of Information Science and Technology/College of Cyber Security, Jinan University, Guangzhou 510632, China
Dehua Zhou: College of Information Science and Technology/College of Cyber Security, Jinan University, Guangzhou 510632, China
Yuan Li: College of Information Science and Technology/College of Cyber Security, Jinan University, Guangzhou 510632, China
Beibei Song: College of Information Science and Technology/College of Cyber Security, Jinan University, Guangzhou 510632, China
Chuansheng Wang: College of Information Science and Technology/College of Cyber Security, Jinan University, Guangzhou 510632, China

Future Internet, 2023, vol. 15, issue 6, 1-21

Abstract: Recently, significant progress has been made in the field of public key encryption with keyword search (PEKS), with a focus on optimizing search methods and improving the security and efficiency of schemes. Keyword frequency analysis is a powerful tool for enhancing retrieval services in explicit databases. However, designing a PEKS scheme that integrates keyword frequency analysis while preserving privacy and security has remained challenging, as it may conflict with some of the security principles of PEKS. In this paper, we propose an innovative scheme that introduces a security deadline to query trapdoors through the use of timestamps. This means that the keywords in the query trapdoor can only be recovered after the security deadline has passed. This approach allows for keyword frequency analysis of query keywords without compromising data privacy and user privacy, while also providing protection against keyword-guessing attacks through the dual-server architecture of our scheme. Moreover, our scheme supports multi-keyword queries in multi-user scenarios and is highly scalable. Finally, we evaluate the computational and communication efficiency of our scheme, demonstrating its feasibility in practical applications.

Keywords: searchable encryption; keyword frequency analysis; multi-keyword search; keyword guessing attacks; multi-user access (search for similar items in EconPapers)
JEL-codes: O3 (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/1999-5903/15/6/197/pdf (application/pdf)
https://www.mdpi.com/1999-5903/15/6/197/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jftint:v:15:y:2023:i:6:p:197-:d:1158817

Access Statistics for this article

Future Internet is currently edited by Ms. Grace You

More articles in Future Internet from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().