Loading...
Search for:
dynamic-multi-user-searchable-symmetric-encryption
0.005 seconds
Multi-User dynamic searchable symmetric encryption with corrupted participants
, Article IEEE Transactions on Dependable and Secure Computing ; 2021 ; 15455971 (ISSN) ; Wang, Y ; Papadopoulos, D ; Zhang, M ; Jalili, R ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2021
Abstract
We study the problem of multi-user dynamic searchable symmetric encryption (DMUSSE) where a data owner stores its encrypted documents on an untrusted remote server and wishes to selectively allow multiple users to access them by issuing keyword search queries. Specifically, we consider the case where some of the users may be corrupted and colluding with the server to extract additional information about the dataset (beyond what they have access to). We provide the first formal security definition for the dynamic setting as well as forward and backward privacy definitions. We then propose SE, the first provably secure DMUSSE scheme and instantiate it in two versions, one based on oblivious...