Randomness in private computations

DOI10.1145/248052.248089zbMath1321.94070OpenAlexW2004283834MaRDI QIDQ2942730

Eyal Kushilevitz, Yishay Mansour

Publication date: 11 September 2015

Published in: Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)

Related Items

Random sources in private computation ⋮ Characterizing linear size circuits in terms of privacy