J4 ›› 2015, Vol. 42 ›› Issue (3): 97-102.doi: 10.3969/j.issn.1001-2400.2015.03.017

• Original Articles • Previous Articles     Next Articles

Efficient attribute-based encryption with hidden access structures

XIE Li;REN Yanli   

  1. (School of Communication and Information Engineering, Shanghai Univ., Shanghai  200444, China)
  • Received:2014-01-08 Online:2015-06-20 Published:2015-07-27
  • Contact: REN Yanli E-mail:renyanli@shu.edu.cn

Abstract:

Currently, Attribute-Based Encryption (ABE) schemes with Hidden Access Structures are proposed in groups of a composite order or only proved selectively secure without random oracles. Using asymmetric pairings, an anonymous ciphertext-policy attribute-based encryption scheme is proposed in a prime order bilinear group in this paper. The scheme is proved fully secure under the standard model based on the asymmetric decisional bilinear Diffie-Hellman (DBDH) assumption. Moreover, it has a constant size private key, a ciphertext and the number of pairing operations. The proposed scheme improves the security and efficiency of ABE schemes with hidden access structures when compared with the ones in groups of a composite order.

Key words: attribute-based encryption, hidden access structures, asymmetry pairings, full security