Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Gilad Asharov:

TR16-092 | 3rd June 2016
Gilad Asharov, Alon Rosen, Gil Segev

Indistinguishability Obfuscation Does Not Reduce to Structured Languages

Revisions: 1

We prove that indistinguishability obfuscation (iO) and one-way functions do not naturally reduce to any language within $NP \cap coNP$. This is proved within the framework introduced by Asharov and Segev (FOCS '15) that captures the vast majority of techniques that have been used so far in iO-based constructions.

Our ... more >>>

TR11-036 | 17th March 2011
Gilad Asharov, Yehuda Lindell

A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation

Revisions: 4

In the setting of secure multiparty computation, a set of $n$ parties with private inputs wish to jointly compute some functionality of their inputs. One of the most fundamental results of information-theoretically secure computation was presented by Ben-Or, Goldwasser and Wigderson (BGW) in 1988. They demonstrated that any $n$-party functionality ... more >>>

ISSN 1433-8092 | Imprint