ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Verifiability-based conversion from CPA to CCA-secure predicate encryption

Nandi, Mridul and Pandit, Tapas (2018) Verifiability-based conversion from CPA to CCA-secure predicate encryption. In: APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 29 (1). pp. 77-102.

[img] PDF
App_Alg_Eng_29-1_77_2018.pdf - Published Version
Restricted to Registered users only

Download (782kB) | Request a copy
Official URL: http://dx.doi.org/10.1007/s00200-017-0330-2

Abstract

Predicate encryption (PE), a generalization of attribute-based encryption (ABE), is a versatile tool for providing access control over data. The underlying predicate for a PE is parametrized by an index, called system parameter or simply system-index. A system-index, in general, consists of component(s) from . Yamada et al. in PKC 2011 proposed a verifiability-based conversion from CPA to CCA-secure ABE. This conversion was generalized by Yamada et al. in PKC 2012 from ABE to PE. In the later conversion, the authors considered the system-index to be a single component. In practice, there are many schemes, e.g., functional encryption for general relations and hierarchical-inner product (HIP) encryption schemes of Okamoto-Takashima in CRYPTO 2010, CANS 2011 and EUROCRYPT 2012, where system-indices consist of more than a single component. Therefore, for these schemes, the conversion of Yamada et al. (in PKC, 2012) is out of scope. In this paper, we revisit the CPA to CCA conversion for PE and propose a new conversion based on verifiability. The proposed conversion works irrespective of the number of components in the system-indices. It generalizes the existing conversion of Yamada et al. (in PKC, 2011) from ABE to PE. The PE schemes which are realized by the conversion of Yamada et al. (2011) are also realized by our conversion. Therefore, the conversion of ours has more scope than the conversion proposed in 2012. We show that all the aforementioned CPA-secure schemes for general relations and HIP relation are easily converted to the corresponding CCA-secure schemes by our conversion. Further, we show a generic conversion from CPA to CCA-secure functional encryption for regular languages which captures the existing PE schemes for regular languages.

Item Type: Journal Article
Additional Information: Copy right for this article belongs to the SPRINGER, 233 SPRING ST, NEW YORK, NY 10013 USA
Department/Centre: Division of Physical & Mathematical Sciences > Mathematics
Depositing User: Id for Latest eprints
Date Deposited: 02 Mar 2018 15:06
Last Modified: 12 Nov 2018 15:44
URI: http://eprints.iisc.ac.in/id/eprint/58889

Actions (login required)

View Item View Item