A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
An Efficient KP-ABE with Short Ciphertexts in Prime OrderGroups under Standard Assumption
2017
Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security - ASIA CCS '17
We introduce an efficient Key-Policy Attribute-Based Encryption (KP-ABE) scheme in prime order groups. Our scheme is semi-adaptively secure under the decisional linear assumption and supports a large universe of attributes and multi-use of attributes. Those properties are critical for real applications of KP-ABE schemes since they enable an efficient and flexible access control. Prior to our work, existing KP-ABE schemes with short ciphertexts were in composite order groups or utilized either
doi:10.1145/3052973.3053003
dblp:conf/ccs/KimSGAN17
fatcat:isa5omnwsnekfjwfklyzew3lxy