#### Filter Results:

- Full text PDF available (31)

#### Publication Year

2011

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

Succinct non-interactive arguments (SNARGs) enable verifying NP statements with lower complexity than required for classical NP verification. Traditionally, the focus has been on minimizing the length of such arguments; nowadays researches have focused also on minimizing verification time, by drawing motivation from the problem of delegating computation. A… (More)

- Nir Bitansky, Omer Paneth, Alon Rosen
- 2015 IEEE 56th Annual Symposium on Foundations of…
- 2014

We prove that finding a Nash equilibrium of a game is hard, assuming the existence of indistinguishability obfuscation and one-way functions with sub-exponential hardness. We do so by showing how these cryptographic primitives give rise to a hard computational problem that lies in the complexity class PPAD, for which finding Nash equilibrium is complete.… (More)

- Boaz Barak, Sanjam Garg, Yael Tauman Kalai, Omer Paneth, Amit Sahai
- IACR Cryptology ePrint Archive
- 2013

The goal of general-purpose program obfuscation is to make an arbitrary computer program " unin-telligible " while preserving its functionality. At least as far back as the work of Diffie and Hellman in 1976, researchers have contemplated applications of general-purpose obfuscation. However, until 2013, even heuristic constructions for general-purpose… (More)

This work attempts to clarify to what extent simulation-based security (SIM-security) is achievable for functional encryption (FE) and its relation to the weaker indistinguishability-based security (IND-security). Our main result is a compiler that transforms any FE scheme for the general circuit functionality (which we denote by Circuit-FE) meeting… (More)

An evasive circuit family is a collection of circuits C such that for every input x, a random circuit from C outputs 0 on x with overwhelming probability. We provide a combination of definitional, constructive, and impossibility results regarding obfuscation for evasive functions: 1. The (average case variants of the) notions of virtual black box… (More)

- Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen
- IACR Cryptology ePrint Archive
- 2014

A function <i>f</i> is extractable if it is possible to algorithmically "extract," from any adversarial program that outputs a value <i>y</i> in the image of <i>f;</i> a preimage of <i>y</i>. When combined with hardness properties such as one-wayness or collision-resistance, extractability has proven to be a powerful tool. However, so far, extractability… (More)

- Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth
- Algorithmica
- 2014

An obfuscator $$\mathcal {O}$$ O is Virtual Grey Box (VGB) for a class $$\mathcal {C}$$ C of circuits if, for any $$C\in \mathcal {C}$$ C ∈ C and any predicate $$\pi $$ π , deducing $$\pi (C)$$ π ( C ) given $$\mathcal {O}(C)$$ O ( C ) is tantamount to deducing $$\pi (C)$$ π ( C ) given unbounded computational resources and polynomially many oracle queries… (More)

- Nir Bitansky, Omer Paneth
- IACR Cryptology ePrint Archive
- 2012

The traditional notion of <i>program obfuscation</i> requires that an obfuscation ~Prog of a program Prog computes the exact same function as Prog, but beyond that, the code of ~Prog should not leak any information about Prog. This strong notion of <i>virtual black-box</i> security was shown by Barak et al. (CRYPTO 2001) to be impossible to achieve, for… (More)

- Nir Bitansky, Omer Paneth
- 2012 IEEE 53rd Annual Symposium on Foundations of…
- 2012

The introduction of a non-black-box simulation technique by Barak (FOCS 2001) has been a major landmark in cryptography, breaking the previous barriers of black-box impossibility. Barak's techniques were subsequently extended and have given rise to various powerful applications. We present the first non-black-box simulation technique that does not rely on… (More)

- Nir Bitansky, Ran Canetti, +4 authors Alon Rosen
- CRYPTO
- 2014

In this paper we show that the existence of general indistinguishability obfuscators conjectured in a few recent works implies, somewhat counterintuitively, strong impossibility results for virtual black box obfuscation. In particular, we show that indistinguishability obfuscation for all circuits implies: • The impossibility of average-case virtual black… (More)