Searchable Encryption Scheme on the Cloud via Fully Homomorphic Encryption
Jian Liu, Jing-Li Han, Zhaoli Wang
Abstract
Jian Liu, Jing-Li Han, Zhaoli Wang
Abstract
We constructed a new secure searchable encryption scheme aided by a computationally powerful but untrusted cloud server. Our scheme allows a client to provide a single search token to the server, but still allows the server to search for that token's word over all the documents he can access that encrypted with different keys. We achieved the scheme using multikey fully homomorphic encryption (MFHE) which is capable of operating on inputs encrypted under multiple, unrelated keys. Based on this, we extended the scheme to multiple keyword searching.
OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We constructed a new secure searchable encryption scheme aided by a computationally powerful but untrusted cloud server. Our scheme allows a client to provide a single search token to the server, but still allows the server to search for that token's word over all the documents he can access that encrypted with different keys. We achieved the scheme using multikey fully homomorphic encryption (MFHE) which is capable of operating on inputs encrypted under multiple, unrelated keys. Based on this, we extended the scheme to multiple keyword searching.
Key concepts: Computer science, Encryption, Homomorphic encryption, Security token, Filesystem-level encryption, Scheme (mathematics), On-the-fly encryption, Multiple encryption