In this paper we introduce FS to the powerful setting of \emph{Hierarchical Predicate Encryption (HPE)}, proposed by Okamoto and Takashima (Asiacrypt 2009). Anticipated applications of FS-HPE schemes can be found in searchable encryption and in fully private communication. Considering the dependencies amongst the concepts, our FS-HPE scheme implies forward-secure flavors of Predicate Encryption and (Hierarchical) Attribute-Based Encryption.\smallskip
Our FS-HPE scheme guarantees forward security for plaintexts and for attributes that are hidden in HPE ciphertexts. It further allows delegation of decrypting abilities at any point in time, independent of FS time evolution. It realizes zero-inner-product predicates and is proven adaptively secure under standard assumptions. As the ``cross-product" approach taken in FS-HIBE is not directly applicable to the HPE setting, our construction resorts to techniques that are specific to existing HPE schemes and extends them with what can be seen as a reminiscent of binary tree encryption from FS-PKE.
Category / Keywords: public-key cryptography / forward security, predicate-based encryption, attribute-based encryption Publication Info: Proceedings of the 5th International Conference on Pairing-Based Cryptography (Pairing 2012). Date: received 17 Jul 2012 Contact author: j gonzaleznieto at qut edu au, mark@manulis eu, dd sun@student qut edu au Available formats: PDF | BibTeX Citation Note: Presented at Pairing 2012 on May 17, 2012. Version: 20120724:174630 (All versions of this report) Discussion forum: Show discussion | Start new discussion