Abstract

Decentralized attribute-based encryption (ABE) is a special form of multiauthority ABE systems, in which no central authority and global coordination are required other than creating the common reference parameters. In this paper, we propose a new decentralized ABE in prime-order groups by using extended dual system groups. We formulate some assumptions used to prove the security of our scheme. Our proposed scheme is fully secure under the standard k-Lin assumption in random oracle model and can support any monotone access structures. Compared with existing fully secure decentralized ABE systems, our construction has shorter ciphertexts and secret keys. Moreover, fast decryption is achieved in our system, in which ciphertexts can be decrypted with a constant number of pairings.

Highlights

  • Attribute-based encryption (ABE), which enables finegrained access control, was first introduced by Sahai and Waters [1]

  • In key-policy ABE (KP-ABE), ciphertexts are associated with a set of attributes and secret keys are associated with access policies, while the opposite is true for ciphertext-policy attribute-based encryption (CP-ABE)

  • We present a new construction of decentralized ABE by using extended dual system group (EDSG)

Read more

Summary

Introduction

Attribute-based encryption (ABE), which enables finegrained access control, was first introduced by Sahai and Waters [1]. The classical ABE system has only a single authority, which manages all attributes and issues private keys for all users. This may be unable to meet the requirements of some applications due to the lack of flexibility. Though the Lewko-Waters decentralized ABE scheme is expressive, the construction is based on composite-order bilinear group. In a subsequent work by Okamoto and Takashima [13], a decentralized ABE system on prime-order groups was presented by using dual pairing vector spaces [5]. Our proposed scheme is built on prime-order groups with better space and time efficiency and can be proved fully secure under standard k-Lin assumption in the random oracle model.

Related Works
Prime-Order Bilinear Groups and Computational Assumptions
Multiauthority CP-ABE
Instantiating EDSG
Our Scheme
Construction
Findings
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call