We propose a set of benchmarks for evaluating the practicality of software obfuscators which rely on provablysecure methods for functional obfuscation. Note to SPRO referees: this paper is one page longer than the 7-page limit for a regular submission. I will prepare a 7-page version, if this is required for publication.

In this short survey, we provide an overview of obfuscation and then shift our focus to outlining various non-trivial control-flow obfuscation techniques. Along the way, we highlight two transforms having provable security properties: the dispatcher model and opaque predicates. We comment on the strength and weaknesses of these transforms and outline difficulties associated in generating genera...

In this research, the student will explain a candidate construction for indistinguishability obfuscation, based on a recent paper by Garg et al. (FOCS 2013). This is done by first describing the main building blocks, then how these are used to build indistinguishability obfuscation for NC, and expanded to P/poly. Security and alternative constructions are very briefly discussed.

Author masking is the task of paraphrasing a document so that its writing style no longer matches that of its original author. This task was introduced as part of the 2016 PAN Lab on Digital Text Forensics, for which a total of three research teams submitted their results. This work describes our methodology to evaluate the submitted obfuscation systems based on their safety, soundness and sens...

We extend the simulation-based definition of Virtual Grey Box (VGB) security – originally proposed for obfuscation (Bitansky and Canetti, 2010) – to a broad class of cryptographic primitives. These include functional encryption, graded encoding schemes, bi-linear maps (with über assumptions), as well as unexplored ones like homomorphic functional encryption. Our main result is a characterizatio...

We propose a new way to obfuscate programs, using composite-order multilinear maps. Our construction operates directly on straight-line programs (arithmetic circuits), rather than converting them to matrix branching programs as in other known approaches. This yields considerable efficiency improvements. For an NC circuit of size s and depth d, with n inputs, we require only O(ds + n) multilinea...

This paper studies the question of how to define, construct, and use obfuscators for probabilistic programs. Such obfuscators compile a possibly randomized program into a deterministic one, which achieves computationally indistinguishable behavior from the original program as long as it is run on each input at most once. For obfuscation, we propose a notion that extends indistinguishability obf...

The availability of access to Integrated Circuits' scan chain is an inevitable requirement modern ICs for testability/debugging purposes. However, leaving the OPEN resulted in numerous security threats on ICs. It raises challenging concerns particularly when secret asset, like information, placed within chip, such as keys cryptographic algorithms, or similarly logic obfuscation key. So, combat ...