Delegation-based conversion from CPA to CCA-secure predicate encryption
The paper proposes a generic delegation-based conversion from a chosen-plaintext attack (CPA)-secure encryption to a chosen-ciphertext attack (CCA)-secure predicate encryption (PE) with public index scheme, which in the authors' words ``is the first delegation-based conversion that can transform a CPA-secure PE to CCA-secure PE generically and ``our conversion captures a number of existing subclasses of PE and [\dots] functional encryption for regular languages. The introduction summarizes the results and references on this topic. \textit{S. Yamada} et al. [Lect. Notes Comput. Sci. 6571, 71--89 (2011; Zbl 1291.94170)] presented a conversion from attributed-based encryption to CCA-secure PE based in verificability and \textit{S. Yamada} et al. [Lect. Notes Comput. Sci. 7293, 243--261 (2012; Zbl 1290.94158)] give a generalization to CCA-secure PE. The proposal in the paper generalizes the work of Yamada et al. [loc. cit.]. The introduction provides an overview of the proposal and the used tools: one time signatures, weak commitment or messages authentication codes. The necessaries notations, definitions and security notions of PE are gathered in Section 2 and the appendices at the end of the paper. The details of the proposed delegation-based conversion are given in Section 3. Section 4 proposes several PE schemes suitable for the conversion. Finally, Section 5 shows the comparison of the performance of the proposal and of other conversions (Tables 2 and 3).
- Verifiability-based conversion from CPA to CCA-secure predicate encryption
- Efficient fully CCA-secure predicate encryptions from pair encodings
- Generic constructions for chosen-ciphertext secure attribute based encryption
- Subtleties in security definitions for predicate encryption with public index
- Verifiable predicate encryption and applications to CCA security and anonymous predicate authentication
- CCA-secure predicate encryption from pair encoding in prime order groups: generic and efficient
- Dual System Encryption via Predicate Encodings
- Construction of fully CCA-secure predicate encryptions from pair encoding schemes
- Delegating Capabilities in Predicate Encryption Systems
- Predicate encryption supporting disjunctions, polynomial equations, and inner products
- CCA-secure predicate encryption from pair encoding in prime order groups: generic and efficient
- Tag-based ABE in prime-order groups via pair encoding
- Efficient fully CCA-secure predicate encryptions from pair encodings
- Generic conversions from CPA to CCA without ciphertext expansion for threshold ABE with constant-size ciphertexts
- Verifiability-based conversion from CPA to CCA-secure predicate encryption
This page was built for publication: Delegation-based conversion from CPA to CCA-secure predicate encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019836)
