Abstract: In this talk, I will describe new ideas leading to a construction of identity-based encryption based on the hardness of the (Computational) Diffie-Hellman Problem (without using groups with pairings). This construction achieves the standard notion of identity-based encryption as considered by Boneh and Franklin [CRYPTO 2001]. The presented construction bypasses known impossibility results using garbled circuits that make a non-black-box use of the underlying cryptographic primitives. (Based on joint work with Nico Döttling)
We are all increasingly the subjects of data collection and processing systems that use data generated both about and by us to provide and optimise a wide range of services. Means for others to collect and process data that concerns each of us -- often referred to possessively as "your data" -- are only increasing with the long-heralded advent of the Internet of Things just the latest example. At the same time, many jurisdictions are implementing regulatory and statutory instruments to govern the use of such data.