Journal
INFORMATION SECURITY, ISC 2015
Volume 9290, Issue -, Pages 336-354Publisher
SPRINGER-VERLAG BERLIN
DOI: 10.1007/978-3-319-23318-5_19
Keywords
RABE for circuits; Polynomial size circuits; Multilinear map
Ask authors/readers for more resources
This paper demonstrates new technique for managing revocation in the context of attribute-based encryption (ABE) and presents two selectively secure directly revocable ABE (RABE) constructions supporting decryption policies realizable by polynomial size Boolean circuits of arbitrary fan-out and featuring compactness in the sense that the number of revocation controlling components in ciphertexts and decryption keys are constant. In fact, our RABE schemes are the first to achieve these parameters. Both our constructions utilize multilinear maps. The size of public parameter in our first construction is linear to the maximum number of users supported by the system while in the second construction we reduce it to logarithmic.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available