Efficient verifiable searchable encryption with search and access pattern privacy
Searchable encryption (SE) enables data users to securely search encrypted data stored in untrusted cloud servers. However, most SE schemes allow for leakages of access and search patterns to maximize efficiency and functionality. Recent attacks have shown that adversaries can recover query keywords...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
EDP Sciences
2025-01-01
|
| Series: | Security and Safety |
| Subjects: | |
| Online Access: | https://sands.edpsciences.org/articles/sands/full_html/2025/01/sands20240027/sands20240027.html |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849705487079047168 |
|---|---|
| author | Wu Axin Feng Dengguo Zhang Min Chi Jialin Zhang Yinghui |
| author_facet | Wu Axin Feng Dengguo Zhang Min Chi Jialin Zhang Yinghui |
| author_sort | Wu Axin |
| collection | DOAJ |
| description | Searchable encryption (SE) enables data users to securely search encrypted data stored in untrusted cloud servers. However, most SE schemes allow for leakages of access and search patterns to maximize efficiency and functionality. Recent attacks have shown that adversaries can recover query keywords with prior knowledge of the database by exploiting these leakages. Unfortunately, the existing schemes that protect access and search patterns result in frequent communications and high computational costs. Furthermore, complex calculation processes also raise challenges for verifying search results. To address these concerns, we first design an efficient conjunctive SE scheme with search and access pattern privacy using private set intersection. In the proposed scheme, we utilize random numbers to obfuscate the values of polynomials and randomly divide the results into two parts, which simplifies the search process, improves search efficiency, and eliminates the need for time-consuming ciphertext multiplication operations. We also extend this scheme to support search result verifiability. Specifically, by embedding a random number as the root of the return polynomial, we achieve verifiability of search results. Furthermore, we prove the security of both schemes employing the simulation-based method. Finally, we implement the schemes in a real database and thorough performance analyses demonstrate their efficiency. |
| format | Article |
| id | doaj-art-70e7cd0f65a344a9a4d9e1ce83ea1fef |
| institution | DOAJ |
| issn | 2826-1275 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | EDP Sciences |
| record_format | Article |
| series | Security and Safety |
| spelling | doaj-art-70e7cd0f65a344a9a4d9e1ce83ea1fef2025-08-20T03:16:28ZengEDP SciencesSecurity and Safety2826-12752025-01-014202402210.1051/sands/2024022sands20240027Efficient verifiable searchable encryption with search and access pattern privacyWu Axin0Feng Dengguo1Zhang Min2https://orcid.org/0009-0006-4415-3676Chi Jialin3Zhang Yinghui4https://orcid.org/0000-0002-5764-3272State Key Laboratory of CryptologyState Key Laboratory of CryptologyTCA Laboratory, Institute of Software, Chinese Academy of SciencesTCA Laboratory, Institute of Software, Chinese Academy of SciencesNational Engineering Research Center for Secured Wireless (NERCSW), School of Cyberspace Security, Xi’an University of Posts & TelecommunicationsSearchable encryption (SE) enables data users to securely search encrypted data stored in untrusted cloud servers. However, most SE schemes allow for leakages of access and search patterns to maximize efficiency and functionality. Recent attacks have shown that adversaries can recover query keywords with prior knowledge of the database by exploiting these leakages. Unfortunately, the existing schemes that protect access and search patterns result in frequent communications and high computational costs. Furthermore, complex calculation processes also raise challenges for verifying search results. To address these concerns, we first design an efficient conjunctive SE scheme with search and access pattern privacy using private set intersection. In the proposed scheme, we utilize random numbers to obfuscate the values of polynomials and randomly divide the results into two parts, which simplifies the search process, improves search efficiency, and eliminates the need for time-consuming ciphertext multiplication operations. We also extend this scheme to support search result verifiability. Specifically, by embedding a random number as the root of the return polynomial, we achieve verifiability of search results. Furthermore, we prove the security of both schemes employing the simulation-based method. Finally, we implement the schemes in a real database and thorough performance analyses demonstrate their efficiency.https://sands.edpsciences.org/articles/sands/full_html/2025/01/sands20240027/sands20240027.htmlsearchable encryptionprivate set intersectionsearch and access patternverifiabilityconjunctive search |
| spellingShingle | Wu Axin Feng Dengguo Zhang Min Chi Jialin Zhang Yinghui Efficient verifiable searchable encryption with search and access pattern privacy Security and Safety searchable encryption private set intersection search and access pattern verifiability conjunctive search |
| title | Efficient verifiable searchable encryption with search and access pattern privacy |
| title_full | Efficient verifiable searchable encryption with search and access pattern privacy |
| title_fullStr | Efficient verifiable searchable encryption with search and access pattern privacy |
| title_full_unstemmed | Efficient verifiable searchable encryption with search and access pattern privacy |
| title_short | Efficient verifiable searchable encryption with search and access pattern privacy |
| title_sort | efficient verifiable searchable encryption with search and access pattern privacy |
| topic | searchable encryption private set intersection search and access pattern verifiability conjunctive search |
| url | https://sands.edpsciences.org/articles/sands/full_html/2025/01/sands20240027/sands20240027.html |
| work_keys_str_mv | AT wuaxin efficientverifiablesearchableencryptionwithsearchandaccesspatternprivacy AT fengdengguo efficientverifiablesearchableencryptionwithsearchandaccesspatternprivacy AT zhangmin efficientverifiablesearchableencryptionwithsearchandaccesspatternprivacy AT chijialin efficientverifiablesearchableencryptionwithsearchandaccesspatternprivacy AT zhangyinghui efficientverifiablesearchableencryptionwithsearchandaccesspatternprivacy |