In view of the expiration or reveal of user’s private credential (or private key) in a realistic scenario, identity-based encryption (IBE) schemes with an efficient key revocation mechanism, or for short, revocable identity-based encryption (RIBE) schemes, become prominently significant. In this paper, we present an RIBE scheme from lattices by combining two Agrawal et al.’s IBE schemes with the subset difference (SD) method. Our scheme is secure against adaptive identity-time attacks in the standard model under the learning with errors (LWE) assumption. In particular, our scheme serves as one solution to the challenge posed by Chen et al. (ACISP’12).
CITATION STYLE
Cheng, S., & Zhang, J. (2015). Adaptive-ID secure revocable identity-based encryption from lattices via subset difference method. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9065, pp. 283–297). Springer Verlag. https://doi.org/10.1007/978-3-319-17533-1_20
Mendeley helps you to discover research relevant for your work.