Server-Aided Revocable Predicate Encryption: Formalization and Lattice-Based Instantiation

01/24/2018
by   San Ling, et al.
0

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. (ESORICS 2015) and Cui et al. (ESORICS 2016), 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, Sahai, and Waters (EUROCRYPT 2008), 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 two-fold. First, we formalize the model of server-aided revocable predicate encryption (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, Freeman and Vaikuntanathan (ASIACRYPT 2011) and the complete subtree method of Naor, Naor, and Lotspiech (CRYPTO 2001) 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 (LWE) problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/13/2018

On the security of the hierarchical attribute based encryption scheme proposed by Wang et al

Ciphertext-policy hierarchical attribute-based encryption (CP-HABE) is a...
research
09/17/2018

Ciphertext Outdate Attacks on Xu et al.'s Revocable Attribute-Based Encryption Scheme

Cloud storage is a new computing paradigm that allows users to store the...
research
08/29/2019

Key-Aggregate Searchable Encryption, Revisited: Formal Foundations for Cloud Applications, and Their Implementation

In the use of a cloud storage, sharing of data with efficient access con...
research
03/19/2023

Geometric Stability Estimates For 3D-Object Encryption Through Permutations and Rotations

We compute precise estimates for dimensions of 3D-encryption techniques ...
research
12/31/2020

Lattice-based Signcryption with Equality Test in Standard Model

A signcryption, which is an integration of a public key encryption and a...
research
11/16/2020

Collusion-Resistant Identity-based Proxy Re-Encryption: Lattice-based Constructions in Standard Model

The concept of proxy re-encryption (PRE) dates back to the work of Blaze...
research
09/16/2021

Compressed Oblivious Encoding for Homomorphically Encrypted Search

Fully homomorphic encryption (FHE) enables a simple, attractive framewor...

Please sign up or login with your details

Forgot password? Click here to reset