{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T03:34:33Z","timestamp":1781062473524,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,10,15]],"date-time":"2018-10-15T00:00:00Z","timestamp":1539561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100010663","name":"European Research Council","doi-asserted-by":"publisher","award":["615172"],"award-info":[{"award-number":["615172"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,10,15]]},"DOI":"10.1145\/3243734.3243854","type":"proceedings-article","created":{"date-parts":[[2018,10,16]],"date-time":"2018-10-16T17:38:33Z","timestamp":1539711513000},"page":"880-895","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["Generalizing the SPDZ Compiler For Other Protocols"],"prefix":"10.1145","author":[{"given":"Toshinori","family":"Araki","sequence":"first","affiliation":[{"name":"NEC, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Assi","family":"Barak","sequence":"additional","affiliation":[{"name":"Bar-Ilan University, Ramat Gan, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jun","family":"Furukawa","sequence":"additional","affiliation":[{"name":"NEC Israel Research Center, Tel Aviv, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marcel","family":"Keller","sequence":"additional","affiliation":[{"name":"Data61, Sydney, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yehuda","family":"Lindell","sequence":"additional","affiliation":[{"name":"Bar-Ilan University, Ramat Gan, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kazuma","family":"Ohara","sequence":"additional","affiliation":[{"name":"NEC, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hikaru","family":"Tsuchida","sequence":"additional","affiliation":[{"name":"NEC, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,10,15]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"arry-Select Adder Wikipedia March 2018.https:\/\/en.wikipedia.org\/wiki\/Carry-select_adder  arry-Select Adder Wikipedia March 2018.https:\/\/en.wikipedia.org\/wiki\/Carry-select_adder"},{"key":"e_1_3_2_2_2_1","volume-title":"Aaron Steele. Secure Computation on Floating Point Numbers. In NDSS 2013","author":"Aliasgari Mehrdad","year":"2013","unstructured":"Mehrdad Aliasgari , Marina Blanton , Yihua Zhang , and Aaron Steele. Secure Computation on Floating Point Numbers. In NDSS 2013 , 2013 . Mehrdad Aliasgari, Marina Blanton, Yihua Zhang, and Aaron Steele. Secure Computation on Floating Point Numbers. In NDSS 2013, 2013."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.15"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978331"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/646756.705383"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100287"},{"key":"e_1_3_2_2_7_1","volume-title":"SPDZ software. https:\/\/www.cs.bris.ac.uk\/Research\/CryptographySecurity\/SPDZ\/","author":"Bristol Cryptography Group","year":"2016","unstructured":"Bristol Cryptography Group . SPDZ software. https:\/\/www.cs.bris.ac.uk\/Research\/CryptographySecurity\/SPDZ\/ , 2016 . Bristol Cryptography Group. SPDZ software. https:\/\/www.cs.bris.ac.uk\/Research\/CryptographySecurity\/SPDZ\/, 2016."},{"key":"e_1_3_2_2_8_1","first-page":"80","volume-title":"Alina Weber and Stefan Katzenbeisser.Compiling Low Depth Circuits for Practical Secure Computation. In ESORICS 2016","author":"Buscher Niklas","year":"2016","unstructured":"Niklas Buscher , Andreas Holzer , Alina Weber and Stefan Katzenbeisser.Compiling Low Depth Circuits for Practical Secure Computation. In ESORICS 2016 , pages 80 -- 98 , 2016 . Niklas Buscher, Andreas Holzer, Alina Weber and Stefan Katzenbeisser.Compiling Low Depth Circuits for Practical Secure Computation. In ESORICS 2016, pages 80--98, 2016."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/3207756"},{"key":"e_1_3_2_2_10_1","volume-title":"Catrina and Sebastiaan de Hoogh. Secure Multiparty Linear Programming Using Fixed-Point Arithmetic. In ESORICS 2010","author":"Octavian","year":"2010","unstructured":"Octavian Catrina and Sebastiaan de Hoogh. Secure Multiparty Linear Programming Using Fixed-Point Arithmetic. In ESORICS 2010 , Springer (LNCS 6345), pages 134--150 , 2010 . Octavian Catrina and Sebastiaan de Hoogh. Secure Multiparty Linear Programming Using Fixed-Point Arithmetic. In ESORICS 2010, Springer (LNCS 6345), pages 134--150, 2010."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14577-3_6"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_15"},{"key":"e_1_3_2_2_13_1","first-page":"1","volume-title":"Practical Covertly Secure MPC for Dishonest Majority - or: Breaking the SPDZ Limits. In $18$th ESORICS","author":"Damg\u00e5rd I.","year":"2013","unstructured":"I. Damg\u00e5rd , M. Keller , E. Larraia , V. Pastro , P. Scholl and N.P. Smart . Practical Covertly Secure MPC for Dishonest Majority - or: Breaking the SPDZ Limits. In $18$th ESORICS , pages 1 -- 18 , 2013 . I. Damg\u00e5rd, M. Keller, E. Larraia, V. Pastro, P. Scholl and N.P. Smart. Practical Covertly Secure MPC for Dishonest Majority - or: Breaking the SPDZ Limits. In $18$th ESORICS, pages 1--18, 2013."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54807-9_15"},{"key":"e_1_3_2_2_16_1","first-page":"225","volume-title":"High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest MajorityIn EUROCRYPT","author":"Furukawa J.","year":"2017","unstructured":"J. Furukawa , Y. Lindell , A. Nof and O. Weinstein . High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest MajorityIn EUROCRYPT 2017 , Springer (LNCS 10211), pages 225 -- 255 , 2017. J. Furukawa, Y. Lindell, A. Nof and O. Weinstein. High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest MajorityIn EUROCRYPT 2017, Springer (LNCS 10211), pages 225--255, 2017."},{"key":"e_1_3_2_2_17_1","first-page":"598","volume-title":"Eduardo Soria-Vazquez. Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. In ASIACRYPT 2017 Springer (LNCS 10624)","author":"Hazay Carmit","year":"2017","unstructured":"Carmit Hazay , Peter Scholl , and Eduardo Soria-Vazquez. Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. In ASIACRYPT 2017 Springer (LNCS 10624) , pages 598 -- 628 , 2017 . Carmit Hazay, Peter Scholl, and Eduardo Soria-Vazquez. Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. In ASIACRYPT 2017 Springer (LNCS 10624), pages 598--628, 2017."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978357"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78372-7_6"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516744"},{"key":"e_1_3_2_2_22_1","volume-title":"Keller and Avishay Yanai. Efficient Maliciously Secure Multiparty Computation for RAM. In EUROCRYPT 2018","author":"Marcel","year":"2018","unstructured":"Marcel Keller and Avishay Yanai. Efficient Maliciously Secure Multiparty Computation for RAM. In EUROCRYPT 2018 , Springer (LNCS 10822), pages 91--124 , 2018 . Marcel Keller and Avishay Yanai. Efficient Maliciously Secure Multiparty Computation for RAM. In EUROCRYPT 2018, Springer (LNCS 10822), pages 91--124, 2018."},{"key":"e_1_3_2_2_23_1","volume-title":"ORAM in SPDZ-BMR","author":"Keller Marcel","year":"2018","unstructured":"Marcel Keller and Avishay Yanay . ORAM in SPDZ-BMR , 2018 . https:\/\/github.com\/mkskeller\/SPDZ-BMR-ORAM. Marcel Keller and Avishay Yanay. ORAM in SPDZ-BMR, 2018. https:\/\/github.com\/mkskeller\/SPDZ-BMR-ORAM."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133999"},{"key":"e_1_3_2_2_25_1","volume-title":"Avishay Yanai. Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ. In CRYPTO 2015","author":"Lindell Yehuda","year":"2015","unstructured":"Yehuda Lindell , Benny Pinkas , Nigel P. Smart , and Avishay Yanai. Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ. In CRYPTO 2015 , Springer (LNCS 9216), pages 319--338 , 2015 . Yehuda Lindell, Benny Pinkas, Nigel P. Smart, and Avishay Yanai. Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ. In CRYPTO 2015, Springer (LNCS 9216), pages 319--338, 2015."},{"key":"e_1_3_2_2_26_1","volume-title":"Modular Multiplication Without Trial Division. Mathematics of Computation, 44:519--521","author":"Montgomery Peter L.","year":"1985","unstructured":"Peter L. Montgomery . Modular Multiplication Without Trial Division. Mathematics of Computation, 44:519--521 , 1985 . Peter L. Montgomery. Modular Multiplication Without Trial Division. Mathematics of Computation, 44:519--521, 1985."},{"key":"e_1_3_2_2_27_1","first-page":"343","volume-title":"Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol. In the $10$th PKC","author":"Nishide T.","year":"2007","unstructured":"T. Nishide and K. Ohta . Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol. In the $10$th PKC , Springer (LNCS 4450), pages 343 -- 360 , 2007 . T. Nishide and K. Ohta. Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol. In the $10$th PKC, Springer (LNCS 4450), pages 343--360, 2007."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Vivek Kumar Singh Burcin Bozkaya Alex Pentland Money Walks: Implicit Mobility Behavior and Financial Well-Being PLoS ONE 10(8): e0136628.  Vivek Kumar Singh Burcin Bozkaya Alex Pentland Money Walks: Implicit Mobility Behavior and Financial Well-Being PLoS ONE 10(8): e0136628.","DOI":"10.1371\/journal.pone.0136628"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.32"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00862-7_24"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134053"}],"event":{"name":"CCS '18: 2018 ACM SIGSAC Conference on Computer and Communications Security","location":"Toronto Canada","acronym":"CCS '18","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3243734.3243854","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3243734.3243854","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:47Z","timestamp":1750208267000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3243734.3243854"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,15]]},"references-count":30,"alternative-id":["10.1145\/3243734.3243854","10.1145\/3243734"],"URL":"https:\/\/doi.org\/10.1145\/3243734.3243854","relation":{},"subject":[],"published":{"date-parts":[[2018,10,15]]},"assertion":[{"value":"2018-10-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}