Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/inderscience-publishers/delegation-based-conversion-from-cpa-to-cca-secure-predicate-ja54dTg7Xt
- Publisher
- Inderscience Publishers
- Copyright
- Copyright © Inderscience Enterprises Ltd
- ISSN
- 1753-0563
- eISSN
- 1753-0571
- DOI
- 10.1504/IJACT.2020.107163
- Publisher site
- See Article on Publisher Site
Abstract
In 2011, Yamada et al. proposed CPA to CCA-secure conversions for attribute-based encryption (ABE) based on the properties, verifiability and delegation. Later, the verifiability-based conversion was generalised from ABE to predicate encryption (PE) by Yamada et al. (2012) and Nandi et al. (2017). We observe that for bilinear-pairing based PE schemes, the cost of CCA-decryption blows up to the double of the cost of CPA-decryption due to verifiability testing. Therefore, the conversion based on delegation is mostly acceptable whenever a delegation-based conversion is available for the primitive PE scheme. In this paper, we investigate a generic delegation-based conversion from CPA to CCA-secure predicate encryption schemes. Our conversion generalises the delegation-based conversion of Yamada et al. (2011) from ABE to PE. We show that our conversion captures many subclasses of PE, e.g., (hierarchical) inner-product encryption, (doubly-)spatial encryption and functional encryption for regular languages.
Journal
International Journal of Applied Cryptography – Inderscience Publishers
Published: Jan 1, 2020