arrow
Return

A searchable encryption scheme with hidden search pattern and access pattern on distributed cloud system

delete2023-05-25
delete1
delete
OA
AI
S
Shengchen Duan
H
Hong Liu *
L
Lize Gu
DOI:10.1007/s12083-023-01488-8delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Dynamic searchable encryption methods allow a client to perform searches and updates over encrypted data stored in the cloud. Recent schemes enable secure searching over an encrypted database stored in a server, but these schemes only focus on hiding the access pattern using ORAM. Although the traditional Oblivious Random Access Machine ( ORAM) can hide the access pattern, which refers to the set of documents that match the client's queries, it also incurs significant communication overhead and cannot hide the search pattern. Existing researches show that the general dynamic searchable symmetric encryption (DSSE) scheme is vulnerable to statistical attacks due to the leakage of both search patterns and access patterns. Therefore hiding the access pattern is not enough, it is essential to hide both access patterns and search patterns with high efficiency. To overcome this limitation, a DSSE scheme called obliviously shuffled incidence matrix DSSE (OSM-DSSE) is proposed in this paper to access the encrypted data obliviously without using ORAM. The OSM- DSSE scheme realizes efficient search and update operations based on an incidence matrix. In particular, a shuffling algorithm using Paillier encryption combines the 1- out-of-n obliviously transfer (OT) protocol to hide access pattern and an optimized padding scheme to obfuscate the search pattern with low storage overhead. Besides, Simulation results and security analysis confirm that OSMDSSE scheme achieves high security and efficient searches. Also, this scheme provides adaptive security against malicious attacks by adversaries. Furthermore, OSM-DSSE is capable of searching for a keyword out of 9 x 1010 keyword-file pairs within 2.19 s which is 3-4 x better execution efficiency than the state-of-art solutions.
Keywords:
Dynamic searchable encryption center dot Search pattern center dot Access pattern center dot Paillier encryption center dot Optimised padding

Journal

Peer-to-Peer Networking and Applications cover
Peer-to-Peer Networking and Applications
IF:
2.6
Papers:
2.2K
Citations:
2.9K

Organization

B
beijing university of posts & telecommunications
Scholars:
1.4W
Papers: 1.2W
Citations: 9
C
chongqing university of posts & telecommunications
Scholars:
6.7K
Papers: 5.3K
Citations: 5