Bounded-Collusion IBE from Key Homomorphism

• Main Authors: Goldwasser, Shafi (Contributor), Lewko, Allison (Author), Wilson, David A. (Contributor)
• Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
• Format: Article
• Language: English
• Published: Springer-Verlag, 2014-05-05T19:24:01Z.
• Subjects: Article
• Online Access: Get fulltext

In this work, we show how to construct IBE schemes that are secure against a bounded number of collusions, starting with underlying PKE schemes which possess linear homomorphisms over their keys. In particular, this enables us to exhibit a new (bounded-collusion) IBE construction based on the quadratic residuosity assumption, without any need to assume the existence of random oracles. The new IBE's public parameters are of size O(tλlogI) where I is the total number of identities which can be supported by the system, t is the number of collusions which the system is secure against, and λ is a security parameter. While the number of collusions is bounded, we note that an exponential number of total identities can be supported. More generally, we give a transformation that takes any PKE satisfying Linear Key Homomorphism, Identity Map Compatibility, and the Linear Hash Proof Property and translates it into an IBE secure against bounded collusions. We demonstrate that these properties are more general than our quadratic residuosity-based scheme by showing how a simple PKE based on the DDH assumption also satisfies these properties.
National Science Foundation (U.S.) (NSF CCF-0729011)
National Science Foundation (U.S.) (NSF CCF-1018064)
United States. Defense Advanced Research Projects Agency (DARPA FA8750-11-2-0225)