Cryptology ePrint Archive: Report 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.

Category / Keywords: public-key cryptography / predicate encryption schemes, chosen-ciphertext security, key-encapsulation mechanisms, full security, pair encoding schemes

Original Publication (with major differences): Topics in Cryptology - CT-RSA 2016
DOI:
10.1007/978-3-319-29485-8_25

Date: received 25 Feb 2016, last revised 24 Mar 2016

Contact author: gennadij liske at upb de

Available format(s): PDF | BibTeX Citation

Note: The simplified construction is elaborated.

Version: 20160324:103258 (All versions of this report)

Short URL: ia.cr/2016/206

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]