{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:56:38Z","timestamp":1742972198917,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031562341"},{"type":"electronic","value":"9783031562358"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-56235-8_4","type":"book-chapter","created":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T14:02:34Z","timestamp":1711634554000},"page":"62-83","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Protocols for\u00a0Oblivious Transfer and\u00a0Polynomial Evaluation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-9680-4494","authenticated-orcid":false,"given":"Aviad","family":"Ben Arie","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9681-8824","authenticated-orcid":false,"given":"Tamir","family":"Tassa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,29]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44987-6_8","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2001","author":"B Aiello","year":"2001","unstructured":"Aiello, B., Ishai, Y., Reingold, O.: Priced oblivious transfer: how to sell digital goods. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 119\u2013135. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_8"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/978-3-642-03356-8_31","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"J Alwen","year":"2009","unstructured":"Alwen, J., Katz, J., Lindell, Y., Persiano, G., shelat, A., Visconti, I.: Collusion-free multiparty computation in the mediated model. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 524\u2013540. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_31"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-540-85174-5_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"J Alwen","year":"2008","unstructured":"Alwen, J., Shelat, A., Visconti, I.: Collusion-free protocols in the mediated model. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 497\u2013514. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_28"},{"issue":"3","key":"4_CR4","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s00145-007-0327-2","volume":"20","author":"C Blundo","year":"2007","unstructured":"Blundo, C., D\u2019Arco, P., De Santis, A., Stinson, D.R.: On unconditionally secure distributed oblivious transfer. J. Cryptol. 20(3), 323\u2013373 (2007)","journal-title":"J. Cryptol."},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/3-540-47721-7_17","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"G Brassard","year":"1987","unstructured":"Brassard, G., Crepeau, C., Robert, J.-M.: All-or-nothing disclosure of secrets. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 234\u2013238. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_17"},{"doi-asserted-by":"crossref","unstructured":"Catrina, O., Kerschbaum, F.: Fostering the uptake of secure multiparty computation in e-commerce. In: ARES, pp. 693\u2013700 (2008)","key":"4_CR6","DOI":"10.1109\/ARES.2008.49"},{"issue":"6","key":"4_CR7","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"B Chor","year":"1998","unstructured":"Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private information retrieval. J. ACM 45(6), 965\u2013981 (1998)","journal-title":"J. ACM"},{"issue":"2","key":"4_CR8","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s11390-022-0878-6","volume":"37","author":"L Cianciullo","year":"2022","unstructured":"Cianciullo, L., Ghodosi, H.: Unconditionally secure oblivious polynomial evaluation: a survey and new results. J. Comput. Sci. Technol. 37(2), 443\u2013458 (2022)","journal-title":"J. Comput. Sci. Technol."},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-642-24209-0_23","volume-title":"Information Security and Cryptology - ICISC 2010","author":"CLF Corniaux","year":"2011","unstructured":"Corniaux, C.L.F., Ghodosi, H.: Scalar product-based distributed oblivious transfer. In: Rhee, K.-H., Nyang, D.H. (eds.) ICISC 2010. LNCS, vol. 6829, pp. 338\u2013354. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24209-0_23"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/11535218_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"I Damg\u00e5rd","year":"2005","unstructured":"Damg\u00e5rd, I., Ishai, Y.: Constant-round multiparty computation using a black-box pseudorandom generator. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 378\u2013394. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_23"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"114434","DOI":"10.1016\/j.eswa.2020.114434","volume":"168","author":"L Dery","year":"2021","unstructured":"Dery, L., Tassa, T., Yanai, A.: Fear not, vote truthfully: secure multiparty computation of score based rules. Expert Syst. Appl. 168, 114434 (2021)","journal-title":"Expert Syst. Appl."},{"doi-asserted-by":"crossref","unstructured":"Dery, L., Tassa, T., Yanai, A., Zamarin, A.: Demo: a secure voting system for score based elections. In: CCS, pp. 2399\u20132401 (2021)","key":"4_CR12","DOI":"10.1145\/3460120.3485343"},{"unstructured":"Du, W., Atallah, M.J.: Privacy-preserving cooperative statistical analysis. In: ACSAC, pp. 102\u2013110 (2001)","key":"4_CR13"},{"doi-asserted-by":"crossref","unstructured":"Du, W., Zhan, J.Z.: A practical approach to solve secure multi-party computation problems. In: NSPW, pp. 127\u2013135 (2002)","key":"4_CR14","DOI":"10.1145\/844102.844125"},{"issue":"6","key":"4_CR15","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM 28(6), 637\u2013647 (1985)","journal-title":"Commun. ACM"},{"doi-asserted-by":"crossref","unstructured":"Ben Horin, A., Tassa, T.: Privacy preserving collaborative filtering by distributed mediation. In: RecSys, pp. 332\u2013341 (2021)","key":"4_CR16","DOI":"10.1145\/3460231.3474251"},{"unstructured":"Ishai, Y., Kushilevitz, E.: Private simultaneous messages protocols with applications. In: ISTCS, pp. 174\u2013184 (1997)","key":"4_CR17"},{"unstructured":"Kamara, S., Mohassel, P., Raykova, M.: Outsourcing multi-party computation. IACR Cryptology ePrint Archive (2011). 272","key":"4_CR18"},{"doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: STOC, pp. 20\u201331 (1988)","key":"4_CR19","DOI":"10.1145\/62212.62215"},{"doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Kumaresan, R., Rosulek, M., Trieu, N.: Efficient batched oblivious PRF with applications to private set intersection. In: CCS, pp. 818\u2013829 (2016)","key":"4_CR20","DOI":"10.1145\/2976749.2978381"},{"doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is NOT needed: SINGLE database, computationally-private information retrieval. In: FOCS, pp. 364\u2013373 (1997)","key":"4_CR21","DOI":"10.1109\/SFCS.1997.646125"},{"issue":"6","key":"4_CR22","doi-asserted-by":"publisher","first-page":"942","DOI":"10.1007\/BF02973458","volume":"19","author":"H-D Li","year":"2004","unstructured":"Li, H.-D., Yang, X., Feng, D., Li, B.: Distributed oblivious function evaluation and its applications. J. Comput. Sci. Technol. 19(6), 942\u2013947 (2004)","journal-title":"J. Comput. Sci. Technol."},{"doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: STOC, pp. 245\u2013254 (1999)","key":"4_CR23","DOI":"10.1145\/301250.301312"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/3-540-44448-3_16","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2000","author":"M Naor","year":"2000","unstructured":"Naor, M., Pinkas, B.: Distributed oblivious transfer. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 205\u2013219. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44448-3_16"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/3-540-36231-2_31","volume-title":"Progress in Cryptology \u2014 INDOCRYPT 2002","author":"V Nikov","year":"2002","unstructured":"Nikov, V., Nikova, S., Preneel, B., Vandewalle, J.: On unconditionally secure distributed oblivious transfer. In: Menezes, A., Sarkar, P. (eds.) INDOCRYPT 2002. LNCS, vol. 2551, pp. 395\u2013408. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36231-2_31"},{"unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical Report TR-81, Aiken Computation Laboratory, Harvard University (1981)","key":"4_CR26"},{"doi-asserted-by":"crossref","unstructured":"Schneider, J.: Lean and fast secure multi-party computation: minimizing communication and local computation using a helper. In: SECRYPT, pp. 223\u2013230 (2016)","key":"4_CR27","DOI":"10.5220\/0005954202230230"},{"issue":"11","key":"4_CR28","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"4_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3375402","volume":"11","author":"E Shmueli","year":"2020","unstructured":"Shmueli, E., Tassa, T.: Mediated secure multi-party protocols for collaborative filtering. ACM Trans. Intell. Syst. Technol. 11, 1\u201325 (2020)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"issue":"1","key":"4_CR30","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s10623-010-9378-8","volume":"58","author":"T Tassa","year":"2011","unstructured":"Tassa, T.: Generalized oblivious transfer by secret sharing. Des. Codes Cryptogr. 58(1), 11\u201321 (2011)","journal-title":"Des. Codes Cryptogr."},{"key":"4_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/11787006_25","volume-title":"Automata, Languages and Programming","author":"T Tassa","year":"2006","unstructured":"Tassa, T., Dyn, N.: Multipartite secret sharing by bivariate interpolation. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 288\u2013299. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11787006_25"},{"key":"4_CR32","doi-asserted-by":"publisher","first-page":"103501","DOI":"10.1016\/j.artint.2021.103501","volume":"297","author":"T Tassa","year":"2021","unstructured":"Tassa, T., Grinshpoun, T., Yanai, A.: PC-SyncBB: a privacy preserving collusion secure DCOP algorithm. Artif. Intell. 297, 103501 (2021)","journal-title":"Artif. Intell."},{"issue":"1","key":"4_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/jmc-2012-0007","volume":"7","author":"T Tassa","year":"2013","unstructured":"Tassa, T., Jarrous, A., Ben-Ya\u2019akov, Y.: Oblivious evaluation of multivariate polynomials. J. Math. Cryptol. 7(1), 1\u201329 (2013)","journal-title":"J. Math. Cryptol."},{"doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy preserving association rule mining in vertically partitioned data. In: SIGKDD, pp. 639\u2013644 (2002)","key":"4_CR34","DOI":"10.1145\/775047.775142"},{"doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computation. In: FOCS, pp. 160\u2013164 (1982)","key":"4_CR35","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-56235-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T05:34:00Z","timestamp":1731648840000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56235-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031562341","9783031562358"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56235-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Goa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"74","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}