Decentralized Multiauthority KP-ABE Scheme Without Bilinear Pairings

Miao Wang, Zhenfu Cao, Xiaolei Dong, Runmeng Du, Jiasheng Chen

Abstract: In the distributed computing environment, it is important to efficiently achieve secure access to data. One of the widely applied encryption mechanisms is the multiauthority attribute-based encryption (ABE). However, most existing multiauthority setting schemes were relied on bilinear pairings, which causes the system to bear a relatively large burden in computation overhead. In this article, we proposes a decentralized multiauthority key-policy ABE scheme without bilinear pairings, its security is relied solely on the decisional Diffie-Hellman assumption. It removes the trusted central authority and prevents user collusion attacks. Except for the global coordination between the attribute authorities, any party can simply play the part of a standard attribute authority by generating public keys and issuing corresponding decryption key components for users. The proposed scheme provides heightened security and efficiency compared to the current pairing-free multiauthority ABE scheme, as well as superior computational efficiency when compared to those utilizing bilinear pairings.