{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T16:22:10Z","timestamp":1769271730339,"version":"3.49.0"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,3,25]],"date-time":"2023-03-25T00:00:00Z","timestamp":1679702400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,25]],"date-time":"2023-03-25T00:00:00Z","timestamp":1679702400000},"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":["J Cryptol"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s00145-023-09451-9","type":"journal-article","created":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T05:02:47Z","timestamp":1679893367000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["On the Communication Efficiency of Statistically Secure Asynchronous MPC with Optimal Resilience"],"prefix":"10.1007","volume":"36","author":[{"given":"Ashish","family":"Choudhury","sequence":"first","affiliation":[]},{"given":"Arpita","family":"Patra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,25]]},"reference":[{"key":"9451_CR1","doi-asserted-by":"crossref","unstructured":"I.\u00a0Abraham, D.\u00a0Dolev, J.Y. Halpern, An Almost-surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience, in PODC (ACM, 2008), pp. 405\u2013414","DOI":"10.1145\/1400751.1400804"},{"key":"9451_CR2","doi-asserted-by":"crossref","unstructured":"I.\u00a0Abraham, D.\u00a0Dolev, G.\u00a0Stern, Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience, in PODC (ACM, 2020), pp. 139\u2013148","DOI":"10.1145\/3382734.3405722"},{"key":"9451_CR3","doi-asserted-by":"crossref","unstructured":"A.\u00a0Appan, A.\u00a0Chandramouli, A.\u00a0Choudhury, Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees, in PODC (ACM, 2022), pp. 92\u2013102","DOI":"10.1145\/3519270.3538417"},{"key":"9451_CR4","doi-asserted-by":"crossref","unstructured":"B.\u00a0Applebaum, E.\u00a0Kachlon, A.\u00a0Patra, The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract), in TCC, volume 12551 of Lecture Notes in Computer Science (Springer, 2020), pp. 562\u2013594","DOI":"10.1007\/978-3-030-64378-2_20"},{"issue":"1","key":"9451_CR5","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s00145-015-9214-4","volume":"30","author":"G Asharov","year":"2017","unstructured":"G.\u00a0Asharov, Y.\u00a0Lindell, A Full Proof of the BGW Protocol for Perfectly Secure Multiparty Computation. J. Cryptology, 30(1), 58\u2013151 (2017).","journal-title":"J. Cryptology"},{"key":"9451_CR6","doi-asserted-by":"publisher","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing: Fundamentals, Simulations, and Advanced Topics","author":"H Attiya","year":"2004","unstructured":"H. Attiya, J. Welch, Distributed Computing: Fundamentals, Simulations, and Advanced Topics, volume\u00a019. (John Wiley & Sons, 2004)."},{"key":"9451_CR7","doi-asserted-by":"crossref","unstructured":"R.\u00a0Bacho, D.\u00a0Collins, C.\u00a0Liu-Zhang, J.\u00a0Loss, Network-Agnostic Security Comes for Free in DKG and MPC. IACR Cryptol. ePrint Arch., 1369 (2022)","DOI":"10.1007\/978-3-031-38557-5_3"},{"issue":"3","key":"9451_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3388788","volume":"67","author":"L Bangalore","year":"2020","unstructured":"L.\u00a0Bangalore, A.\u00a0Choudhury, A.\u00a0Patra, The Power of Shunning: Efficient Asynchronous Byzantine Agreement Revisited. J. ACM, 67(3), 1\u201359 (2020)","journal-title":"J. ACM"},{"key":"9451_CR9","doi-asserted-by":"crossref","unstructured":"D.\u00a0Beaver, Efficient Multiparty Protocols Using Circuit Randomization, in CRYPTO, volume 576 of Lecture Notes in Computer Science (Springer, 1991), pp. 420\u2013432","DOI":"10.1007\/3-540-46766-1_34"},{"key":"9451_CR10","doi-asserted-by":"crossref","unstructured":"D.\u00a0Beaver, S.\u00a0Micali, P.\u00a0Rogaway, The Round Complexity of Secure Protocols (Extended Abstract), in STOC (ACM, 1990), pp. 503\u2013513","DOI":"10.1145\/100216.100287"},{"key":"9451_CR11","doi-asserted-by":"crossref","unstructured":"Z.\u00a0Beerliov\u00e1-Trub\u00edniov\u00e1, M.\u00a0Hirt, Efficient Multi-party Computation with Dispute Control, in TCC, volume 3876 of Lecture Notes in Computer Science (Springer, 2006), pp. 305\u2013328","DOI":"10.1007\/11681878_16"},{"key":"9451_CR12","doi-asserted-by":"crossref","unstructured":"Z.\u00a0Beerliov\u00e1-Trub\u00edniov\u00e1, M.\u00a0Hirt, Simple and Efficient Perfectly-Secure Asynchronous MPC, in ASIACRYPT, volume 4833 of Lecture Notes in Computer Science (Springer, 2007), pp. 376\u2013392.","DOI":"10.1007\/978-3-540-76900-2_23"},{"key":"9451_CR13","doi-asserted-by":"crossref","unstructured":"Z.\u00a0Beerliov\u00e1-Trub\u00edniov\u00e1, M.\u00a0Hirt, Perfectly-Secure MPC with Linear Communication Complexity, in TCC, volume 4948 of Lecture Notes in Computer Science (Springer, 2008), pp. 213\u2013230","DOI":"10.1007\/978-3-540-78524-8_13"},{"key":"9451_CR14","doi-asserted-by":"crossref","unstructured":"M.\u00a0Ben-Or, R.\u00a0Canetti, O.\u00a0Goldreich, Asynchronous Secure Computation, in STOC (ACM, 1993), pp. 52\u201361","DOI":"10.1145\/167088.167109"},{"key":"9451_CR15","doi-asserted-by":"crossref","unstructured":"M.\u00a0Ben-Or, S.\u00a0Goldwasser, A.\u00a0Wigderson, Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract), in STOC (ACM, 1988), pp. 1\u201310","DOI":"10.1145\/62212.62213"},{"key":"9451_CR16","doi-asserted-by":"crossref","unstructured":"M.\u00a0Ben-Or, B.\u00a0Kelmer, T.\u00a0Rabin, Asynchronous Secure Computations with Optimal Resilience (Extended Abstract), in PODC (ACM, 1994), pp. 183\u2013192","DOI":"10.1145\/197917.198088"},{"key":"9451_CR17","doi-asserted-by":"crossref","unstructured":"E.\u00a0Ben-Sasson, S.\u00a0Fehr, R.\u00a0Ostrovsky, Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority, in CRYPTO, volume 7417 of Lecture Notes in Computer Science (Springer, 2012), pp. 663\u2013680","DOI":"10.1007\/978-3-642-32009-5_39"},{"key":"9451_CR18","doi-asserted-by":"crossref","unstructured":"E.\u00a0Blum, C.\u00a0Liu-Zhang, J.\u00a0Loss, Always Have a Backup Plan: Fully Secure Synchronous MPC with Asynchronous Fallback, in CRYPTO, volume 12171 of Lecture Notes in Computer Science (Springer, 2020), pp. 707\u2013731","DOI":"10.1007\/978-3-030-56880-1_25"},{"key":"9451_CR19","doi-asserted-by":"crossref","unstructured":"G.\u00a0Bracha, An Asynchronous [(n-1)\/3]-Resilient Consensus Protocol, in PODC (ACM, 1984), pp. 154\u2013162","DOI":"10.1145\/800222.806743"},{"key":"9451_CR20","unstructured":"R.\u00a0Canetti, Studies in Secure Multiparty Computation and Applications. PhD thesis, Weizmann Institute, Israel (1995)"},{"key":"9451_CR21","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti, 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":"5","key":"9451_CR22","doi-asserted-by":"publisher","first-page":"28:1","DOI":"10.1145\/3402457","volume":"67","author":"R Canetti","year":"2020","unstructured":"R.\u00a0Canetti, Universally Composable Security. J. ACM, 67(5), 28:1\u201328:94 (2020)","journal-title":"J. ACM"},{"key":"9451_CR23","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti, T.\u00a0Rabin, Fast Asynchronous Byzantine agreement with Optimal Resilience, in STOC (ACM, 1993), pp. 42\u201351","DOI":"10.1145\/167088.167105"},{"key":"9451_CR24","unstructured":"A.\u00a0Chandramouli, A.\u00a0Choudhury, A.\u00a0Patra, A Survey on Perfectly-Secure Verifiable Secret-Sharing. IACR Cryptol. ePrint Arch., 445 (2021)"},{"key":"9451_CR25","doi-asserted-by":"crossref","unstructured":"D.\u00a0Chaum, C.\u00a0Cr\u00e9peau, I.\u00a0Damg\u00e5rd, Multiparty Unconditionally Secure Protocols (Extended Abstract), in STOC (ACM, 1988), pp. 11\u201319","DOI":"10.1145\/62212.62214"},{"key":"9451_CR26","doi-asserted-by":"crossref","unstructured":"A.\u00a0Chopard, M.\u00a0Hirt, C.\u00a0Liu-Zhang, On Communication-Efficient Asynchronous MPC with Adaptive Security, in TCC, volume 13043 of Lecture Notes in Computer Science (Springer, 2021), pp. 35\u201365","DOI":"10.1007\/978-3-030-90453-1_2"},{"key":"9451_CR27","doi-asserted-by":"crossref","unstructured":"A.\u00a0Choudhury, Improving the Efficiency of Optimally-Resilient Statistically-Secure Asynchronous Multi-party Computation, in INDOCRYPT, volume 12578 of Lecture Notes in Computer Science (Springer, 2020), pp. 810\u2013831","DOI":"10.1007\/978-3-030-65277-7_36"},{"key":"9451_CR28","doi-asserted-by":"crossref","unstructured":"A.\u00a0Choudhury, M.\u00a0Hirt, A.\u00a0Patra, Asynchronous Multiparty Computation with Linear Communication Complexity, in DISC, volume 8205 of Lecture Notes in Computer Science (Springer, 2013), pp. 388\u2013402","DOI":"10.1007\/978-3-642-41527-2_27"},{"key":"9451_CR29","doi-asserted-by":"crossref","unstructured":"A.\u00a0Choudhury, A.\u00a0Patra, Optimally Resilient Asynchronous MPC with Linear Communication Complexity, in ICDCN (ACM, 2015), pp. 5:1\u20135:10","DOI":"10.1145\/2684464.2684470"},{"issue":"1","key":"9451_CR30","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1109\/TIT.2016.2614685","volume":"63","author":"A Choudhury","year":"2017","unstructured":"A.\u00a0Choudhury, A.\u00a0Patra, An Efficient Framework for Unconditionally Secure Multiparty Computation. IEEE Trans. Information Theory, 63(1), 428\u2013468 (2017)","journal-title":"IEEE Trans. Information Theory"},{"key":"9451_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-12164-7","volume-title":"Secure Multi-Party Computation Against Passive Adversaries","author":"A Choudhury","year":"2022","unstructured":"A.\u00a0Choudhury, A.\u00a0Patra, Secure Multi-Party Computation Against Passive Adversaries. (Springer Cham, 2022)"},{"key":"9451_CR32","doi-asserted-by":"crossref","unstructured":"A.\u00a0Choudhury, A.\u00a0Patra, D.\u00a0Ravi, Round and Communication Efficient Unconditionally-Secure MPC with $$t < n\/3$$ in Partially Synchronous Network, in ICITS, volume 10681 of Lecture Notes in Computer Science (Springer, 2017), pp. 83\u2013109","DOI":"10.1007\/978-3-319-72089-0_6"},{"key":"9451_CR33","doi-asserted-by":"crossref","unstructured":"R.\u00a0Cohen, Asynchronous Secure Multiparty Computation in Constant Time, in PKC, volume 9615 of Lecture Notes in Computer Science (Springer, 2016), pp. 183\u2013207","DOI":"10.1007\/978-3-662-49387-8_8"},{"key":"9451_CR34","doi-asserted-by":"crossref","unstructured":"S.\u00a0Coretti, J.A. Garay, M.\u00a0Hirt, V.\u00a0Zikas, Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions, in ASIACRYPT, volume 10032 of Lecture Notes in Computer Science (2016), pp. 998\u20131021","DOI":"10.1007\/978-3-662-53890-6_33"},{"key":"9451_CR35","doi-asserted-by":"crossref","unstructured":"R.\u00a0Cramer, I.\u00a0Damg\u00e5rd, S.\u00a0Dziembowski, M.\u00a0Hirt, T.\u00a0Rabin, Efficient Multiparty Computations Secure Against an Adaptive Adversary, in EUROCRYPT, volume 1592 of Lecture Notes in Computer Science (Springer, 1999), pp. 311\u2013326","DOI":"10.1007\/3-540-48910-X_22"},{"key":"9451_CR36","doi-asserted-by":"crossref","unstructured":"R.\u00a0Cramer, I.\u00a0Damg\u00e5rd, U.M. Maurer, General Secure Multi-party Computation from any Linear Secret-Sharing Scheme, in EUROCRYPT, volume 1807 of Lecture Notes in Computer Science (Springer Verlag, 2000), pp. 316\u2013334","DOI":"10.1007\/3-540-45539-6_22"},{"key":"9451_CR37","doi-asserted-by":"crossref","unstructured":"I.\u00a0Damg\u00e5rd, J.B. Nielsen, Scalable and Unconditionally Secure Multiparty Computation, in CRYPTO, volume 4622 of Lecture Notes in Computer Science (Springer Verlag, 2007), pp. 572\u2013590","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"9451_CR38","doi-asserted-by":"crossref","unstructured":"I.\u00a0Damg\u00e5rd, V.\u00a0Pastro, N.P. Smart, S.\u00a0Zakarias, Multiparty Computation from Somewhat Homomorphic Encryption, in CRYPTO, volume 7417 of Lecture Notes in Computer Science (Springer, 2012), pp. 643\u2013662","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"9451_CR39","doi-asserted-by":"crossref","unstructured":"G.\u00a0Deligios, M.\u00a0Hirt, C.\u00a0Liu-Zhang, Round-Efficient Byzantine Agreement and Multi-party Computation with Asynchronous Fallback, in TCC, volume 13042 of Lecture Notes in Computer Science (Springer, 2021), pp. 623\u2013653","DOI":"10.1007\/978-3-030-90459-3_21"},{"key":"9451_CR40","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Dodis, S.\u00a0Micali. Parallel Reducibility for Information-Theoretically Secure Computation, in CRYPTO, volume 1880 of Lecture Notes in Computer Science (Springer, 2000), pp. 74\u201392","DOI":"10.1007\/3-540-44598-6_5"},{"issue":"2","key":"9451_CR41","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"M.J. Fischer, N.A. Lynch, M.\u00a0Paterson, Impossibility of Distributed Consensus with One Faulty Process. J. ACM, 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"9451_CR42","unstructured":"M.\u00a0Fitzi, Generalized communication and security models in Byzantine agreement. PhD thesis, ETH (Zurich, Z\u00fcrich, Switzerland, 2003)"},{"key":"9451_CR43","volume-title":"The Foundations of Cryptography - Volume 2, Basic Applications","author":"O Goldreich","year":"2004","unstructured":"O.\u00a0Goldreich, The Foundations of Cryptography - Volume 2, Basic Applications. (Cambridge University Press, 2004)"},{"key":"9451_CR44","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 STOC (ACM, 1987), pp. 218\u2013229","DOI":"10.1145\/28395.28420"},{"key":"9451_CR45","doi-asserted-by":"crossref","unstructured":"V.\u00a0Goyal, Y.\u00a0Liu, Y.\u00a0Song, Communication-Efficient Unconditional MPC with Guaranteed Output Delivery, in CRYPTO, volume 11693 of Lecture Notes in Computer Science (Springer, 2019), pp. 85\u2013114","DOI":"10.1007\/978-3-030-26951-7_4"},{"key":"9451_CR46","doi-asserted-by":"crossref","unstructured":"V.\u00a0Goyal, Y.\u00a0Song, C.\u00a0Zhu, Guaranteed Output Delivery Comes Free in Honest Majority MPC, in CRYPTO, volume 12171 of Lecture Notes in Computer Science (Springer, 2020), pp. 618\u2013646","DOI":"10.1007\/978-3-030-56880-1_22"},{"key":"9451_CR47","unstructured":"M.\u00a0Hirt, Multi-Party Computation: Efficient Protocols, General Adversaries, and Voting. PhD thesis, ETH Zurich, September 2001. Reprint as vol.\u00a03 of ETH Series in Information Security and Cryptography, ISBN 3-89649-747-2, Hartung-Gorre Verlag, Konstanz (2001)"},{"key":"9451_CR48","doi-asserted-by":"crossref","unstructured":"M.\u00a0Hirt, J.B. Nielsen, B.\u00a0Przydatek, Cryptographic Asynchronous Multi-party Computation with Optimal Resilience (Extended Abstract), in EUROCRYPT, volume 3494 of Lecture Notes in Computer Science (Springer, 2005), pp. 322\u2013340","DOI":"10.1007\/11426639_19"},{"key":"9451_CR49","doi-asserted-by":"crossref","unstructured":"M.\u00a0Hirt, J.B. Nielsen, B.\u00a0Przydatek, Asynchronous Multi-Party Computation with Quadratic Communication, in ICALP, volume 5126 of Lecture Notes in Computer Science (Springer, 2008), pp. 473\u2013485","DOI":"10.1007\/978-3-540-70583-3_39"},{"key":"9451_CR50","doi-asserted-by":"crossref","unstructured":"J.\u00a0Katz, U.\u00a0Maurer, B.\u00a0Tackmann, V.\u00a0Zikas, Universally Composable Synchronous Computation, in TCCs, volume 7785 of Lecture Notes in Computer Science (Springer, 2013), pp. 477\u2013498","DOI":"10.1007\/978-3-642-36594-2_27"},{"key":"9451_CR51","doi-asserted-by":"crossref","unstructured":"E.\u00a0Kushilevitz, Y.\u00a0Lindell, T.\u00a0Rabin, Information-theoretically Secure Protocols and Security Under Composition, in STOC (ACM, 2006), pp. 109\u2013118","DOI":"10.1145\/1132516.1132532"},{"key":"9451_CR52","unstructured":"Y.\u00a0Lindell, Secure Multiparty Computation (MPC). Cryptology ePrint Archive, Report 2020\/300 (2020)"},{"key":"9451_CR53","doi-asserted-by":"crossref","unstructured":"C.\u00a0Liu-Zhang, U.\u00a0Maurer, Synchronous Constructive Cryptography, in TCC, volume 12551 of Lecture Notes in Computer Science (Springer, 2020), pp. 439\u2013472","DOI":"10.1007\/978-3-030-64378-2_16"},{"key":"9451_CR54","volume-title":"Distributed algorithms","author":"NA Lynch","year":"1996","unstructured":"N.A. Lynch, Distributed algorithms. (Morgan Kaufmann, 1996)"},{"key":"9451_CR55","first-page":"280","volume":"2010","author":"A Patra","year":"2010","unstructured":"A.\u00a0Patra, Studies on Verifiable Secret Sharing, Byzantine Agreement and Multiparty Computation. IACR Cryptol. ePrint Arch., 2010, 280 (2010)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"9451_CR56","doi-asserted-by":"crossref","unstructured":"A.\u00a0Patra, A.\u00a0Choudhary, C.\u00a0Pandu Rangan, Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience, in ICITS, volume 5973 of Lecture Notes in Computer Science (Springer, 2009), pp. 74\u201392","DOI":"10.1007\/978-3-642-14496-7_7"},{"issue":"2","key":"9451_CR57","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s00446-013-0200-5","volume":"27","author":"A Patra","year":"2014","unstructured":"A.\u00a0Patra, A.\u00a0Choudhury, C.\u00a0Pandu Rangan, Asynchronous Byzantine Agreement with Optimal Resilience. Distributed Comput., 27(2), 111\u2013146 (2014)","journal-title":"Distributed Comput."},{"key":"9451_CR58","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00145-013-9172-7","volume":"281","author":"A Patra","year":"2015","unstructured":"A.\u00a0Patra, A.\u00a0Choudhury, C.\u00a0Pandu Rangan, Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation. J. Cryptology, 28(1), 49\u2013109 (2015)","journal-title":"J. Cryptology"},{"issue":"6","key":"9451_CR59","doi-asserted-by":"publisher","first-page":"4207","DOI":"10.1109\/TIT.2018.2827360","volume":"64","author":"A Patra","year":"2018","unstructured":"A.\u00a0Patra, D.\u00a0Ravi, On the Power of Hybrid Networks in Multi-Party Computation. IEEE Trans. Information Theory, 64(6), 4207\u20134227 (2018)","journal-title":"IEEE Trans. Information Theory"},{"issue":"2","key":"9451_CR60","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"M. Pease, R. Shostak, L. Lamport, Reaching Agreement in the Presence of Faults. Journal of the ACM (JACM), 27(2), 228\u2013234 (1980)","journal-title":"Journal of the ACM (JACM)"},{"issue":"6","key":"9451_CR61","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1145\/195613.195621","volume":"41","author":"T Rabin","year":"1994","unstructured":"T.\u00a0Rabin, Robust Sharing of Secrets When the Dealer is Honest or Cheating. J. ACM, 41(6), 1089\u20131109 (1994)","journal-title":"J. ACM"},{"key":"9451_CR62","doi-asserted-by":"crossref","unstructured":"T.\u00a0Rabin, M.\u00a0Ben-Or, Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract), in STOC (ACM, 1989), pp. 73\u201385","DOI":"10.1145\/73007.73014"},{"issue":"11","key":"9451_CR63","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"A.\u00a0Shamir, How to Share a Secret. Commun. ACM, 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"9451_CR64","doi-asserted-by":"crossref","unstructured":"A.C. Yao, Protocols for Secure Computations (Extended Abstract), in FOCS (IEEE Computer Society, 1982), pp. 160\u2013164","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09451-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-023-09451-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09451-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T17:34:20Z","timestamp":1702143260000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-023-09451-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,25]]},"references-count":64,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["9451"],"URL":"https:\/\/doi.org\/10.1007\/s00145-023-09451-9","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,25]]},"assertion":[{"value":"12 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"13"}}