Skip to main content
placeholder image

Achieving IND-CCA security for functional encryption for inner products

Journal Article


Abstract


  • Functional encryption allows the authorised parties to reveal partial information of the plaintext hidden in a ciphertext while in conventional encryption decryption is all-or-nothing. Focusing on the functionality of inner product evaluation (i.e. given vectors x and y, calculate (x, y)), Abdalla et al. (PKC 2015) proposed a functional encryption scheme for inner product functionality (FE-IP) with s-IND-CPA security. In some recent works by Abdalla et al. (eprint: Report 2016/11) and Agrawal et al. (CRYPTO 2016), IND-CPA secure FE-IP schemes have also been proposed. In order to achieve Indistinguishable under Chosen Ciphertext Attacks (IND-CCA security) for FE-IP, in this paper, we propose a generic construction of FE-IP from hash proof systems. We prove the constructed FE-IP is IND-CCA secure, assuming the hardness of the subset membership problem. In addition, we give an instantiation of our generic construction from the DDH assumption.

Authors


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

Publication Date


  • 2017

Citation


  • Zhang, S., Mu, Y. & Yang, G. (2017). Achieving IND-CCA security for functional encryption for inner products. Lecture Notes in Computer Science, 10143 119-139. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Scopus Eid


  • 2-s2.0-85014907719

Ro Metadata Url


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

Has Global Citation Frequency


Number Of Pages


  • 20

Start Page


  • 119

End Page


  • 139

Volume


  • 10143

Place Of Publication


  • Germany

Abstract


  • Functional encryption allows the authorised parties to reveal partial information of the plaintext hidden in a ciphertext while in conventional encryption decryption is all-or-nothing. Focusing on the functionality of inner product evaluation (i.e. given vectors x and y, calculate (x, y)), Abdalla et al. (PKC 2015) proposed a functional encryption scheme for inner product functionality (FE-IP) with s-IND-CPA security. In some recent works by Abdalla et al. (eprint: Report 2016/11) and Agrawal et al. (CRYPTO 2016), IND-CPA secure FE-IP schemes have also been proposed. In order to achieve Indistinguishable under Chosen Ciphertext Attacks (IND-CCA security) for FE-IP, in this paper, we propose a generic construction of FE-IP from hash proof systems. We prove the constructed FE-IP is IND-CCA secure, assuming the hardness of the subset membership problem. In addition, we give an instantiation of our generic construction from the DDH assumption.

Authors


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

Publication Date


  • 2017

Citation


  • Zhang, S., Mu, Y. & Yang, G. (2017). Achieving IND-CCA security for functional encryption for inner products. Lecture Notes in Computer Science, 10143 119-139. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Scopus Eid


  • 2-s2.0-85014907719

Ro Metadata Url


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

Has Global Citation Frequency


Number Of Pages


  • 20

Start Page


  • 119

End Page


  • 139

Volume


  • 10143

Place Of Publication


  • Germany