Server-aided revocable predicate encryption : formalization and lattice-based instantiation
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 ser...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/152299 |
| _version_ | 1824456841991553024 |
|---|---|
| author | Ling, San Nguyen, Khoa Wang, Huaxiong Zhang, Juanyang |
| author2 | School of Physical and Mathematical Sciences |
| author_facet | School of Physical and Mathematical Sciences Ling, San Nguyen, Khoa Wang, Huaxiong Zhang, Juanyang |
| author_sort | Ling, San |
| collection | NTU |
| description | 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. |
| first_indexed | 2025-02-19T04:00:31Z |
| format | Journal Article |
| id | ntu-10356/152299 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2025-02-19T04:00:31Z |
| publishDate | 2021 |
| record_format | dspace |
| spelling | ntu-10356/1522992021-08-04T02:47:53Z Server-aided revocable predicate encryption : formalization and lattice-based instantiation Ling, San Nguyen, Khoa Wang, Huaxiong Zhang, Juanyang School of Physical and Mathematical Sciences Division of Mathematical Sciences Science::Mathematics Server-aided Revocation Predicate Encryption 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. Ministry of Education (MOE) Nanyang Technological University Singapore Ministry of Education (MOE2016-T2-2-014(S)); Gopalakrishnan—NTU Presidential Postdoctoral Fellowship 2018 (to K.N.). 2021-08-04T02:47:53Z 2021-08-04T02:47:53Z 2019 Journal Article Ling, S., Nguyen, K., Wang, H. & Zhang, J. (2019). Server-aided revocable predicate encryption : formalization and lattice-based instantiation. The Computer Journal, 62(12), 1849-1862. https://dx.doi.org/10.1093/comjnl/bxz079 0010-4620 https://hdl.handle.net/10356/152299 10.1093/comjnl/bxz079 2-s2.0-85077749244 12 62 1849 1862 en MOE2016-T2-2-014(S) The Computer Journal © 2019 The British Computer Society. All rights reserved. |
| spellingShingle | Science::Mathematics Server-aided Revocation Predicate Encryption Ling, San Nguyen, Khoa Wang, Huaxiong Zhang, Juanyang Server-aided revocable predicate encryption : formalization and lattice-based instantiation |
| title | Server-aided revocable predicate encryption : formalization and lattice-based instantiation |
| title_full | Server-aided revocable predicate encryption : formalization and lattice-based instantiation |
| title_fullStr | Server-aided revocable predicate encryption : formalization and lattice-based instantiation |
| title_full_unstemmed | Server-aided revocable predicate encryption : formalization and lattice-based instantiation |
| title_short | Server-aided revocable predicate encryption : formalization and lattice-based instantiation |
| title_sort | server aided revocable predicate encryption formalization and lattice based instantiation |
| topic | Science::Mathematics Server-aided Revocation Predicate Encryption |
| url | https://hdl.handle.net/10356/152299 |
| work_keys_str_mv | AT lingsan serveraidedrevocablepredicateencryptionformalizationandlatticebasedinstantiation AT nguyenkhoa serveraidedrevocablepredicateencryptionformalizationandlatticebasedinstantiation AT wanghuaxiong serveraidedrevocablepredicateencryptionformalizationandlatticebasedinstantiation AT zhangjuanyang serveraidedrevocablepredicateencryptionformalizationandlatticebasedinstantiation |