Framework for Investigating Functional Encryption

Thesis: M. Eng. in Computer Science and Engineering, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Cataloged from student-submitted PDF version of thesis.Includes bibliographical references (pages 95-102).In functional encryption, keys are associated with functions, and ciphertexts with messages. Decrypting a message with a key gives the evaluation of the associated function on that message. We look at bounded-collusion functional encryption, where the number of keys for which security is guaranteed is bounded, as it is possible to realize using standard building blocks. For such schemes we aim to understand their practicality for real-world applications. There are some theoretical constructions of functional encryption, but few implementations. We rectify this by creating the Framework for Investigating Functional Encryption (FIFE). FIFE includes the first implementations for Sahai and Seyalioglu's one-key scheme (CCS 2010), and Gorbunov, Vaikuntanathan, and Wee's bounded-collusion scheme (CRYPTO 2012), and is easily extendable. We used FIFE to evaluate their performance, and to measure the impact of using different public-key or secret-key encryption schemes, bounds on collusion, and security levels, for interesting classes of functions.by Gaurav Singh.M. Eng. in Computer Science and Engineerin