Publication Type

Conference Proceeding Article

Version

publishedVersion

Publication Date

11-2016

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 xxxx and yyyy, calculate ⟨xx,yy⟩⟨xx,yy⟩), 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.

Keywords

Functional encryption, Hash proof system, IND-CCA, Inner product

Discipline

Information Security

Research Areas

Information Systems and Management

Publication

Proceedings of the 12th International Conference, Beijing, China, 2016 November 4-6

First Page

119

Last Page

139

ISBN

9783319547046

Identifier

10.1007/978-3-319-54705-3_8

Publisher

Springer Verlag

City or Country

Beijing, China

Additional URL

http://doi.org/10.1007/978-3-319-54705-3_8

Download

Share

COinS