[Resource Topic] 2016/206: Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes

Welcome to the resource topic for 2016/206

Title:
Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes

Authors: Johannes Blömer, 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.

ePrint: https://eprint.iacr.org/2016/206

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .