Efficient Revocable Attribute-Based Encryption with Hidden Policies

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We present a novel Ciphertext-Policy Attribute- Based Encryption (CP-ABE) scheme, which bridges the gap between highly dynamic (industrial) environments and resource- constrained devices. Our construction combines outsourced- decryption, hidden policies and revocation, to cope with the requirements posed by such environments. In contrast to existing schemes, which typically rely on composite order bilinear groups, we present a scheme in prime order groups. The resulting scheme is more efficient as it relies on smaller group orders. We prove our scheme secure under the Symmetric External Diffie-Hellman (SXDH) assumption. Lastly, we compare our scheme against existing schemes and provide timing results of our software implementation. Our evaluation shows that the proposed scheme is flexible enough for the targeted environment while improving performance by an order of magnitude.
Original languageEnglish
Title of host publication2020 19th IEEE International Conference On Trust, Security And Privacy In Computing And Communications/14th IEEE International Conference On Big Data Science And Engineering (TrustCom/BigDataSE)
Number of pages8
Publication statusAccepted/In press - 1 Dec 2020
EventThe 19th IEEE International Conference on Trust, Security and Privacy in Computing and Communications - Guangdong Hotel, Hybrider Event, China
Duration: 29 Dec 20201 Jan 2021
http://ieee-trustcom.org/TrustCom2020/

Conference

ConferenceThe 19th IEEE International Conference on Trust, Security and Privacy in Computing and Communications
Abbreviated titleIEEE TrustCom 2020
CountryChina
CityHybrider Event
Period29/12/201/01/21
Internet address

Fingerprint Dive into the research topics of 'Efficient Revocable Attribute-Based Encryption with Hidden Policies'. Together they form a unique fingerprint.

Cite this