{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:21:37Z","timestamp":1753600897600},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T00:00:00Z","timestamp":1664236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T00:00:00Z","timestamp":1664236800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s00145-022-09434-2","type":"journal-article","created":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T20:19:36Z","timestamp":1664309976000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Perfectly Secure Computation with Optimal Resilience"],"prefix":"10.1007","volume":"35","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilad","family":"Asharov","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":[[2022,9,27]]},"reference":[{"key":"9434_CR1","doi-asserted-by":"crossref","unstructured":"I. Abraham, B. Pinkas, A. Yanai, Blinder: MPC based scalable and robust anonymous committed broadcast, in ACM CCS (2020)","DOI":"10.1145\/3372297.3417261"},{"key":"9434_CR2","unstructured":"G. Asharov, R. Cohen, O. Shochat, Static vs. adaptive security in perfect MPC: A separation and the adaptive security of BGW, in 3rd Conference on Information-Theoretic Cryptography, ITC 2022, July 5\u20137, 2022, Cambridge, MA, USA, volume 230 of LIPIcs, pp. 15:1\u201315:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"issue":"1","key":"9434_CR3","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s00145-015-9214-4","volume":"30","author":"G Asharov","year":"2017","unstructured":"G. Asharov, Y. Lindell, A full proof of the BGW protocol for perfectly secure multiparty computation. J. Cryptol., 30(1), 58\u2013151 (2017)","journal-title":"J. Cryptol."},{"key":"9434_CR4","doi-asserted-by":"crossref","unstructured":"G. Asharov, Y. Lindell, T. Rabin, Perfectly-secure multiplication for any $${t < n}\/3$$, in P. Rogaway, editor, Advances in Cryptology - CRYPTO 2011 - 31st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14\u201318, 2011. Proceedings, volume 6841 of Lecture Notes in Computer Science (Springer, 2011), pp. 240\u2013258","DOI":"10.1007\/978-3-642-22792-9_14"},{"key":"9434_CR5","unstructured":"A. Barak, D. Escudero, A.P.K. Dalskov, M. Keller, Secure evaluation of quantized neural networks. IACR Cryptol. ePrint Arch., 2019, 131 (2019)"},{"key":"9434_CR6","doi-asserted-by":"crossref","unstructured":"D. Beaver, Efficient multiparty protocols using circuit randomization, in CRYPTO (1991), pp. 420\u2013432","DOI":"10.1007\/3-540-46766-1_34"},{"key":"9434_CR7","doi-asserted-by":"crossref","unstructured":"Z. Beerliov\u00e1-Trub\u00edniov\u00e1, M. Hirt, Simple and efficient perfectly-secure asynchronous MPC, in K. Kurosawa, editor, Advances in Cryptology - ASIACRYPT 2007, 13th International Conference on the Theory and Application of Cryptology and Information Security, Kuching, Malaysia, December 2\u20136, 2007, Proceedings, volume 4833 of Lecture Notes in Computer Science (Springer, 2007), pp. 376\u2013392","DOI":"10.1007\/978-3-540-76900-2_23"},{"key":"9434_CR8","doi-asserted-by":"crossref","unstructured":"Z. Beerliov\u00e1-Trub\u00edniov\u00e1, M. Hirt, Perfectly-secure MPC with linear communication complexity, in R. Canetti, editor, Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19\u201321, 2008, volume 4948 of Lecture Notes in Computer Science (Springer, 2008), pp. 213\u2013230","DOI":"10.1007\/978-3-540-78524-8_13"},{"key":"9434_CR9","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract), in J. Simon, editor, STOC (ACM, 1988), pp. 1\u201310","DOI":"10.1145\/62212.62213"},{"key":"9434_CR10","doi-asserted-by":"crossref","unstructured":"P. Berman, J.A. Garay, K.J. Perry, Bit optimal distributed consensus, in Springer US, Boston, MA, 1992, Lecture Notes in Computer Science (1992), pp. 313\u2013321","DOI":"10.1007\/978-1-4615-3422-8_27"},{"key":"9434_CR11","unstructured":"A. Chandramouli, A. Choudhury, A. Patra, A survey on perfectly-secure verifiable secret-sharing. IACR Cryptol. ePrint Arch., 2021, 445 (2021)"},{"issue":"1","key":"9434_CR12","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"R. Canetti, Security and composition of multiparty cryptographic protocols, J. Cryptol., 13(1), 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"9434_CR13","doi-asserted-by":"crossref","unstructured":"R. Canetti, Universally composable security: A new paradigm for cryptographic protocols, in FOCS (IEEE Computer Society, 2001), pp. 136\u2013145","DOI":"10.1109\/SFCS.2001.959888"},{"issue":"3","key":"9434_CR14","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00145-004-0135-x","volume":"17","author":"R Canetti","year":"2004","unstructured":"R. Canetti, I. Damg\u00e5rd, S. Dziembowski, Y. Ishai, T. Malkin, Adaptive versus non-adaptive security of multi-party protocols, J. Cryptol., 17(3), 153\u2013207 (2004)","journal-title":"J. Cryptol."},{"key":"9434_CR15","doi-asserted-by":"crossref","unstructured":"H. Chen, M. Kim, I.P. Razenshteyn, D. Rotaru, Y. Song, S. Wagh. Maliciously secure matrix multiplication with applications to private deep learning, IACR Cryptol. ePrint Arch., 2020, 451 (2020)","DOI":"10.1007\/978-3-030-64840-4_2"},{"key":"9434_CR16","doi-asserted-by":"crossref","unstructured":"K. Chida, D. Genkin, K. Hamada, D. Ikarashi, R. Kikuchi, Y. Lindell, A. Nof, Fast large-scale honest-majority MPC for malicious adversaries, in CRYPTO (2018), pp. 34\u201364","DOI":"10.1007\/978-3-319-96878-0_2"},{"key":"9434_CR17","doi-asserted-by":"crossref","unstructured":"B. Chor, S. Goldwasser, S. Micali, B. Awerbuch, Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract), in FOCS (IEEE Computer Society, 1985), pp. 383\u2013395","DOI":"10.1109\/SFCS.1985.64"},{"issue":"1","key":"9434_CR18","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1109\/TIT.2016.2614685","volume":"63","author":"A Choudhury","year":"2017","unstructured":"A. Choudhury, A. Patra. An efficient framework for unconditionally secure multiparty computation, IEEE Trans. Inf. Theory, 63(1), 428\u2013468 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"9434_CR19","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0890-5401(92)90004-Y","volume":"97","author":"BA Coan","year":"1992","unstructured":"B.A. Coan, J.L. Welch. Modular construction of a byzantine agreement protocol with optimal message bit complexity. Inf. Comput., 97(1), 61\u201385 (1992)","journal-title":"Inf. Comput."},{"issue":"3","key":"9434_CR20","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1007\/s00145-018-9279-y","volume":"32","author":"R Cohen","year":"2019","unstructured":"R. Cohen, S. Coretti, J.A. Garay, V. Zikas. Probabilistic termination and composability of cryptographic protocols, J. Cryptol. 32(3), 690\u2013741 (2019)","journal-title":"J. Cryptol."},{"key":"9434_CR21","doi-asserted-by":"crossref","unstructured":"R. Cramer, I. Damg\u00e5rd, U.M. Maurer, General secure multi-party computation from any linear secret-sharing scheme, in EUROCRYPT (2000), pp. 316\u2013334","DOI":"10.1007\/3-540-45539-6_22"},{"key":"9434_CR22","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, J.B. Nielsen, Scalable and unconditionally secure multiparty computation, in A. Menezes, editor, CRYPTO, volume 4622 of Lecture Notes in Computer Science (Springer, 2007), pp. 572\u2013590","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"9434_CR23","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, J.B. Nielsen, Adaptive versus static security in the UC model, in S. S. M. Chow, J.\u00a0K. Liu, L.C.K. Hui, S.-M. Yiu, editors, Provable Security - 8th International Conference, ProvSec 2014, Hong Kong, China, October 9\u201310, 2014. Proceedings, volume 8782 of Lecture Notes in Computer Science (Springer, 2014), pp. 10\u201328","DOI":"10.1007\/978-3-319-12475-9_2"},{"key":"9434_CR24","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, J.B. Nielsen, A. Polychroniadou, M.A. Raskin, On the communication required for unconditionally secure multiplication, in M. Robshaw and J. Katz, editors, Advances in Cryptology - CRYPTO 2016 - 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14\u201318, 2016, Proceedings, Part II, volume 9815 of Lecture Notes in Computer Science (Springer, 2016), pp. 459\u2013488","DOI":"10.1007\/978-3-662-53008-5_16"},{"key":"9434_CR25","unstructured":"I. Damg\u00e5rd, N.I. Schwartzbach, Communication lower bounds for perfect maliciously secure MPC, IACR Cryptol. ePrint Arch., 2020, 251 (2020)"},{"key":"9434_CR26","doi-asserted-by":"crossref","unstructured":"P. Feldman, Optimal algorithms for byzantine agreement (1988)","DOI":"10.1145\/62212.62225"},{"key":"9434_CR27","doi-asserted-by":"crossref","unstructured":"P.N. Feldman, Optimal Algorithms for Byzantine Agreement. Ph.D. thesis, Massachusetts Institute of Technology (1988)","DOI":"10.1145\/62212.62225"},{"issue":"4","key":"9434_CR28","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539790187084","volume":"26","author":"P Feldman","year":"1997","unstructured":"P. Feldman, S. Micali, An optimal probabilistic protocol for synchronous byzantine agreement, SIAM J. Comput., 26(4), 873\u2013933 (1997)","journal-title":"SIAM J. Comput."},{"key":"9434_CR29","doi-asserted-by":"crossref","unstructured":"R. Gennaro, M.O. Rabin, T. Rabin, Simplified VSS and fast-track multiparty computations with applications to threshold cryptography, in B.\u00a0A. Coan and Y. Afek, editors, PODC (ACM, 1998), pp. 101\u2013111","DOI":"10.1145\/277697.277716"},{"key":"9434_CR30","doi-asserted-by":"crossref","unstructured":"O. Goldreich, The Foundations of Cryptography - Volume 2: Basic Applications (Cambridge University Press, 2004).","DOI":"10.1017\/CBO9780511721656"},{"key":"9434_CR31","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, A. Wigderson, How to play any mental game or A completeness theorem for protocols with honest majority, in A.\u00a0V. Aho, editor, STOC (ACM, 1987), pp. 218\u2013229","DOI":"10.1145\/28395.28420"},{"key":"9434_CR32","doi-asserted-by":"crossref","unstructured":"V. Goyal, Y. Liu, Y. Song, Communication-efficient unconditional MPC with guaranteed output delivery, in A. Boldyreva, D. Micciancio, editors, CRYPTO, volume 11693 of Lecture Notes in Computer Science (Springer, 2019), pp. 85\u2013114","DOI":"10.1007\/978-3-030-26951-7_4"},{"key":"9434_CR33","doi-asserted-by":"crossref","unstructured":"M. Hirt, U.M. Maurer, B. Przydatek, Efficient secure multi-party computation, in T. Okamoto, editor, Advances in Cryptology - ASIACRYPT 2000, 6th International Conference on the Theory and Application of Cryptology and Information Security, Kyoto, Japan, December 3\u20137, 2000, Proceedings, volume 1976 of Lecture Notes in Computer Science (Springer, 2000), pp. 143\u2013161","DOI":"10.1007\/3-540-44448-3_12"},{"key":"9434_CR34","doi-asserted-by":"crossref","unstructured":"M. Hirt, J.B. Nielsen, Robust multiparty computation with linear communication complexity, in C. Dwork, editor, Advances in Cryptology - CRYPTO 2006, 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20\u201324, 2006, Proceedings, volume 4117 of Lecture Notes in Computer Science (Springer, 2006), pp. 463\u2013482","DOI":"10.1007\/11818175_28"},{"issue":"2","key":"9434_CR35","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.jcss.2008.08.001","volume":"75","author":"J Katz","year":"2009","unstructured":"J. Katz, C.-Y. Koo, On expected constant-round protocols for byzantine agreement, J. Comput. Syst. Sci., 75(2), 91\u2013112 (2009)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"9434_CR36","doi-asserted-by":"publisher","first-page":"2090","DOI":"10.1137\/090755886","volume":"39","author":"E Kushilevitz","year":"2010","unstructured":"E. Kushilevitz, Y. Lindell, T. Rabin, Information-theoretically secure protocols and security under composition, SIAM J. Comput., 39(5), 2090\u20132112 (2010)","journal-title":"SIAM J. Comput."},{"key":"9434_CR37","doi-asserted-by":"crossref","unstructured":"J. Liu, M. Juuti, Y. Lu, N. Asokan, Oblivious neural network predictions via minionn transformations, in ACM CCS (2017), pp. 619\u2013631","DOI":"10.1145\/3133956.3134056"},{"key":"9434_CR38","unstructured":"P. Mohassel, P. Rindal, Aby$${}^{\\text{3}}$$: A mixed protocol framework for machine learning, in CCS (2018), pp. 35\u201352"},{"key":"9434_CR39","doi-asserted-by":"crossref","unstructured":"P. Mohassel, Y. Zhang, Secureml: A system for scalable privacy-preserving machine learning, in SP (2017), pp. 19\u201338","DOI":"10.1109\/SP.2017.12"},{"key":"9434_CR40","doi-asserted-by":"crossref","unstructured":"A. Patra, A. Choudhury, C.P. Rangan, Efficient asynchronous verifiable secret sharing and multiparty computation, J. Cryptol., 28(1), 49\u2013109 (2015)","DOI":"10.1007\/s00145-013-9172-7"},{"key":"9434_CR41","doi-asserted-by":"crossref","unstructured":"T. Rabin, M. Ben-Or, Verifiable secret sharing and multiparty protocols with honest majority (extended abstract), in D.\u00a0S. Johnson, editor, Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14\u201317, 1989, Seattle, Washington, USA (ACM, 1989), pp. 73\u201385","DOI":"10.1145\/73007.73014"},{"issue":"11","key":"9434_CR42","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"A. Shamir, How to share a secret, Commun. ACM, 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"9434_CR43","doi-asserted-by":"crossref","unstructured":"A. Verma, H. Qassim, D. Feinzimer, Residual squeeze CNDS deep learning CNN model for very large scale places image recognition, in UEMCON (2017), pp. 463\u2013469","DOI":"10.1109\/UEMCON.2017.8248975"},{"issue":"3","key":"9434_CR44","doi-asserted-by":"publisher","first-page":"26","DOI":"10.2478\/popets-2019-0035","volume":"2019","author":"S Wagh","year":"2019","unstructured":"S. Wagh, D. Gupta, N. Chandran, Securenn: 3-party secure computation for neural network training, Proc. Priv. Enhancing Technol., 2019(3), 26\u201349 (2019)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"9434_CR45","unstructured":"A.C.-C. Yao, How to generate and exchange secrets (extended abstract), in FOCS (IEEE Computer Society, 1986), pp. 162\u2013167"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-022-09434-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-022-09434-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-022-09434-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T20:00:15Z","timestamp":1728072015000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-022-09434-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,27]]},"references-count":45,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["9434"],"URL":"https:\/\/doi.org\/10.1007\/s00145-022-09434-2","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"type":"print","value":"0933-2790"},{"type":"electronic","value":"1432-1378"}],"subject":[],"published":{"date-parts":[[2022,9,27]]},"assertion":[{"value":"19 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 July 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"27"}}