Homomorphic encryption with access policies: characterization and new constructions
From MaRDI portal
Abstract: A characterization of predicate encryption (PE) with support for homomorphic operations is presented and we describe the homomorphic properties of some existing PE constructions. Even for the special case of IBE, there are few known group-homomorphic cryptosystems. Our main construction is an XOR-homomorphic IBE scheme based on the quadratic residuosity problem (variant of the Cocks' scheme), which we show to be strongly homomorphic. We were unable to construct an anonymous variant that preserves this homomorphic property, but we achieved anonymity for a weaker notion of homomorphic encryption, which we call emph{non-universal}. A related security notion for this weaker primitive is formalized. Finally, some potential applications and open problems are considered.
Recommendations
Cited in
(6)- Extended Galbraith's test on the anonymity of IBE schemes from higher residuosity
- Additively homomorphic IBE from higher residuosity
- scientific article; zbMATH DE number 6874618 (Why is no real title available?)
- Topology-hiding computation on all graphs
- Leveled Hierarchical Identity-Based Fully Homomorphic Encryption from Learning with Rounding
- Cryptographic role-based access control, reconsidered
This page was built for publication: Homomorphic encryption with access policies: characterization and new constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4924673)