#### Filter Results:

- Full text PDF available (25)

#### Publication Year

2010

2017

- This year (2)
- Last 5 years (25)
- Last 10 years (38)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer
- ITCS
- 2011

The existence of succinct non-interactive arguments for NP (i.e., non-interactive computationally-sound proofs where the verifier's work is essentially independent of the complexity of the NPâ€¦ (More)

- Nir Bitansky, Ran Canetti
- Journal of Cryptology
- 2010

The Virtual Black Box (VBB) property for program obfuscators provides a strong guarantee: anything computable by an efficient adversary, given the obfuscated program, can also be computed by anâ€¦ (More)

- Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen
- STOC
- 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â€¦ (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â€¦ (More)

- Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer
- STOC
- 2012

<i>Succinct non-interactive arguments of knowledge</i> (SNARKs) enable verifying NP statements with complexity that is essentially independent of that required for classical NP verification. Inâ€¦ (More)

- Nir Bitansky, Vinod Vaikuntanathan
- 2015 IEEE 56th Annual Symposium on Foundations ofâ€¦
- 2015

Indistinguishability obfuscation (IO) is a tremendous notion, powerful enough to give rise to almost any known cryptographic object. So far, candidate IO constructions were based on specificâ€¦ (More)

- Nir Bitansky, Omer Paneth
- TCC
- 2012

We construct 3-round proofs and arguments with negligible soundness error satisfying two relaxed notions of zero-knowledge (ZK): weak ZK and witness hiding (WH). At the heart of our constructions lieâ€¦ (More)

- Nir Bitansky, Ran Canetti, Shai Halevi
- TCC
- 2011

We put forth a framework for expressing security requirements from interactive protocols in the presence of arbitrary leakage. This allows capturing different levels of leakage tolerance ofâ€¦ (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â€¦ (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â€¦ (More)