Publication Type

Conference Proceeding Article

Version

publishedVersion

Publication Date

7-2017

Abstract

In contrast to the conventional all-or-nothing encryption, functional encryption (FE) allows partial revelation of encrypted information based on the keys associated with different functionalities. Extending FE with key delegation ability, hierarchical functional encryption (HFE) enables a secret key holder to delegate a portion of its decryption ability to others and the delegation can be done hierarchically. All HFE schemes in the literature are for general functionalities and not very practical. In this paper, we focus on the functionality of linear transformations (i.e. matrix product evaluation). We refine the definition of HFE and further extend the delegation to accept multiple keys. We also propose a generic HFE construction for linear transformations with IND-CPA security in the standard model from hash proof systems. In addition, we give two instantiations from the DDH and DCR assumptions which to the best of our knowledge are the first practical concrete HFE constructions.

Keywords

Functional encryption, Hash proof system, Hierarchical, Matrix product

Discipline

Information Security

Research Areas

Information Systems and Management

Publication

Proceedings of the 22nd Australasian Conference, Auckland, New Zealand, 2017 July 3-5

Volume

10342

First Page

23

Last Page

43

ISBN

9783319600543

Identifier

10.1007/978-3-319-60055-0_2

Publisher

Springer Verlag

City or Country

Auckland, New Zealand

Additional URL

http://doi.org/10.1007/978-3-319-60055-0_2

Download

Share

COinS