Verifiability-based conversion from CPA to CCA-secure predicate encryption
From MaRDI portal
Publication:683914
DOI10.1007/s00200-017-0330-2zbMath1384.94092OpenAlexW2621780781WikidataQ121359383 ScholiaQ121359383MaRDI QIDQ683914
Publication date: 9 February 2018
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-017-0330-2
Related Items (5)
CCA-secure ABE using tag and pair encoding ⋮ On the security of joint signature and encryption revisited ⋮ Tag-based ABE in prime-order groups via pair encoding ⋮ Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption ⋮ Efficient fully CCA-secure predicate encryptions from pair encodings
Cites Work
- Unnamed Item
- Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes
- Attribute-Based Encryption for Circuits from Multilinear Maps
- Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
- Verifiable Predicate Encryption and Applications to CCA Security and Anonymous Predicate Authentication
- Achieving Short Ciphertexts or Short Secret-Keys for Adaptively Secure General Inner-Product Encryption
- Functional Encryption for Regular Languages
- Identity-Based Cryptosystems and Signature Schemes
- Functional Encryption: Definitions and Challenges
- Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
- Generic Constructions for Chosen-Ciphertext Secure Attribute Based Encryption
- Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts
- Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
- Bounded Ciphertext Policy Attribute Based Encryption
- Functional Encryption for Inner Product: Achieving Constant-Size Ciphertexts with Adaptive Security or Support for Negation
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
- Generalized Identity Based and Broadcast Encryption Schemes
- Hierarchical Predicate Encryption for Inner-Products
- New directions in cryptography
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Fully Secure Unbounded Inner-Product and Attribute-Based Encryption
- Candidate Multilinear Maps from Ideal Lattices
- Secure integration of asymmetric and symmetric encryption schemes
- Advances in Cryptology - EUROCRYPT 2004
- Fuzzy Identity-Based Encryption
- Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Attribute-based encryption for circuits
- Topics in Cryptology – CT-RSA 2005
This page was built for publication: Verifiability-based conversion from CPA to CCA-secure predicate encryption
