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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IOP Conference Series: Earth and Environmental Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.