--- res: bibo_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.@eng bibo_authorlist: - foaf_Person: foaf_givenName: Johannes foaf_name: Blömer, Johannes foaf_surname: Blömer foaf_workInfoHomepage: http://www.librecat.org/personId=23 - foaf_Person: foaf_givenName: Gennadij foaf_name: Liske, Gennadij foaf_surname: Liske bibo_doi: 10.1007/978-3-319-29485-8_25 dct_date: 2016^xs_gYear dct_title: Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes@ ...