Verifiable Public Key Encryption With Keyword Search Based on Homomorphic Encryption in Multi-User Setting
Data security and privacy concerns are important issues in cloud storage. In this paper, we propose a verifiable public key encryption with keyword search based on homomorphic encryption in multi-user setting. By employing van Dijk, Gentry, Halevi, and Vaikuntanathan homomorphic encryption, the prop...
Main Authors: | D. N. Wu, Q. Q. Gan, X. M. Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2018-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8423613/ |
Similar Items
-
A framework for searching encrypted databases
by: Pedro G. M. R. Alves, et al.
Published: (2018-01-01) -
An Efficient Two-Server Ranked Dynamic Searchable Encryption Scheme
by: Yuxi Li, et al.
Published: (2020-01-01) -
Improving the Efficiency of Homomorphic Encryption Schemes
by: Hu, Yin
Published: (2013) -
Towards practical fully homomorphic encryption
by: Alperin-Sheriff, Jacob
Published: (2015) -
Searchable Public Key Encryption Supporting Semantic Multi-Keywords Search
by: Yu Zhang, et al.
Published: (2019-01-01)