Cryptology ePrint Archive: Report 2016/1105

Generic Transformations of Predicate Encodings: Constructions and Applications

Miguel Ambrona and Gilles Barthe and Benedikt Schmidt

Abstract: Predicate encodings (Wee, TCC 2014; Chen, Gay, Wee, EUROCRYPT 2015), are symmetric primitives that can be used for building predicate encryption schemes. We give an algebraic characterization of the notion of privacy from predicate encodings, and explore several of its consequences. Specifically, we propose more efficient predicate encodings for boolean formulae and arithmetic span programs, and generic optimizations of predicate encodings. We define new constructions to build boolean combination of predicate encodings. We formalize the relationship between predicate encodings and pair encodings (Attrapadung, EUROCRYPT 2014), another primitive that can be transformed generically into predicate encryption schemes, and compare our constructions for boolean combinations of pair encodings with existing similar constructions from pair encodings. Finally, we demonstrate that our results carry to tag-based encodings (Kim, Susilo, Guo, and Au, SCN 2016).

Category / Keywords: public-key cryptography / Predicate Encryption, Attribute-Based Encryption, Predicate Encodings, Modular frameworks

Date: received 23 Nov 2016, last revised 22 Feb 2017

Contact author: miguel ambrona at imdea org

Available format(s): PDF | BibTeX Citation

Version: 20170222:112523 (All versions of this report)

Short URL: ia.cr/2016/1105

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]