A Randomness-Rounds Tradeoff in Private Computation

DOI10.1137/S089548019427634XzbMATH Open0907.68101OpenAlexW2013784340MaRDI QIDQ4388979FDOQ4388979

Authors: Eyal Kushilevitz, Adi Rosén 

Publication date: 11 May 1998

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

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

Recommendations

• Publication:4940712
• Amortizing Randomness in Private Multiparty Computations
• Randomness in Private Computations
• $\Omega(\log n)$ Lower Bounds on the Amount of Randomness in 2-Private Computation
• Randomness complexity of private computation

zbMATH Keywords

sensitivitylower boundsrandomnessprivate distributed computations

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Cryptography (94A60) Distributed algorithms (68W15)

Cited In (13)

• Amortizing Randomness in Private Multiparty Computations
• Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND
• Tight bounds on the randomness complexity of secure multiparty computation
• Private computation using a PEZ dispenser.
• Title not available (Why is that?)
• $\Omega(\log n)$ Lower Bounds on the Amount of Randomness in 2-Private Computation
• More Efficient Privacy Amplification With Less Random Seeds via Dual Universal Hash Function
• Privacy and Communication Complexity
• A Theorem on Sensitivity and Applications in Private Computation
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• Lower and upper bounds on the randomness complexity of private computations of AND
• Randomness in Private Computations
• Privacy with Imperfect Randomness

This page was built for publication: A Randomness-Rounds Tradeoff in Private Computation

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