Randomness in private computations

DOI10.1145/248052.248089MaRDI QIDQ2942730zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(3)

• Characterizing linear size circuits in terms of privacy
• Random sources in private computation
• Randomness in private sequential stateless 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 Q2942730)