Skip to main content
placeholder image

Hierarchical functional encryption for linear transformations

Journal Article


Download full-text (Open Access)

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.

Authors


  •   Zhang, Shiwei (external author)
  •   Mu, Yi (external author)
  •   Yang, Guomin
  •   Wang, Xiaofen (external author)

Publication Date


  • 2017

Citation


  • Zhang, S., Mu, Y., Yang, G. & Wang, X. (2017). Hierarchical functional encryption for linear transformations. Lecture Notes in Computer Science, 10342 23-43.

Scopus Eid


  • 2-s2.0-85020674361

Ro Full-text Url


  • http://ro.uow.edu.au/cgi/viewcontent.cgi?article=1421&context=eispapers1

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers1/420

Number Of Pages


  • 20

Start Page


  • 23

End Page


  • 43

Volume


  • 10342

Place Of Publication


  • Germany

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.

Authors


  •   Zhang, Shiwei (external author)
  •   Mu, Yi (external author)
  •   Yang, Guomin
  •   Wang, Xiaofen (external author)

Publication Date


  • 2017

Citation


  • Zhang, S., Mu, Y., Yang, G. & Wang, X. (2017). Hierarchical functional encryption for linear transformations. Lecture Notes in Computer Science, 10342 23-43.

Scopus Eid


  • 2-s2.0-85020674361

Ro Full-text Url


  • http://ro.uow.edu.au/cgi/viewcontent.cgi?article=1421&context=eispapers1

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers1/420

Number Of Pages


  • 20

Start Page


  • 23

End Page


  • 43

Volume


  • 10342

Place Of Publication


  • Germany