Homomorphic encryption with access policies: characterization and new constructions
From MaRDI portal
Publication:4924673
DOI10.1007/978-3-642-38553-7_4zbMATH Open1312.94040arXiv1302.1192OpenAlexW3100960533MaRDI QIDQ4924673FDOQ4924673
Authors: Michael Clear, Arthur Hughes, Hitesh Tewari
Publication date: 7 June 2013
Published in: Progress in Cryptology – AFRICACRYPT 2013 (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1302.1192
Recommendations
Cited In (6)
- Additively homomorphic IBE from higher residuosity
- Extended Galbraith's test on the anonymity of IBE schemes from higher residuosity
- Cryptographic role-based access control, reconsidered
- Title not available (Why is that?)
- Leveled Hierarchical Identity-Based Fully Homomorphic Encryption from Learning with Rounding
- Topology-hiding computation on all graphs
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)