Achieving Pattern Hidden Symmetric Searchable Encryption Based on Oblivious Polynomial Evaluation

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper proposes a symmetric searchable encryption scheme that hides both search pattern and access pattern. The protocol allows users to obtain correct search results on ciphertexts without leaking privacy. We introduce an efficient and secure Oblivious polynomial evaluation protocol (ESOPE) to achieve pattern hiding. Compared to existing schemes, our approach eliminates the need for auxiliary participants, thereby reducing the risk of privacy breaches. Moreover, our protocol demonstrates significant improvements in both time efficiency and storage efficiency across datasets of various sizes.

Original languageEnglish
Title of host publicationProceedings of 2024 2nd International Conference on Artificial Intelligence, Systems and Network Security, AISNS 2024
PublisherAssociation for Computing Machinery, Inc
Pages314-318
Number of pages5
ISBN (Electronic)9798400711237
DOIs
StatePublished - 6 Mar 2025
Event2nd International Conference on Artificial Intelligence, Systems and Network Security, AISNS 2024 - Mianyang, China
Duration: 20 Dec 202422 Dec 2024

Publication series

NameProceedings of 2024 2nd International Conference on Artificial Intelligence, Systems and Network Security, AISNS 2024

Conference

Conference2nd International Conference on Artificial Intelligence, Systems and Network Security, AISNS 2024
Country/TerritoryChina
CityMianyang
Period20/12/2422/12/24

Keywords

  • Access pattern
  • Oblivious polynomial evaluation
  • Search Pattern
  • Searchable Encryption

Fingerprint

Dive into the research topics of 'Achieving Pattern Hidden Symmetric Searchable Encryption Based on Oblivious Polynomial Evaluation'. Together they form a unique fingerprint.

Cite this