{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T06:06:54Z","timestamp":1747375614972},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030351984"},{"type":"electronic","value":"9783030351991"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-35199-1_8","type":"book-chapter","created":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T00:02:46Z","timestamp":1575849766000},"page":"154-177","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Commodity-Based 2PC for Arithmetic Circuits"],"prefix":"10.1007","author":[{"given":"Ivan","family":"Damg\u00e5rd","sequence":"first","affiliation":[]},{"given":"Helene","family":"Haagh","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Nielsen","sequence":"additional","affiliation":[]},{"given":"Claudio","family":"Orlandi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,18]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-319-63688-7_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"B Applebaum","year":"2017","unstructured":"Applebaum, B., Damg\u00e5rd, I., Ishai, Y., Nielsen, M., Zichron, L.: Secure arithmetic computation with constant computational overhead. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 223\u2013254. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-63688-7_8"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-03549-4_20","volume-title":"Financial Cryptography and Data Security","author":"P Bogetoft","year":"2009","unstructured":"Bogetoft, P., et al.: Secure multiparty computation goes live. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol. 5628, pp. 325\u2013343. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-03549-4_20"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y.: Compressing vector OLE. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, Toronto, ON, Canada, 15\u201319 October 2018, pp. 896\u2013912 (2018)","DOI":"10.1145\/3243734.3243868"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Beaver, D.: Commodity-based cryptography (extended abstract). In: Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, El Paso, Texas, USA, 4\u20136 May 1997, pp. 446\u2013455 (1997)","DOI":"10.1145\/258533.258637"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-540-88313-5_13","volume-title":"Computer Security - ESORICS 2008","author":"D Bogdanov","year":"2008","unstructured":"Bogdanov, D., Laur, S., Willemson, J.: Sharemind: a framework for fast privacy-preserving computations. In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol. 5283, pp. 192\u2013206. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-88313-5_13"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"D\u00f6ttling, N., Ghosh, S., Nielsen, J.B., Nilges, T., Trifiletti, R.: Tinyole: efficient actively secure two-party computation from oblivious linear function evaluation. In: CCS, pp. 2263\u20132276. ACM (2017)","DOI":"10.1145\/3133956.3134024"},{"key":"8_CR8","unstructured":"Damg\u00e5rd, I., Haagh, H., Nielsen, M., Orlandi, C.: Commodity-based 2PC for arithmetic circuits. Cryptology ePrint Archive, Report 2019\/705 (2019). \nhttps:\/\/eprint.iacr.org\/2019\/705"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-540-78524-8_22","volume-title":"Theory of Cryptography","author":"D Harnik","year":"2008","unstructured":"Harnik, D., Ishai, Y., Kushilevitz, E., Nielsen, J.B.: OT-combiners via secure computation. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 393\u2013411. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-78524-8_22"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/11426639_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"D Harnik","year":"2005","unstructured":"Harnik, D., Kilian, J., Naor, M., Reingold, O., Rosen, A.: On robust combiners for oblivious transfer and other primitives. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 96\u2013113. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11426639_6"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/978-3-642-36594-2_34","volume-title":"Theory of Cryptography","author":"Y Ishai","year":"2013","unstructured":"Ishai, Y., Kushilevitz, E., Meldgaard, S., Orlandi, C., Paskin-Cherniavsky, A.: On the power of correlated randomness in secure computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 600\u2013620. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-36594-2_34"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Jakobsen, T.P., Nielsen, J.B., Orlandi, C.: A framework for outsourcing of secure computation. In: Proceedings of the 6th Edition of the ACM Workshop on Cloud Computing Security, CCSW 2014, Scottsdale, Arizona, USA, 7 November 2014, pp. 81\u201392 (2014)","DOI":"10.1145\/2664168.2664170"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Keller, M., Orsini, E., Scholl, P.: MASCOT: faster malicious arithmetic secure computation with oblivious transfer. In: ACM Conference on Computer and Communications Security, pp. 830\u2013842. ACM (2016)","DOI":"10.1145\/2976749.2978357"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-319-78372-7_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"M Keller","year":"2018","unstructured":"Keller, M., Pastro, V., Rotaru, D.: Overdrive: making SPDZ great again. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 158\u2013189. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-78372-7_6"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, Atlanta, Georgia, USA, 1\u20134 May 1999, pp. 245\u2013254 (1999)","DOI":"10.1145\/301250.301312"},{"key":"8_CR16","unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. IACR Cryptology ePrint Archive 2005:187 (2005)"},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10207-014-0247-8","volume":"14","author":"T Rafael","year":"2015","unstructured":"Rafael, T., et al.: Information-theoretically secure oblivious polynomial evaluation in the commodity-based model. Int. J. Inf. Secur. 14(1), 73\u201384 (2015)","journal-title":"Int. J. Inf. Secur."}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35199-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T00:07:52Z","timestamp":1575850072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-35199-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030351984","9783030351991"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35199-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"18 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IMACC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IMA International Conference on Cryptography and Coding","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ima2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ima.org.uk\/11167\/17th-ima-international-conference-on-cryptography-and-coding\/","order":11,"name":"conference_url","label":"Conference URL","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":"31","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":"17","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":"55% - 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":"2.5","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":"7","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)"}}]}}