{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T00:03:57Z","timestamp":1778544237834,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T00:00:00Z","timestamp":1556236800000},"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":["J Cryptol"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s00145-019-09322-2","type":"journal-article","created":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T04:09:13Z","timestamp":1556338153000},"page":"1026-1069","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ"],"prefix":"10.1007","volume":"32","author":[{"given":"Yehuda","family":"Lindell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benny","family":"Pinkas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nigel P.","family":"Smart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avishay","family":"Yanai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,26]]},"reference":[{"key":"9322_CR1","doi-asserted-by":"crossref","unstructured":"D.\u00a0Beaver, S.\u00a0Micali, P.\u00a0Rogaway, The round complexity of secure protocols, in 22nd STOC, pp. 503\u2013513, 1990","DOI":"10.1145\/100216.100287"},{"key":"9322_CR2","doi-asserted-by":"crossref","unstructured":"A.\u00a0Ben-David, N.\u00a0Nisan, B.\u00a0Pinkas, M. P. Fairplay, A system for secure multi-party computation, in ACM CCS, pp. 257\u2013266, 2008","DOI":"10.1145\/1455770.1455804"},{"key":"9322_CR3","doi-asserted-by":"crossref","unstructured":"A.\u00a0Ben-Efraim, Y.\u00a0Lindell, E.\u00a0Omri, Optimizing semi-honest secure multiparty computation for the internet, in ACM CCS, pp. 578\u2013590, 2016","DOI":"10.1145\/2976749.2978347"},{"key":"9322_CR4","doi-asserted-by":"crossref","unstructured":"A.\u00a0Ben-Efraim, Y.\u00a0Lindell, E.\u00a0Omri, Efficient scalable constant-round MPC via garbled circuits, in ASIACRYPT, pp. 471\u2013498, 2017","DOI":"10.1007\/978-3-319-70697-9_17"},{"key":"9322_CR5","doi-asserted-by":"crossref","unstructured":"M.\u00a0Ben-Or, S.\u00a0Goldwasser, A.\u00a0Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation, in 20th STOC, pp. 1\u201310, 1988","DOI":"10.1145\/62212.62213"},{"key":"9322_CR6","doi-asserted-by":"crossref","unstructured":"D.\u00a0Chaum, C.\u00a0Cr\u00e9peau, I.\u00a0Damg\u00e5rd, Multiparty unconditionally secure protocols, in 20th STOC, pp. 11\u201319, 1988","DOI":"10.1145\/62212.62214"},{"key":"9322_CR7","doi-asserted-by":"crossref","unstructured":"S.\u00a0G. Choi, J.\u00a0Katz, A.\u00a0J. Malozemoff, V.\u00a0Zikas, Efficient three-party computation from cut-and-choose, in CRYPTO, pp. 513\u2013530, 2014","DOI":"10.1007\/978-3-662-44381-1_29"},{"key":"9322_CR8","doi-asserted-by":"crossref","unstructured":"R.\u00a0Cleve, Limits on the security of coin flips when half the processors are faulty (extended abstract), in 18th STOC, pp. 364\u2013369, 1986","DOI":"10.1145\/12130.12168"},{"key":"9322_CR9","doi-asserted-by":"crossref","unstructured":"I.\u00a0Damg\u00e5rd, Y.\u00a0Ishai, Constant-round multiparty computation using a black-box pseudorandom generator, in CRYPTO, pp. 378\u2013394, 2005","DOI":"10.1007\/11535218_23"},{"key":"9322_CR10","doi-asserted-by":"crossref","unstructured":"I.\u00a0Damg\u00e5rd, M.\u00a0Keller, E.\u00a0Larraia, C.\u00a0Miles, N.\u00a0P. Smart, Implementing AES via an actively\/covertly secure dishonest-majority MPC protocol, in SCN, pp. 241\u2013263, 2012","DOI":"10.1007\/978-3-642-32928-9_14"},{"key":"9322_CR11","doi-asserted-by":"crossref","unstructured":"I.\u00a0Damg\u00e5rd, M.\u00a0Keller, E.\u00a0Larraia, V.\u00a0Pastro, P.\u00a0Scholl, N.\u00a0P. Smart, Practical covertly secure MPC for dishonest majority\u2014or: Breaking the SPDZ limits, in ESORICS, pp. 1\u201318, 2013","DOI":"10.1007\/978-3-642-40203-6_1"},{"key":"9322_CR12","doi-asserted-by":"crossref","unstructured":"I.\u00a0Damg\u00e5rd, V.\u00a0Pastro, N.\u00a0P. Smart, S.\u00a0Zakarias, Multiparty computation from somewhat homomorphic encryption, in CRYPTO, pp. 643\u2013662, 2012","DOI":"10.1007\/978-3-642-32009-5_38"},{"issue":"4","key":"9322_CR13","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539790187084","volume":"26","author":"P Feldman","year":"1997","unstructured":"P.\u00a0Feldman, S.\u00a0Micali, An optimal probabilistic protocol for synchronous byzantine agreement. SIAM Journal on Computing \n                           26(4), 873\u2013933 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"9322_CR14","doi-asserted-by":"crossref","unstructured":"O.\u00a0Goldreich, S.\u00a0Micali, A.\u00a0Wigderson, How to play any mental game or A completeness theorem for protocols with honest majority, in 19th STOC, pp. 218\u2013229, 1987","DOI":"10.1145\/28395.28420"},{"key":"9322_CR15","doi-asserted-by":"crossref","unstructured":"S.\u00a0Goldwasser, Y.\u00a0Lindell, Secure computation without agreement, in DISC, pp. 17\u201332, 2002","DOI":"10.1007\/3-540-36108-1_2"},{"key":"9322_CR16","doi-asserted-by":"crossref","unstructured":"C.\u00a0Hazay, P.\u00a0Scholl, E.\u00a0Soria-Vazquez, Low cost constant round MPC combining BMR and oblivious transfer, in ASIACRYPT, pp. 598\u2013628, 2017","DOI":"10.1007\/978-3-319-70694-8_21"},{"key":"9322_CR17","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Ishai, M.\u00a0Prabhakaran, A.\u00a0Sahai, Founding cryptography on oblivious transfer\u2014efficiently, in CRYPTO, pp. 572\u2013591, 2008","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"9322_CR18","doi-asserted-by":"crossref","unstructured":"J.\u00a0Katz, R.\u00a0Ostrovsky, A.\u00a0D. Smith, Round efficiency of multi-party computation with a dishonest majority, in EUROCRYPT, pp. 578\u2013595, 2003","DOI":"10.1007\/3-540-39200-9_36"},{"key":"9322_CR19","doi-asserted-by":"crossref","unstructured":"M.\u00a0Keller, E.\u00a0Orsini, P.\u00a0Scholl, MASCOT: faster malicious arithmetic secure computation with oblivious transfer, in ACM CCS, 2016, pp. 830\u2013842, 2016","DOI":"10.1145\/2976749.2978357"},{"key":"9322_CR20","doi-asserted-by":"crossref","unstructured":"M.\u00a0Keller, P.\u00a0Scholl, N.\u00a0P. Smart, An architecture for practical actively secure MPC with dishonest majority, in ACM CCS, pp. 549\u2013560, 2013","DOI":"10.1145\/2508859.2516744"},{"key":"9322_CR21","doi-asserted-by":"crossref","unstructured":"M.\u00a0Keller, A.\u00a0Yanai, Efficient maliciously secure multiparty computation for RAM, in EUROCRYPT, 2018, pp. 91\u2013124, 2018","DOI":"10.1007\/978-3-319-78372-7_4"},{"key":"9322_CR22","doi-asserted-by":"crossref","unstructured":"E.\u00a0Larraia, E.\u00a0Orsini, N.\u00a0P. Smart, Dishonest majority multi-party computation for binary circuits, in CRYPTO, 2014, pp. 495\u2013512, 2014","DOI":"10.1007\/978-3-662-44381-1_28"},{"key":"9322_CR23","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Lindell, Fast cut-and-choose based protocols for malicious and covert adversaries, in CRYPTO, pp. 1\u201317, 2013","DOI":"10.1007\/978-3-642-40084-1_1"},{"key":"9322_CR24","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Lindell, B.\u00a0Riva, Cut-and-choose yao-based secure computation in the online\/offline and batch settings, in CRYPTO, pp. 476\u2013494, 2014","DOI":"10.1007\/978-3-662-44381-1_27"},{"key":"9322_CR25","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Lindell, N.\u00a0P. Smart, E.\u00a0Soria-Vazquez, More efficient constant-round multi-party computation from BMR and SHE, in 14th TCC 2016-B, pp. 554\u2013581, 2016","DOI":"10.1007\/978-3-662-53641-4_21"},{"key":"9322_CR26","doi-asserted-by":"crossref","unstructured":"J.\u00a0B. Nielsen, P.\u00a0S. Nordholt, C.\u00a0Orlandi, S.\u00a0S. Burra, A new approach to practical active-secure two-party computation, in CRYPTO, pp. 681\u2013700, 2012","DOI":"10.1007\/978-3-642-32009-5_40"},{"key":"9322_CR27","doi-asserted-by":"crossref","unstructured":"R.\u00a0Pass, Bounded-concurrent secure multi-party computation with a dishonest majority, in 36th STOC, pp. 232\u2013241, 2004","DOI":"10.1145\/1007352.1007393"},{"issue":"2","key":"9322_CR28","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"MC Pease","year":"1980","unstructured":"M.\u00a0C. Pease, R.\u00a0E. Shostak, L.\u00a0Lamport, Reaching agreement in the presence of faults. Journal of ACM \n                           27(2), 228\u2013234 (1980)","journal-title":"Journal of ACM"},{"key":"9322_CR29","doi-asserted-by":"crossref","unstructured":"B.\u00a0Pinkas, T.\u00a0Schneider, N.\u00a0P. Smart, S.\u00a0C. Williams, Secure two-party computation is practical, in ASIACRYPT, pp. 250\u2013267, 2009","DOI":"10.1007\/978-3-642-10366-7_15"},{"key":"9322_CR30","doi-asserted-by":"crossref","unstructured":"T.\u00a0Rabin, M.\u00a0Ben-Or, Verifiable secret sharing and multiparty protocols with honest majority, in 21st STOC, pp. 73\u201385, 1989","DOI":"10.1145\/73007.73014"},{"key":"9322_CR31","unstructured":"P.\u00a0Rogaway, The round complexity of secure protocols. PhD thesis, Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1991"},{"key":"9322_CR32","doi-asserted-by":"crossref","unstructured":"A.\u00a0C. Yao, Protocols for secure computations, in 23rd FOCS, pp. 160\u2013164, 1982","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-019-09322-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-019-09322-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-019-09322-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,24]],"date-time":"2020-04-24T23:15:11Z","timestamp":1587770111000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-019-09322-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,26]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["9322"],"URL":"https:\/\/doi.org\/10.1007\/s00145-019-09322-2","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,26]]},"assertion":[{"value":"29 February 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}