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 non-universal. A related security notion for this weaker primitive is formalized. Finally, some potential applications and open problems are considered. © 2013 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Clear, M., Hughes, A., & Tewari, H. (2013). Homomorphic encryption with access policies: Characterization and new constructions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7918 LNCS, pp. 61–87). Springer Verlag. https://doi.org/10.1007/978-3-642-38553-7_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
