{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T15:03:30Z","timestamp":1767971010398,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,9]]},"DOI":"10.1145\/3519935.3519982","type":"proceedings-article","created":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T15:29:32Z","timestamp":1654874972000},"page":"1392-1405","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["On the complexity of two-party differential privacy"],"prefix":"10.1145","author":[{"given":"Iftach","family":"Haitner","sequence":"first","affiliation":[{"name":"Tel Aviv University, Israel"}]},{"given":"Noam","family":"Mazor","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Israel"}]},{"given":"Jad","family":"Silbak","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Israel"}]},{"given":"Eliad","family":"Tsfadia","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Israel"}]}],"member":"320","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_25"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2979676"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"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\u2013634.  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\u2013634.","DOI":"10.1007\/978-3-662-53641-4_23"},{"key":"e_1_3_2_1_4_1","volume-title":"European Symposium on Algorithms. 277\u2013288","author":"Hubert Chan TH","year":"2012","unstructured":"TH Hubert Chan , Elaine Shi , and Dawn Song . 2012 . Optimal lower bound for differentially private multi-party aggregation . In European Symposium on Algorithms. 277\u2013288 . TH Hubert Chan, Elaine Shi, and Dawn Song. 2012. Optimal lower bound for differentially private multi-party aggregation. In European Symposium on Algorithms. 277\u2013288."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773173"},{"key":"e_1_3_2_1_6_1","volume-title":"Ourselves: Privacy Via Distributed Noise Generation. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT). 486\u2013503","author":"Dwork Cynthia","year":"2006","unstructured":"Cynthia Dwork , Krishnaram Kenthapadi , Frank McSherry , Ilya Mironov , and Moni Naor . 2006 . Our Data , Ourselves: Privacy Via Distributed Noise Generation. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT). 486\u2013503 . Cynthia Dwork, Krishnaram Kenthapadi, Frank McSherry, Ilya Mironov, and Moni Naor. 2006. Our Data, Ourselves: Privacy Via Distributed Noise Generation. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT). 486\u2013503."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Cynthia Dwork Frank McSherry Kobbi Nissim and Adam Smith. 2006. Calibrating Noise to Sensitivity in Private Data Analysis. In Theory of Cryptography (TCC). 265\u2013284.  Cynthia Dwork Frank McSherry Kobbi Nissim and Adam Smith. 2006. Calibrating Noise to Sensitivity in Private Data Analysis. In Theory of Cryptography (TCC). 265\u2013284.","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_1_8_1","volume-title":"The Price of Privacy and the Limits of LP Decoding. In Annual ACM Symposium on Theory of Computing (STOC). 85\u201394","author":"Dwork Cynthia","year":"2007","unstructured":"Cynthia Dwork , Frank McSherry , and Kunal Talwar . 2007 . The Price of Privacy and the Limits of LP Decoding. In Annual ACM Symposium on Theory of Computing (STOC). 85\u201394 . Cynthia Dwork, Frank McSherry, and Kunal Talwar. 2007. The Price of Privacy and the Limits of LP Decoding. In Annual ACM Symposium on Theory of Computing (STOC). 85\u201394."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28628-8_32"},{"key":"e_1_3_2_1_10_1","volume-title":"New Efficient Attacks on Statistical Disclosure Control Mechanisms. In Annual International Cryptology Conference (CRYPTO). 469\u2013\u2013480","author":"Dwork Cynthia","year":"2008","unstructured":"Cynthia Dwork and Sergey Yekhanin . 2008 . New Efficient Attacks on Statistical Disclosure Control Mechanisms. In Annual International Cryptology Conference (CRYPTO). 469\u2013\u2013480 . Cynthia Dwork and Sergey Yekhanin. 2008. New Efficient Attacks on Statistical Disclosure Control Mechanisms. In Annual International Cryptology Conference (CRYPTO). 469\u2013\u2013480."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/6490.6503"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Oded Goldreich Silvio Micali and Avi Wigderson. 1987. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. 218\u2013229.  Oded Goldreich Silvio Micali and Avi Wigderson. 1987. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. 218\u2013229.","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_13_1","volume-title":"24th International Colloquium (ICALP). 29:1\u201329:15","author":"Goyal Vipul","year":"2016","unstructured":"Vipul Goyal , Dakshita Khurana , Ilya Mironov , Omkant Pandey , and Amit Sahai . 2016 . Do distributed differentially-private protocols require oblivious transfer? In Automata, Languages and Programming , 24th International Colloquium (ICALP). 29:1\u201329:15 . Vipul Goyal, Dakshita Khurana, Ilya Mironov, Omkant Pandey, and Amit Sahai. 2016. Do distributed differentially-private protocols require oblivious transfer? In Automata, Languages and Programming, 24th International Colloquium (ICALP). 29:1\u201329:15."},{"key":"e_1_3_2_1_14_1","volume-title":"Accuracy-Privacy Tradeoffs for Two-Party Differentially Private Protocols","author":"Goyal Vipul","unstructured":"Vipul Goyal , Ilya Mironov , Omkant Pandey , and Amit Sahai . 2013. Accuracy-Privacy Tradeoffs for Two-Party Differentially Private Protocols . In CRYPTO. Springer , 298\u2013315. Vipul Goyal, Ilya Mironov, Omkant Pandey, and Amit Sahai. 2013. Accuracy-Privacy Tradeoffs for Two-Party Differentially Private Protocols. In CRYPTO. Springer, 298\u2013315."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Adam Groce Jonathan Katz and Arkady Yerukhimovich. 2011. Limits of computational differential privacy in the client\/server setting. In Theory of Cryptography (TCC). 417\u2013431.  Adam Groce Jonathan Katz and Arkady Yerukhimovich. 2011. Limits of computational differential privacy in the client\/server setting. In Theory of Cryptography (TCC). 417\u2013431.","DOI":"10.1007\/978-3-642-19571-6_25"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Iftach Haitner Noam Mazor Ronen Shaltiel and Jad Silbak. 2019. Channels of small log-ratio leakage and characterization of two-party differentially private computation. In Theory of Cryptography (TCC). 531\u2013560.  Iftach Haitner Noam Mazor Ronen Shaltiel and Jad Silbak. 2019. Channels of small log-ratio leakage and characterization of two-party differentially private computation. In Theory of Cryptography (TCC). 531\u2013560.","DOI":"10.1007\/978-3-030-36030-6_21"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Iftach Haitner Noam Mazor Jad Silbak and Eliad Tsfadia. 2021. On the Complexity of Two-Party Differential Privacy. arXiv preprint arXiv:2108.07664.  Iftach Haitner Noam Mazor Jad Silbak and Eliad Tsfadia. 2021. On the Complexity of Two-Party Differential Privacy. arXiv preprint arXiv:2108.07664.","DOI":"10.1145\/3519935.3519982"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/080725404"},{"key":"e_1_3_2_1_19_1","first-page":"1041","article-title":"Computational Two-Party Correlation","volume":"49","author":"Haitner Iftach","year":"2020","unstructured":"Iftach Haitner , Kobbi Nissim , Eran Omri , Ronen Shaltiel , and Jad Silbak . 2020 . Computational Two-Party Correlation : A Dichotomy for Key-Agreement Protocols. SIAM J. Comput. , 49 , 6 (2020), 1041 \u2013 1082 . Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, and Jad Silbak. 2020. Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. SIAM J. Comput., 49, 6 (2020), 1041\u20131082.","journal-title":"A Dichotomy for Key-Agreement Protocols. SIAM J. Comput."},{"key":"e_1_3_2_1_20_1","series-title":"SIAM J. Comput., 389\u2013\u2013409. Preliminary version in FOCS\u201911","volume-title":"Coin Flipping with Constant Bias Implies One-Way Functions","author":"Haitner Iftach","unstructured":"Iftach Haitner and Eran Omri . 2014. Coin Flipping with Constant Bias Implies One-Way Functions . SIAM J. Comput., 389\u2013\u2013409. Preliminary version in FOCS\u201911 . Iftach Haitner and Eran Omri. 2014. Coin Flipping with Constant Bias Implies One-Way Functions. SIAM J. Comput., 389\u2013\u2013409. Preliminary version in FOCS\u201911."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-014-9194-9"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/100814421"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_6"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73012"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217022"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.14"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_8"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196774"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921856"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100269"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(86)90044-9"},{"key":"e_1_3_2_1_34_1","volume-title":"Tutorials on the Foundations of Cryptography","author":"Vadhan Salil","unstructured":"Salil Vadhan . 2017. The complexity of differential privacy . In Tutorials on the Foundations of Cryptography . Springer , 347\u2013450. Salil Vadhan. 2017. The complexity of differential privacy. In Tutorials on the Foundations of Cryptography. Springer, 347\u2013450."},{"key":"e_1_3_2_1_35_1","volume-title":"Characterizing Pseudoentropy and Simplifying Pseudorandom Generator Constructions. In Annual ACM Symposium on Theory of Computing (STOC). 817\u2013836","author":"Vadhan Salil","year":"2012","unstructured":"Salil Vadhan and Colin Jia Zheng . 2012 . Characterizing Pseudoentropy and Simplifying Pseudorandom Generator Constructions. In Annual ACM Symposium on Theory of Computing (STOC). 817\u2013836 . Salil Vadhan and Colin Jia Zheng. 2012. Characterizing Pseudoentropy and Simplifying Pseudorandom Generator Constructions. In Annual ACM Symposium on Theory of Computing (STOC). 817\u2013836."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1965.10480775"}],"event":{"name":"STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing","location":"Rome Italy","acronym":"STOC '22","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3519982","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519935.3519982","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:39Z","timestamp":1750268979000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3519982"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":35,"alternative-id":["10.1145\/3519935.3519982","10.1145\/3519935"],"URL":"https:\/\/doi.org\/10.1145\/3519935.3519982","relation":{},"subject":[],"published":{"date-parts":[[2022,6,9]]},"assertion":[{"value":"2022-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}