Verifiable predicate encryption and applications to CCA security and anonymous predicate authentication
From MaRDI portal
Recommendations
- Verifiability-based conversion from CPA to CCA-secure predicate encryption
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Predicate encryption with partial public keys
- Predicate encryption for circuits from LWE
- Efficient fully CCA-secure predicate encryptions from pair encodings
Cited in
(12)- On the untapped potential of encoding predicates by arithmetic circuits and their applications
- Delegation-based conversion from CPA to CCA-secure predicate encryption
- Tag-based ABE in prime-order groups via pair encoding
- Efficient fully CCA-secure predicate encryptions from pair encodings
- Generic transformation from broadcast encryption to round-optimal deniable ring authentication
- CCA-secure ABE using tag and pair encoding
- A generic construction of accountable decryption and its applications
- An Efficient Predicate Encryption with Constant Pairing Computations and Minimum Costs
- Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential System
- Explainable arguments
- Verifiability-based conversion from CPA to CCA-secure predicate encryption
- Using predicate extension for predicate encryption to generically obtain chosen-ciphertext security and signatures
This page was built for publication: Verifiable predicate encryption and applications to CCA security and anonymous predicate authentication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2900221)