On the complexity of two-party differential privacy

DOI10.1145/3519935.3519982arXiv2108.07664OpenAlexW3193355870WikidataQ130957578 ScholiaQ130957578MaRDI QIDQ6083594

Eliad Tsfadia, Noam Mazor, Jad Silbak, Iftach Haitner

Publication date: 8 December 2023

Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.07664

zbMATH Keywords

inner productpublic-key cryptographydifferential privacy

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

On the (im)possibility of time-lock puzzles in the quantum random oracle model

This page was built for publication: On the complexity of two-party differential privacy