ID-based deletion searchable encryption scheme

6th Annual 2018 International Conference on Geo-Spatial Knowledge and Intelligence

Deng, Xiaoyan^1 ; Cheng, Hao^2 ; Sun, Bo^3 ; Ni, Lulin^4 ; Ji, Qingbing^4

Chengdu University of Information Technology, China^1

Beijing Municipal Public Security Bureau, China^2

National Computer Network Emergency Response Technical Team/coordination Center of China, China^3

China Electronics Technology Group Corporation, 30 Group, China^4

关键词: Bilinear pairing;    ID-based;    Plaintext attack;    Searchable encryptions;    Storage resources;   

Others  :  https://iopscience.iop.org/article/10.1088/1755-1315/234/1/012052/pdf
DOI  :  10.1088/1755-1315/234/1/012052

来源: IOP

【 摘 要 】

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.