✦ LIBER ✦

Randomness in Private Computations

✍ Scribed by Kushilevitz, Eyal; Mansour, Yishay

Book ID: 118198943
Publisher: Society for Industrial and Applied Mathematics
Year: 1997
Tongue: English
Weight: 297 KB
Volume: 10
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480196306130

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Low-randomness constant-round private XO

Low-randomness constant-round private XOR computations

✍ Carlo Blundo; Clemente Galdi; Giuseppe Persiano 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 343 KB

Randomness complexity of private computa

Randomness complexity of private computation

✍ C. Blundo; A. De Santis; G. Persiano; U. Vaccaro 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 422 KB

A Randomness-Rounds Tradeoff in Private

A Randomness-Rounds Tradeoff in Private Computation

✍ Kushilevitz, Eyal; Rosén, Adi 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 361 KB

Reducibility and Completeness in Private

Reducibility and Completeness in Private Computations

✍ Kilian, Joe; Kushilevitz, Eyal; Micali, Silvio; Ostrovsky, Rafail 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 410 KB

$\Omega(\log n)$ Lower Bounds on the Amo

$\Omega(\log n)$ Lower Bounds on the Amount of Randomness in 2-Private Computation

✍ Gál, Anna; Rosén, Adi 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 193 KB

On private computation in incomplete net

On private computation in incomplete networks

✍ Amos Beimel 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 597 KB