|Title||:||Computing on Encrypted Data: Overview and a New Construction|
|Speaker||:||Shweta Agrawal (IITM)|
|Details||:||Tue, 8 Nov, 2016 4:00 PM @ BSB 361|
|Abstract:||:||In this talk, I will first present a high level overview of some fascinating recent results in cryptography that allow for computing on encrypted data. I will particularly focus on the cryptographic primitive of `functional encryption`, which generalises public key encryption. Functional encryption goes beyond the all or nothing paradigm that binds public key encryption, and allows fine grained access to encrypted data. In functional encryption, a secret key is associated with a circuit C, and ciphertext is associated with some data X and decryption reveals C(X) and nothing else.
In the second part of the talk, I will present some new results, in which we provide a new construction for functional encryption which simultaneously achieves (and in some cases, improves) the best of all parameters known across all functional encryption schemes from standard assumptions -- ciphertext size, number of key requests permitted to the attacker, security definition and function family being supported. We also demonstrate some attacks on existing schemes in stronger but natural usage scenarios than considered by the schemes. The paper is available here.