On the complexity of two-party differential privacy-Reference-Cited by-同舟云学术

On the complexity of two-party differential privacy

Published:2022-06-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Haitner Iftach¹,Mazor Noam¹,Silbak Jad¹,Tsfadia Eliad¹

Affiliation:

1. Tel Aviv University, Israel

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3519935.3519982

Reference35 articles.

1. Distributed Private Data Analysis: Simultaneously Solving How and What

2. Coin Flipping of Any Constant Bias Implies One-Way Functions

3. Mark Bun Yi-Hsiu Chen and Salil Vadhan. 2016. Separating computational and statistical differential privacy in the client-server model. In Theory of Cryptography (TCC). 607–634. Mark Bun Yi-Hsiu Chen and Salil Vadhan. 2016. Separating computational and statistical differential privacy in the client-server model. In Theory of Cryptography (TCC). 607–634.

4. TH Hubert Chan , Elaine Shi , and Dawn Song . 2012 . Optimal lower bound for differentially private multi-party aggregation . In European Symposium on Algorithms. 277–288 . TH Hubert Chan, Elaine Shi, and Dawn Song. 2012. Optimal lower bound for differentially private multi-party aggregation. In European Symposium on Algorithms. 277–288.

5. Revealing information while preserving privacy

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Towards Separating Computational and Statistical Differential Privacy;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. On the (Im)possibility of Time-Lock Puzzles in the Quantum Random Oracle Model;Advances in Cryptology – ASIACRYPT 2023;2023

3. On the complexity of two-party differential privacy;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

4. On the Impossibility of Key Agreements from Quantum Random Oracles;Advances in Cryptology – CRYPTO 2022;2022