Lower and upper bounds on the randomness complexity of private computations of AND

DOI10.1007/978-3-030-36033-7_15MaRDI QIDQ2175947zbMATH OpenOpenAlexFDO

Authors Eyal Kushilevitz, Rafail Ostrovsky, Emmanuel Prouff, Adrian Thillard, Damien Vergnaud, Adi Rosén

Publication date 30 April 2020

Full work available at URL https://doi.org/10.1007/978-3-030-36033-7_15

zbMATH Keywords

multi-party information-theoretic private protocols

Mathematics Subject Classification ID

Distributed systems (68M14) Cryptography (94A60)

Recommendations

• Lower and upper bounds on the randomness complexity of private computations of AND
• Random sources in private computation
• Randomness complexity of private computation
• Tight bounds on the randomness complexity of secure multiparty computation
• $\Omega(\log n)$ Lower Bounds on the Amount of Randomness in 2-Private Computation

Cites work

• $\Omega(\log n)$ Lower Bounds on the Amount of Randomness in 2-Private Computation
• A communication-privacy tradeoff for modular addition
• A full proof of the BGW protocol for perfectly secure multiparty computation
• A Randomness-Rounds Tradeoff in Private Computation
• A Theorem on Sensitivity and Applications in Private Computation
• A Zero-One Law for Boolean Privacy
• Amortizing Randomness in Private Multiparty Computations
• Characterizing linear size circuits in terms of privacy
• Communication and Randomness Lower Bounds for Secure Computation
• Extracting randomness: A survey and new constructions
• scientific article; zbMATH DE number 1030984 (Why is no real title available?)
• scientific article; zbMATH DE number 1962807 (Why is no real title available?)
• scientific article; zbMATH DE number 7559107 (Why is no real title available?)
• On the communication required for unconditionally secure multiplication
• Randomness complexity of private computation
• Randomness in Private Computations
• Unconditionally secure computation with reduced interaction

Cited in

(6)

• Randomness complexity of private computation
• Communication and Randomness Lower Bounds for Secure Computation
• scientific article; zbMATH DE number 1759657 (Why is no real title available?)
• Lower and upper bounds on the randomness complexity of private computations of AND
• Random sources in private computation
• Randomness in private sequential stateless protocols

This page was built for publication: Lower and upper bounds on the randomness complexity of private computations of AND

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175947)