Point-Function Obfuscation: A Framework and Generic Constructions

  title={Point-Function Obfuscation: A Framework and Generic Constructions},
  author={Mihir Bellare and Igors Stepanovs},
  journal={IACR Cryptol. ePrint Arch.},
We give a definitional framework for point-function obfuscation in which security is parameterized by a class of algorithms we call target generators. Existing and new notions are captured and explained as corresponding to different choices of this class. This leads to an elegant question: Is it possible to provide a generic construction, meaning one that takes an arbitrary class of target generators and returns a point-function obfuscator secure for it? We answer this in the affirmative with… 

Practical implementations of program obfuscators for point functions

It is shown that implementations of point function obfuscators, satisfying different obfuscation notions, can be used with practical performance guarantees, and notable implementation results due to design and coding optimizations are very fast obfuscators based on group theory and lattice theory.

Cryptographic Password Obfuscation

This work achieves the first efficient point function obfuscator for arbitrarily large as well as very short secrets, provable without random oracle assumptions and efficient and provably-secure real-life applications built on top of these obfuscators.

Cryptographic Formula Obfuscation

Under intractability assumptions commonly used in cryptography, it is shown an efficient program obfuscator for large classes of programs, including any arbitrary monotone formula over statements expressed as equalities to a secret, to achieve a related notion of obfuscation for any arbitrary polynomial-time program.

Cryptographic Program Obfuscation: Practical Solutions and Application-Driven Models

This chapter provides a brief summary of the state of the art in cryptographic program obfuscation, focusing on two main aspects: first, there are many implementations of point function obfuscators, satisfying different obfuscation notions, and many of them can be used with practical performance guarantees; second, multiple application-driven obfuscation models and problems can be generated.

The Birth of Cryptographic Obfuscation -- A Survey

An overview of recent research is given, focusing on the theoretical results on general purpose obfuscation, particularly, indistinguishability obfuscation.

Another Step Towards Realizing Random Oracles: Non-Malleable Point Obfuscation

The random oracle paradigm allows us to analyze the security of protocols and construction in an idealized model, where all parties have access to a truly random function. This is one of the most

Practical Implementation of Lattice-Based Program Obfuscators for Point Functions

This paper shows that program obfuscators for point functions based on lattice theory which are time-efficient, storage- efficient, and provably secure under studied modifications of assumptions commonly studied in lattice-based cryptography (i.e., LWE and LWR assumptions).

On the obfuscatability of quantum point functions

Under the quantum-accessible random oracle model, the obfuscatability of quantum point function families is obtained by means of reduction and the application of quantum obfuscation in quantum zero-knowledge is discussed.

Lockable Obfuscation from Circularly Insecure Fully Homomorphic Encryption

A generic construction of a lockable obfuscation scheme build from a (leveled) fully homomorphic encryption scheme that is circularly insecure, and shows that there is a connection in both ways between circular insecure encryption and lockables obfuscation.

Implementing Conjunction Obfuscation Under Entropic Ring LWE

This work is the first implementation of non-trivial program obfuscation based on polynomial rings and achieves runtimes of 6.7 hours to securely obfuscate a 64-bit conjunction program and 2.5 seconds to evaluate this program over an arbitrary input.



On obfuscating point functions

  • H. Wee
  • Mathematics, Computer Science
    STOC '05
  • 2005
This work provides a simple construction of efficient obfuscators for point functions for a slightly relaxed notion of obfuscation, and yields the first non-trivial obfuscator under general assumptions in the standard model.

Obfuscating Point Functions with Multibit Output

A notion of obfuscation that is preserved under an appropriate composition operation is defined, which can be used to construct obfuscators of point functions with multibit output and other related functions.

On Strong Simulation and Composable Point Obfuscation

This work studies a simple relaxation of VBB: allow the simulator unbounded computation time, while still allowing only polynomially many queries to the oracle, and shows composable VGB-obfuscators for point programs under a strong variant of the Decision Diffie–Hellman assumption.

Obfuscation for Cryptographic Purposes

The results show that, while it is hard to avoid generic impossibilities, useful and reasonable obfuscation definitions are possible when considering specific tasks (i.e., function families), and several natural classes of functions for which their definitions yield interesting results.

Indistinguishability Obfuscation versus Multi-bit Point Obfuscation with Auxiliary Input

In a recent celebrated breakthrough, Garg et al. (FOCS 2013) gave the first candidate for so-called indistinguishability obfuscation (iO) thereby reviving the interest in obfuscation for a general

How to use indistinguishability obfuscation: deniable encryption, and more

The 16-year-old open question of Deniable Encryption is resolved by giving the first construction of deniable encryption that does not require any pre-planning by the party that must later issue a denial.

Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation

The construction for injective one-way functions extends to extract hardcore bits on multiple, correlated inputs, yielding new D-PKE schemes and a definitional framework for differing-inputs obfuscation in which security is parameterized by circuit-sampler classes.

On Symmetric Encryption and Point Obfuscation

We show tight connections between several cryptographic primitives, namely encryption with weakly random keys, encryption with key-dependent messages (KDM), and obfuscation of point functions with

Instantiating Random Oracles via UCEs

This paper provides a (standard-model) notion of security for (keyed) hash functions, called UCE, that we show enables instantiation of random oracles (ROs) in a fairly broad and systematic way.

Indistinguishability Obfuscation from the Multilinear Subgroup Elimination Assumption

This work provides the first construction of general-purpose indistinguishability obfuscation proven secure via a reduction to a natural computational assumption over multilinear maps, namely, the MultilInear Subgroup Elimination Assumption.