Lower bounds on the amount of randomness in private computation

DOI10.1145/780542.780638zbMath1192.68362OpenAlexW2086915908MaRDI QIDQ3581281

Anna Gál, Adi Rosén

Publication date: 16 August 2010

Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/780542.780638

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network protocols (68M12)

Related Items (2)

Random sources in private computation ⋮ On the Communication Required for Unconditionally Secure Multiplication

This page was built for publication: Lower bounds on the amount of randomness in private computation