Unbounded HIBE and attribute-based encryption

282Citations
Citations of this article
92Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this work, we present HIBE and ABE schemes which are "unbounded" in the sense that the public parameters do not impose additional limitations on the functionality of the systems. In all previous constructions of HIBE in the standard model, a maximum hierarchy depth had to be fixed at setup. In all previous constructions of ABE in the standard model, either a small universe size or a bound on the size of attribute sets had to be fixed at setup. Our constructions avoid these limitations. We use a nested dual system encryption argument to prove full security for our HIBE scheme and selective security for our ABE scheme, both in the standard model and relying on static assumptions. Our ABE scheme supports LSSS matrices as access structures and also provides delegation capabilities to users. © 2011 International Association for Cryptologic Research.

Cite

CITATION STYLE

APA

Lewko, A., & Waters, B. (2011). Unbounded HIBE and attribute-based encryption. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6632 LNCS, pp. 547–567). https://doi.org/10.1007/978-3-642-20465-4_30

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