Efficient adaptively secure public-key trace and revoke from subset cover using Déjá Q framework

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We provide an efficient and secure construction for the trace and revoke from subset cover (TRSC) systems in the public-key setting, having ciphertext size proportional to the number of revoked users and public parameter of constant size. The system is obtained by tweaking the identity based encryption scheme of Wee (TCC 2016) under the subset cover framework. Existing TRSC constructions are inefficient with respect to the size of the parameters and derive their security from the q-type assumptions in the random oracle model. Our construction is the first adaptively secure TRSC system to achieve such parameters without using any random oracles. In addition, we are able to eliminate the q-type assumptions by integrating the Déjá Q framework of Chase and Meiklejohn (EUROCRYPT 2014) and its extension by Wee (TCC 2016) in our construction and analyze its security under the hardness of static subgroup decision problems over bilinear group setting. Moreover, this is the first proposal to feature optimally short private keys, even in the standard security model without any security breach.

Cite

CITATION STYLE

APA

Mandal, M., & Dutta, R. (2019). Efficient adaptively secure public-key trace and revoke from subset cover using Déjá Q framework. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11449 LNCS, pp. 468–489). Springer Verlag. https://doi.org/10.1007/978-3-030-14234-6_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free