Non Interactive Secure Computation
Two-party secure computation in one message each way, and the communication overhead malicious security costs there.
| Status | Statement | Tags |
|---|---|---|
|
Degree-2 Statistical RE Question 1.6 of the harvested paper, attributed there to Ishai-Kushilevitz and Applebaum-Ishai-Kushilevitz and described as open for almost 20 years. Degree-3 statistical encodings exist for every finite function; negative results are known for perfectly private degree 2. The harvested paper adds a new consequence, its Proposition 1.7. 4 open |
Arithmetic CryptographyNon Interactive Secure ComputationRandomized Encodingscharacterizationbarrier (ai) | |
|
NISC Overhead from a PRG The source poses this question and then answers the variant in which the pseudorandom generator is replaced by a random oracle, which leaves the question as posed unresolved. Each of the four relaxations – polylogarithmic overhead, correlated-abort security, extra rounds, or programmable OLE correlations – is already known. 4 open |
Garbled CircuitsNon Interactive Secure Computationcharacterizationadaptation (ai) |
No matching items