An efficient CCA-secure access control encryption for any policy
From MaRDI portal
Publication:2057135
DOI10.1007/978-3-030-71852-7_7zbMath1479.94346OpenAlexW3138822398MaRDI QIDQ2057135
Hui Ma, Yang Tao, Rui Zhang, Gaosheng Tan
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-71852-7_7
Cites Work
- Access control encryption for general policies from standard assumptions
- Strengthening access control encryption
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Access Control Encryption: Enforcing Information Flow with Cryptography
- Trapdoors for hard lattices and new cryptographic constructions
- Functional Encryption for Randomized Functionalities
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Identity-Based Encryption Without Random Oracles
- General Conversion for Obtaining Strongly Existentially Unforgeable Signatures
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Access Control Encryption for Equality, Comparison, and More
- Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: An efficient CCA-secure access control encryption for any policy