𝔖 Bobbio Scriptorium

✦ LIBER ✦

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

✍ Scribed by Gál, Anna; Rosén, Adi

Book ID: 118180438
Publisher: Society for Industrial and Applied Mathematics
Year: 2005
Tongue: English
Weight: 193 KB
Volume: 34
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539703432785

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Ω((n/lgn)1/2) lower bound on the numb

An Ω((n/lgn)1/2) lower bound on the number of additions necessary to compute 0–1 polynomials over the ring of integer polynomials

✍ Ronald L. Rivest; Jean-Paul Van de Wiele 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 290 KB