Advances in Cryptology – EUROCRYPT 2010

Volume 6110 of the series Lecture Notes in Computer Science pp 62-91

Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption

  • Allison LewkoAffiliated withUniversity of Texas at Austin
  • , Tatsuaki OkamotoAffiliated withNTT
  • , Amit SahaiAffiliated withUCLA
  • , Katsuyuki TakashimaAffiliated withMitsubishi Electric
  • , Brent WatersAffiliated withUniversity of Texas at Austin


We present two fully secure functional encryption schemes: a fully secure attribute-based encryption (ABE) scheme and a fully secure (attribute-hiding) predicate encryption (PE) scheme for inner-product predicates. In both cases, previous constructions were only proven to be selectively secure. Both results use novel strategies to adapt the dual system encryption methodology introduced by Waters. We construct our ABE scheme in composite order bilinear groups, and prove its security from three static assumptions. Our ABE scheme supports arbitrary monotone access formulas. Our predicate encryption scheme is constructed via a new approach on bilinear pairings using the notion of dual pairing vector spaces proposed by Okamoto and Takashima.