Randomness in Private Computations

DOI10.1137/S0895480196306130MaRDI QIDQ4377451zbMATH OpenFDO

Authors Eyal Kushilevitz, Yishay Mansour

Publication date 9 February 1998

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0895480196306130

zbMATH Keywords

privacyrandomnesssmall probability spacesxor function

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Cryptography (94A60)

Recommendations

• Randomness complexity of private computation
• Random sources in private computation
• A Randomness-Rounds Tradeoff in Private Computation
• scientific article; zbMATH DE number 1406796
• Randomness complexity of private circuits for multiplication
• On the number of random bits in totally private computation
• Privacy with Imperfect Randomness
• Amortizing randomness complexity in private circuits

Cited in

(28)

• Private computation using a PEZ dispenser.
• Forward induction and public randomization
• Randomness complexity of private computation
• Randomness versus fault-tolerance
• Private circuits with quasilinear randomness
• Lower and upper bounds on the randomness complexity of private computations of AND
• Distribution design
• On the communication required for unconditionally secure multiplication
• Privacy with Imperfect Randomness
• scientific article; zbMATH DE number 1284001 (Why is no real title available?)
• Computing with Very Weak Random Sources
• A Randomness-Rounds Tradeoff in Private Computation
• scientific article; zbMATH DE number 1962807 (Why is no real title available?)
• Amortizing Randomness in Private Multiparty Computations
• scientific article; zbMATH DE number 1759657 (Why is no real title available?)
• On the number of random bits in totally private computation
• scientific article; zbMATH DE number 1406796 (Why is no real title available?)
• Preserving randomness for adaptive algorithms
• A lower bound for sampling disjoint sets
• scientific article; zbMATH DE number 7559107 (Why is no real title available?)
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• $\Omega(\log n)$ Lower Bounds on the Amount of Randomness in 2-Private Computation
• Lower and upper bounds on the randomness complexity of private computations of AND
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• Anonymous random allocation and its applications
• Tight bounds on the randomness complexity of secure multiparty computation
• VSS Made Simpler
• Randomness in distribution protocols

This page was built for publication: Randomness in Private Computations

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