Homomorphic Encryption with Access Policies: Characterization and New Constructions
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.
Keywords
Cite
@article{arxiv.1302.1192,
title = {Homomorphic Encryption with Access Policies: Characterization and New Constructions},
author = {Michael Clear and Arthur Hughes and Hitesh Tewari},
journal= {arXiv preprint arXiv:1302.1192},
year = {2013}
}
Comments
Full version of a paper that was published in Africacrypt 2013