Server-Aided Revocable Predicate Encryption: Formalization and Lattice-Based Instantiation. (18th November 2019)

• Record Type: Journal Article
• Authors: Ling, San; Nguyen, Khoa; Wang, Huaxiong; Zhang, Juanyang
• Is Part Of: Computer journal. Volume 62:Number 12(2019)
• Page Start: 1849
• Page End: 1862
• Publication Date: 2019-11-18
• Subjects: server-aided revocation -- predicate encryption -- lattices -- LWE; Computers -- Periodicals; 005.1
• DOI: 10.1093/comjnl/bxz079
• Languages: English
• ISSNs: 0010-4620

Abstract

Abstract: Efficient user revocation is a necessary but challenging problem in many multi-user cryptosystems. Among known approaches, server-aided revocation yields a promising solution, because it allows to outsource the major workloads of system users to a computationally powerful third party, called the server, whose only requirement is to carry out the computations correctly. Such a revocation mechanism was considered in the settings of identity-based encryption and attribute-based encryption by Qin et al. (2015, ESORICS) and Cui et al. (2016, ESORICS ), respectively. In this work, we consider the server-aided revocation mechanism in the more elaborate setting of predicate encryption (PE). The latter, introduced by Katz et al. (2008, EUROCRYPT), provides fine-grained and role-based access to encrypted data and can be viewed as a generalization of identity-based and attribute-based encryption. Our contribution is 2-fold. First, we formalize the model of server-aided revocable PE (SR-PE), with rigorous definitions and security notions. Our model can be seen as a non-trivial adaptation of Cui et al. 's work into the PE context. Second, we put forward a lattice-based instantiation of SR-PE. The scheme employs the PE scheme of Agrawal et al. (2011, ASIACRYPT) and the complete subtree method of Naor et al. (2001, CRYPTO) as the two main ingredients, which work smoothly together thanks to a few additional techniques. Our scheme is proven secure in the standard model (in a selective manner), based on the hardness of the learning with errors problem.