Mayo, Kenwrick2015-09-232015-09-232015-09-232015-09-21http://hdl.handle.net/10012/9698The construction of cryptographic multilinear maps and a general-purpose code obfuscator were two long-standing open problems in cryptography. It has been clear for a number of years that constructions of these two primitives would yield many interesting applications. This thesis describes the Coron-Lepoint-Tibouchi candidate construction for multilinear maps, as well as new candidates for code obfuscation. We give an overview of current multilinear and obfuscation research, and present some relevant applications. We also provide some examples and warnings regarding the inefficiency of the new constructions. The presentation is self-contained and should be accessible to the novice reader.enCryptographyObfuscationMultilinear MapsBroadcast EncryptionMaster ThesisCombinatorics and Optimization