{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T20:16:11Z","timestamp":1767989771845,"version":"3.49.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032018830","type":"print"},{"value":"9783032018847","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-032-01884-7_6","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T09:31:14Z","timestamp":1755336674000},"page":"174-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Computationally Differentially Private Inner-Product Protocols Imply Oblivious Transfer"],"prefix":"10.1007","author":[{"given":"Iftach","family":"Haitner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noam","family":"Mazor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jad","family":"Silbak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eliad","family":"Tsfadia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/978-3-662-53641-4_23","volume-title":"Theory of Cryptography","author":"M Bun","year":"2016","unstructured":"Bun, M., Chen, Y.-H., Vadhan, S.: Separating computational and statistical differential privacy in the client-server model. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9985, pp. 607\u2013634. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53641-4_23"},{"key":"6_CR2","unstructured":"Bangalore, L., Cheu, A., Venkitasubramaniam, M.: PRIME: differentially private distributed mean estimation with malicious security. Cryptology ePrint Archive, p. 1771 (2024)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Bittau, A., et al.: Prochlo: strong privacy for analytics in the crowd. In: Proceedings of the 26th Symposium on Operating Systems Principles, SOSP 2017, pp. 441\u2013459 (2017)","DOI":"10.1145\/3132747.3132769"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"B\u00f6hler, J., Kerschbaum, F.: Secure multi-party computation of differentially private median. In: 29th USENIX Security Symposium, USENIX Security 2020, pp. 2147\u2013 2164. USENIX Association (2020)","DOI":"10.14722\/ndss.2020.24150"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-85174-5_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"A Beimel","year":"2008","unstructured":"Beimel, A., Nissim, K., Omri, E.: Distributed private data analysis: simultaneously solving how and what. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 451\u2013468. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_25"},{"key":"6_CR6","unstructured":"Cheu, A.: Differential privacy in the shuffle model: a survey of separations. CoRR abs\/2107.11839 (2021)"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-33090-2_25","volume-title":"Algorithms \u2013 ESA 2012","author":"T-HH Chan","year":"2012","unstructured":"Chan, T.-H.H., Shi, E., Song, D.: Optimal lower bound for differentially private multi-party aggregation. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 277\u2013288. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33090-2_25"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-030-17653-2_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"A Cheu","year":"2019","unstructured":"Cheu, A., Smith, A., Ullman, J., Zeber, D., Zhilyaev, M.: Distributed differential privacy via shuffling. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 375\u2013403. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_13"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/11761679_29","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"C Dwork","year":"2006","unstructured":"Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., Naor, M.: Our data, ourselves: privacy via distributed noise generation. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 486\u2013503. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_29"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Keller, H., Nelson, B., Orlandi, C., Pagh, R.: Differentially private selection from secure distributed computing. In: Proceedings of the ACM on Web Conference 2024, WWW 2024, pp. 1103\u20131114. ACM (2024)","DOI":"10.1145\/3589334.3645435"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"Theory of Cryptography","author":"C Dwork","year":"2006","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265\u2013284. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_14"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Dwork, C., Nissim, K.: Privacy-preserving datamining on vertically partitioned databases. In: Annual International Cryptology Conference, pp. 528\u2013544 (2004)","DOI":"10.1007\/978-3-540-28628-8_32"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Ghazi, B., Ilango, R., Kamath, P., Kumar, R., Manurangsi, P.: Towards separating computational and statistical differential privacy. In: 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, pp. 580\u2013599 (2023)","DOI":"10.1109\/FOCS57990.2023.00042"},{"key":"6_CR14","unstructured":"Gertner, Y., Kannan, S., Malkin, T., Reingold, O., Viswanathan, M.: The relationship between public key encryption and oblivious transfer. In: Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (2000)"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-642-19571-6_25","volume-title":"Theory of Cryptography","author":"A Groce","year":"2011","unstructured":"Groce, A., Katz, J., Yerukhimovich, A.: Limits of computational differential privacy in the client\/server setting. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 417\u2013431. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_25"},{"key":"6_CR16","unstructured":"Goyal, V., Khurana, D., Mironov, I., Pandey, O., Sahai, A.: Do distributed differentially-private protocols require oblivious transfer? In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) (2016)"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-642-40041-4_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"V Goyal","year":"2013","unstructured":"Goyal, V., Mironov, I., Pandey, O., Sahai, A.: Accuracy-privacy tradeoffs for two-party differentially private protocols. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 298\u2013315. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_17"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography \u2013 Volume 2: Basic Applications. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-030-36030-6_21","volume-title":"Theory of Cryptography","author":"I Haitner","year":"2019","unstructured":"Haitner, I., Mazor, N., Shaltiel, R., Silbak, J.: Channels of small log-ratio leakage and characterization of two-party differentially private computation. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 531\u2013560. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_21"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Haitner, I., Mazor, N., Silbak, J., Tsfadia, E.: On the complexity of two-party differential privacy. In: STOC 2022: 54th Annual ACM SIGACT Symposium on Theory of Computing, pp. 1392\u20131405. ACM (2022)","DOI":"10.1145\/3519935.3519982"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Haitner, I., Mazor, N., Silbak, J., Tsfadia, E., Yan, C.: Computationally differentially private inner product protocols imply oblivious transfer (2025). arXiv:2502.15629 [cs.CR]","DOI":"10.1007\/978-3-032-01884-7_6"},{"issue":"6","key":"6_CR23","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1137\/19M1236837","volume":"49","author":"I Haitner","year":"2020","unstructured":"Haitner, I., Nissim, K., Omri, E., Shaltiel, R., Silbak, J.: Computational two-party correlation: a dichotomy for key-agreement protocols. SIAM J. Comput. 49(6), 1041\u20131082 (2020)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"6_CR24","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s00145-014-9194-9","volume":"29","author":"I Haitner","year":"2016","unstructured":"Haitner, I., Omri, E., Zarosim, H.: Limits on the usefulness of random oracles. J. Cryptol. 29(2), 283\u2013335 (2016)","journal-title":"J. Cryptol."},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"McGregor, A., Mironov, I., Pitassi, T., Reingold, O., Talwar, K., Vadhan, S.: The limits of two-party differential privacy. In: 51st Annual Symposium on Foundations of Computer Science (FOCS), pp. 81\u201390 (2010)","DOI":"10.1109\/FOCS.2010.14"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-03356-8_8","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"I Mironov","year":"2009","unstructured":"Mironov, I., Pandey, O., Reingold, O., Vadhan, S.: Computational differential privacy. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 126\u2013142. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_8"},{"issue":"1","key":"6_CR27","doi-asserted-by":"publisher","first-page":"420","DOI":"10.56553\/popets-2025-0023","volume":"2025","author":"F Meisingseth","year":"2025","unstructured":"Meisingseth, F., Rechberger, C.: SoK: computational and distributed differential privacy for MPC. Proc. Priv. Enhancing Technol. 2025(1), 420\u2013439 (2025)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"6_CR28","unstructured":"Rabin, M.O.: How to Exchange Secrets by Oblivious Transfer. TR-81, Harvard (1981)"},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/978-3-540-72540-4_32","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"J Wullschleger","year":"2007","unstructured":"Wullschleger, J.: Oblivious-transfer amplification. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 555\u2013572. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_32"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-642-00457-5_20","volume-title":"Theory of Cryptography","author":"J Wullschleger","year":"2009","unstructured":"Wullschleger, J.: Oblivious transfer from weak noisy channels. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 332\u2013349. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_20"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01884-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T14:58:40Z","timestamp":1757429920000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01884-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018830","9783032018847"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01884-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}