Paper 2016/206
Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes
Johannes Blömer and Gennadij Liske
Abstract
This paper presents a new framework for constructing fully CCA-secure predicate encryption schemes from pair encoding schemes. Our construction is the first in the context of predicate encryption which uses the technique of well-formedness proofs known from public key encryption. The resulting constructions are simpler and more efficient compared to the schemes achieved using known generic transformations from CPA-secure to CCA-secure schemes. The reduction costs of our framework are comparable to the reduction costs of the underlying CPA-secure framework. We achieve this last result by applying the dual system encryption methodology in a novel way.
Note: The simplified construction is elaborated.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Major revision. Topics in Cryptology - CT-RSA 2016
- DOI
- 10.1007/978-3-319-29485-8_25
- Keywords
- predicate encryption schemeschosen-ciphertext securitykey-encapsulation mechanismsfull securitypair encoding schemes
- Contact author(s)
- gennadij liske @ upb de
- History
- 2016-03-24: revised
- 2016-02-25: received
- See all versions
- Short URL
- https://ia.cr/2016/206
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2016/206,
author = {Johannes Blömer and Gennadij Liske},
title = {Construction of Fully {CCA}-Secure Predicate Encryptions from Pair Encoding Schemes},
howpublished = {Cryptology {ePrint} Archive, Paper 2016/206},
year = {2016},
doi = {10.1007/978-3-319-29485-8_25},
url = {https://eprint.iacr.org/2016/206}
}
