.png){kind=icon}
.png){kind=icon}
Return
Multi-Client Cloud-Based Symmetric Searchable Encryption
.png){kind=icon}
PRE
AI
DOI：10.1109/TDSC.2019.2950934.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a multi-client Symmetric Searchable Encryption (SSE) scheme based on the single-user protocol [3]. The scheme allows any user to generate a search query by interacting with any theta - 1 (theta is a threshold parameter) 'helping' users. It preserves the privacy of a database content against the server assuming a leakage of up to theta - 1 users' keys to the server while hiding the query from the theta - 1 'helping users'. To achieve the query privacy, we design a new distributed key-homomorphic pseudorandom function (PRF) that hides the PRF input (search keyword) from the 'helping' users. We present a concrete construction of our randomizable distributed PRF. By distributing the utilized keys among the users, the need for a constant online presence of the data owner to provide services to the users is eliminated, while providing resilience against a user key exposure. We extended our scheme to support user revocation in two different scenarios. In addition, we give a solution for fast update of the encryption key with the overhead significantly smaller than the re-encryption and re-uploading the database. Moreover, our scheme is secure against passive and active collusion between the server and a subset of users.
Keywords:
Multi-client
cloud storage
searchable encryption
query privacy
revocation
re-encryption
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
2.4K
Citations:
9.6K