Publication Type

Journal Article

Version

acceptedVersion

Publication Date

10-2023

Abstract

Symmetric Searchable Encryption (SSE), as an ideal primitive, can ensure data privacy while supporting retrieval over encrypted data. However, existing multi-user SSE schemes require the data owner to share the secret key with all query users or always be online to generate search tokens. While there are some solutions to this problem, they have at least one weakness, such as non-supporting conjunctive query, result decryption assistance of the data owner, and unauthorized access. To solve the above issues, we propose an Owner-free Distributed Symmetric searchable encryption supporting Conjunctive query (ODiSC). Specifically, we first evaluate the Learning-Parity-with-Noise weak Pseudorandom Function (LPN-wPRF) in dual-cloud architecture to generate search tokens with the data owner free from sharing key and being online. Then, we provide fine-grained conjunctive query in the distributed architecture using additive secret sharing and symmetric-key hidden vector encryption. Finally, formal security analysis and empirical performance evaluation demonstrate that ODiSC is adaptively simulation-secure and efficient.

Keywords

conjunctive query, dual-cloud architecture, multi-user, Symmetric searchable encryption

Discipline

Data Storage Systems | Information Security

Research Areas

Cybersecurity

Publication

Transactions on Storage

Volume

19

Issue

4

First Page

1

Last Page

25

ISSN

1553-3077

Identifier

10.1145/3607255

Publisher

Association for Computing Machinery (ACM)

Copyright Owner and License

Authors

Additional URL

https://doi.org/10.1145/3607255

Download

Share

COinS