ID-based deletion searchable encryption scheme
Abstract
Searchable encryption technology frees up user’s local storage resources and also facilitates user’s search on files in the server. At present, general searchable encryption schemes are merely static searches and cannot dynamically manipulate data already stored in server. In order to solve this problem, this paper proposes a dynamic searchable encryption scheme based on bilinear pairing, which can delete the specified identity file. When delete operation is performed, rights authentication is performed on user who issues delete request, and malicious deletion of illegal users is effectively prevented. At the same time, the security of the scheme is proved. Based on the implementation of delete function, the scheme achieves security against the choose plaintext attack.
- Publication:
-
IOP Conference Series: Earth and Environmental Science
- Pub Date:
- February 2019
- DOI:
- 10.1088/1755-1315/234/1/012052
- Bibcode:
- 2019E&ES..234a2052D