Revocable key aggregate searchable encryption with user privacy and anonymity
by Mukti Padhya; Devesh C. Jinwala
International Journal of Information and Computer Security (IJICS), Vol. 19, No. 1/2, 2022

Abstract: The KASE schemes allow fine-grained delegation of search rights over a selected dataset using an aggregate key. However, when the existing KASE schemes are deployed in real-time applications, the support of revocation of delegated rights is highly required to manage users' access control. Therefore, in this paper we propose two solutions for the fine-grained revocation of delegated rights considering two different scenarios. First, we present a basic scheme that supports fine-grained revocation of the delegated rights on document level, instead of coarse-grained all-or-nothing access. Then, the user is not allowed to search the document by the old trapdoor if his search privileges are revoked on that document. Under a multi-user setting, we propose an advance scheme that can make the fine-grained revocation of the delegated rights on the user level. The proposed approaches also preserve users' privacy and anonymity. We present the schemes' correctness proof, formal security analysis, and performance analysis, which confirm that they are provably secure and practically efficient.

Online publication date: Fri, 04-Nov-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Computer Security (IJICS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com