Instructor: Daniele Micciancio Time: Tue, Thu 11:00am-12:20pm Room: CSE 2154
This Advanced Cryptography course will focus on Functional Encryption, Fully Homomorphic Encryption and Program Obfuscation. See Introduction for details.
This course assumes you have already taken an introductory graduate level cryptography class (like CSE207: Modern Cryptography) and all implied prerequisites. See the course introduction and the calibration homework for details.
Course grades will be based on class partecipation, a set of 3-4 homework assignments, and a small project or paper presentation.
Course topics, defintion of public key encyrption, equivalence between definitions
Program obfuscation, definitions, equivalences, and (im)possibility results.
Functional encryption. Definition, security, examples.
For an informal introduction to functional encryption start from the magazine article: Functional encryption: a new vision for public-key cryptography (Boneh, Sahai & Waters, Comm. of ACM 2012). Definitions and results discussed in class can be found in:
Additional reading on definitional issues for functional encryption:
Some Functional Encryption constructions.
From Functional Encryption to iO
Here is a (perhaps incomplete) list of research papers on functional encryption, obfuscation and some related topics published just in the last year at the main cryptography conferences and workshops. We will only cover a small selection of papers in class, and you can use this list for additional reading, and possibly as the basis of your project or paper presentation.
How to Avoid Obfuscation Using Witness PRFs (Zhandry, TCC 2016A)
Cutting-Edge Cryptography Through the Lens of Secret Sharing (Komargodski & Zhandry, TCC 2016A)
Functional Encryption Without Obfuscation (Garg, Gentry, Halevi & Zhandry, TCC 2016A)
On Constructing One-Way Permutations from Indistinguishability Obfuscation (Asharov & Segev, TCC 2016A)
Contention in Cryptoland: Obfuscation, Leakage and UCE (Bellare, Stepanovs & Tessaro, TCC 2016A)
Point-Function Obfuscation: A Framework and Generic Constructions (Bellare & Stepanovs, TCC 2016A)
Extended Nested Dual System Groups, Revisited (Gong, Chen, Dong, Cao & Tang, PKC 2016)
Functional Encryption for Inner Product with Full Function Privacy (Datta, Dutta, Mukhopadhyay, PKC 2016)
Deniable Functional Encryption (DeCaro, Iovimo & ONeill, PKC 2016)
Indistinguishability Obfuscation with Non-trivial Efficiency (Lin, Pass, Seth & Telang, PKC 2016)
Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes (Lin, Eurocrypt 2016)
Cryptanalysis of the New CLT Multilinear Map over the Integers (Cheon, Fouque, Lee, Minaud & Ryu, Eurocrypt 2016)
Cryptanalysis of GGH Map (Hu & Jia, Eurocrypt 2016)
Valiant's Universal Circuit is Practical (Kiss & Schneider, Eurocrypt 2016)
Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters (Yamada, Eurocrypt 2016)
On the Power of Hierarchical Identity-Based Encryption (Mahmoody & Mohammed, Eurocrypt 2016)
Post-zeroizing Obfuscation: New Mathematical Tools, and the Case of Evasive Circuits (Badrinarayanan, Miles, Sahai & Zhandry, Eurocrypt 2016)
New Negative Results on Differing-Inputs Obfuscation (Bellare, Stepanovs & Waters, Eurocrypt 2016)
Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions (Brakerski, Komargodski & Segev, Eurocrypt 2016)
A Subfield Lattice Attack on Overstretched NTRU Assumptions - Cryptanalysis of Some FHE and Graded Encoding Schemes (Albrecht, Bai & Ducas, Crypto 2016)
The Magic of ELFs (Zhandry, Crypto 2016)
Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption (Ananth, Jain, Naor, Sahai & Yogev, Crypto 2016)
Obfuscation Combiners (Fischlin, Herzberg, Noon & Shulman, Crypto 2016)
On Statistically Secure Obfuscation with Approximate Correctness (Brakerski, Brzuska & Fleischhacker, Crypto 2016)
Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium (Garg, Pandey & Srinivasan, Crypto 2016)
Cryptanalysis of GGH15 Multilinear Maps (Coron, Lee, Lepoint & Tibouchi, Crypto 2016)
Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13 (Miles, Sahai & Zhandry, Crypto 2016)
Adaptively Secure Garbled Circuits from One-Way Functions (Hemenway, Jafargholi, Ostrovsky, Scafuro & Wichs, Crypto 2016)
Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes (Zhang, Chen & Zhang, Crypto 2016)
Fully Secure Functional Encryption for Inner Products, from Standard Assumptions (Agrawal, Libert & Stehle, Crypto 2016)
Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security (Brakerski & Vaikuntanathan, Crypto 2016)
Secure Obfuscation in a Weak Multilinear Map Model (Garg, Miles, Mukherjee, Sahai, Srinivasan & Zhandry, TCC 2016B)
Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents (Agrawal, Prabhakaran & Yu, TCC 2016B)
Deniable Attribute Based Encryption for Branching Programs from LWE (Apon, Fan & Liu, TCC 2016B)
Targeted Homomorphic Attribute-Based Encryption (Brakerski, Cash, Tsabary & Wee, TCC 2016B)
Semi-adaptive Security and Bundling Functionalities Made Generic and Easy (Goyal, Coppula & Waters, TCC 2016B)
From Cryptomania to Obfustopia Through Secret-Key Functional Encryption (Bitanski, Nishimaki, Passelegue & Wichs, TCC 2016B)
Single-Key to Multi-Key Functional Encryption with Polynomial Loss (Garg & Srinivasan, TCC 2016B)
Compactness vs Collusion Resistance in Functional Encryption (Li & Micciancio, TCC 2016B)
Multi-input Functional Encryption with Unbounded-Message Security (Goyal, Jain & ONeill, Asiacrypt 2016)
Verifiable Functional Encryption (Badrinarayanan, Goyal, Jain & Sahai, Asiacrypt 2016)
Efficient IBE with Tight Reduction to Standard Assumption in the Multi-challenge Setting (Gong, Dong, Chen & Cao, Asiacrypt 2016)
Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps (Katsumata & Yamada, Asiacrypt 2016)