{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T20:15:54Z","timestamp":1770840954654,"version":"3.50.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026,1]]},"DOI":"10.1007\/s00145-025-09565-2","type":"journal-article","created":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T20:33:01Z","timestamp":1768509181000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Universally Composable Almost-Everywhere Secure Computation"],"prefix":"10.1007","volume":"39","author":[{"given":"Nishanth","family":"Chandran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pouyan","family":"Forghani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"Garay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rutvik","family":"Patel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vassilis","family":"Zikas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,15]]},"reference":[{"key":"9565_CR1","doi-asserted-by":"crossref","unstructured":"S.\u00a0Agarwal, R.\u00a0Cramer, R.\u00a0de\u00a0Haan, Asymptotically optimal two-round perfectly secure message transmission, in C.\u00a0Dwork, editor, Advances in Cryptology\u2014CRYPTO 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. 394\u2013408","DOI":"10.1007\/11818175_24"},{"key":"9565_CR2","doi-asserted-by":"crossref","unstructured":"B.\u00a0Alon, E.\u00a0Omri, A.\u00a0Paskin-Cherniavsky, MPC with friends and foes, in D.\u00a0Micciancio, T.\u00a0Ristenpart, editors, Advances in Cryptology\u2014CRYPTO 2020\u201440th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17\u201321, 2020, Proceedings, Part II, volume 12171 of Lecture Notes in Computer Science (Springer, 2020), pp. 677\u2013706","DOI":"10.1007\/978-3-030-56880-1_24"},{"key":"9565_CR3","unstructured":"G.\u00a0Asharov, R.\u00a0Cohen, O.\u00a0Shochat. Static vs. adaptive security in perfect MPC: a separation and the adaptive security of BGW, in D.\u00a0Dachman-Soled, editor, 3rd Conference on Information-Theoretic Cryptography, ITC 2022, July 5\u20137, 2022, Cambridge, MA, USA, volume 230 of LIPIcs (Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, 2022), pp. 15:1\u201315:16"},{"issue":"1","key":"9565_CR4","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. Cryptol. 30(1), 58\u2013151 (2017)","journal-title":"J. Cryptol."},{"key":"9565_CR5","doi-asserted-by":"crossref","unstructured":"M.\u00a0Backes, B.\u00a0Pfitzmann, M.\u00a0Waidner, A composable cryptographic library with nested operations, in S.\u00a0Jajodia, V.\u00a0Atluri, and T.\u00a0Jaeger, editors, Proceedings of the 10th ACM Conference on Computer and Communications Security, CCS 2003, Washington, DC, USA, October 27\u201330, 2003 (ACM, 2003), pp. 220\u2013230","DOI":"10.1145\/948109.948140"},{"key":"9565_CR6","doi-asserted-by":"crossref","unstructured":"C.\u00a0Badertscher, R.\u00a0Canetti, J.\u00a0Hesse, B.\u00a0Tackmann, V.\u00a0Zikas, Universal composition with global subroutines: capturing global setup within plain UC, in R.\u00a0Pass, K.\u00a0Pietrzak, editors, Theory of Cryptography\u201418th International Conference, TCC 2020, Durham, NC, USA, November 16\u201319, 2020, Proceedings, Part III, volume 12552 of Lecture Notes in Computer Science (Springer, 2020), pp. 1\u201330","DOI":"10.1007\/978-3-030-64381-2_1"},{"key":"9565_CR7","doi-asserted-by":"crossref","unstructured":"C.\u00a0Badertscher, U.\u00a0Maurer, D.\u00a0Tschudi, V.\u00a0Zikas, Bitcoin as a transaction ledger: a composable treatment, in J.\u00a0Katz, H.\u00a0Shacham, editors, Advances in Cryptology\u2014CRYPTO 2017\u201437th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20\u201324, 2017, Proceedings, Part I, volume 10401 of Lecture Notes in Computer Science (Springer, 2017), pp. 324\u2013356","DOI":"10.1007\/978-3-319-63688-7_11"},{"issue":"4","key":"9565_CR8","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1007\/s00145-010-9075-9","volume":"24","author":"B Barak","year":"2011","unstructured":"B.\u00a0Barak, R.\u00a0Canetti, Y.\u00a0Lindell, R.\u00a0Pass, T.\u00a0Rabin, Secure computation without authentication. J. Cryptol. 24(4), 720\u2013760 (2011)","journal-title":"J. Cryptol."},{"key":"9565_CR9","doi-asserted-by":"crossref","unstructured":"Z.\u00a0Beerliov\u00e1-Trub\u00edniov\u00e1, M.\u00a0Fitzi, M.\u00a0Hirt, U.\u00a0M. Maurer, V.\u00a0Zikas, MPC vs. SFE: perfect security in a unified corruption model, in R.\u00a0Canetti, 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. 231\u2013250","DOI":"10.1007\/978-3-540-78524-8_14"},{"key":"9565_CR10","doi-asserted-by":"crossref","unstructured":"M.\u00a0Ben-Or, S.\u00a0Goldwasser, A.\u00a0Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract), in J.\u00a0Simon, editor, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2\u20134, 1988, Chicago, Illinois, USA (ACM, 1988), pp. 1\u201310","DOI":"10.1145\/62212.62213"},{"key":"9565_CR11","doi-asserted-by":"crossref","unstructured":"E.\u00a0Boyle, R.\u00a0Cohen, D.\u00a0Data, P.\u00a0Hub\u00e1cek, Must the communication graph of MPC protocols be an expander?, in H.\u00a0Shacham, A.\u00a0Boldyreva, editors, Advances in Cryptology\u2014CRYPTO 2018\u201438th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19\u201323, 2018, Proceedings, Part III, volume 10993 of Lecture Notes in Computer Science (Springer, 2018), pp. 243\u2013272","DOI":"10.1007\/978-3-319-96878-0_9"},{"key":"9565_CR12","doi-asserted-by":"crossref","unstructured":"E.\u00a0Boyle, R.\u00a0Cohen, A.\u00a0Goel, Breaking the o($$\\surd $$ n)-bit barrier: Byzantine agreement with polylog bits per party, in A.\u00a0Miller, K.\u00a0Censor-Hillel, J.\u00a0H. Korhonen, editors, PODC \u201921: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26\u201330, 2021 (ACM, 2021), pp. 319\u2013330","DOI":"10.1145\/3465084.3467897"},{"key":"9565_CR13","doi-asserted-by":"crossref","unstructured":"J.\u00a0Camenisch, S.\u00a0Krenn, R.\u00a0K\u00fcsters, D.\u00a0Rausch, IUC: Flexible universal composability made simple, in S.\u00a0D. Galbraith, S.\u00a0Moriai, editors, Advances in Cryptology\u2014ASIACRYPT 2019\u201425th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8\u201312, 2019, Proceedings, Part III, volume 11923 of Lecture Notes in Computer Science (Springer, 2019), pp. 191\u2013221","DOI":"10.1007\/978-3-030-34618-8_7"},{"issue":"1","key":"9565_CR14","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"R.\u00a0Canetti, Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"9565_CR15","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti, Universally composable security: a new paradigm for cryptographic protocols, in 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, 14\u201317 October 2001, Las Vegas, Nevada, USA (IEEE Computer Society, 2001), pp. 136\u2013145","DOI":"10.1109\/SFCS.2001.959888"},{"key":"9565_CR16","unstructured":"R.\u00a0Canetti, Universally composable security: a new paradigm for cryptographic protocols, in Cryptology ePrint Archive, Report 2000\/067, December 2005. Latest version at https:\/\/ia.cr\/2000\/067"},{"key":"9565_CR17","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti, Y.\u00a0Dodis, R.\u00a0Pass, S.\u00a0Walfish, Universally composable security with global setup, in S.P. Vadhan, editor, Theory of Cryptography, 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands, February 21\u201324, 2007, Proceedings, volume 4392 of Lecture Notes in Computer Science (Springer, 2007), pp. 61\u201385","DOI":"10.1007\/978-3-540-70936-7_4"},{"key":"9565_CR18","unstructured":"N.\u00a0Chandran, P.\u00a0Forghani, J.\u00a0A. Garay, R.\u00a0Ostrovsky, R.\u00a0Patel, V.\u00a0Zikas, Universally composable almost-everywhere secure computation, in D.\u00a0Dachman-Soled, editor, 3rd Conference on Information-Theoretic Cryptography, ITC 2022, July 5\u20137, 2022, Cambridge, MA, USA, volume 230 of LIPIcs (Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, 2022), pp. 14:1\u201314:25"},{"key":"9565_CR19","unstructured":"N.\u00a0Chandran, J.\u00a0A. Garay, R.\u00a0Ostrovsky, Improved fault tolerance and secure computation on sparse networks, in S.\u00a0Abramsky, C.\u00a0Gavoille, C.\u00a0Kirchner, F.\u00a0M. auf\u00a0der Heide, P.\u00a0G. Spirakis, editors, Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6\u201310, 2010, Proceedings, Part II, volume 6199 of Lecture Notes in Computer Science (Springer, 2010), pp. 249\u2013260"},{"issue":"4","key":"9565_CR20","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/s00145-013-9176-3","volume":"28","author":"N Chandran","year":"2015","unstructured":"N.\u00a0Chandran, J.\u00a0A. Garay, R.\u00a0Ostrovsky, Almost-everywhere secure computation with edge corruptions. J. Cryptol. 28(4), 745\u2013768 (2015)","journal-title":"J. Cryptol."},{"key":"9565_CR21","doi-asserted-by":"crossref","unstructured":"D.\u00a0Chaum, C.\u00a0Cr\u00e9peau, I.\u00a0Damg\u00e5rd, Multiparty unconditionally secure protocols (extended abstract), in J.\u00a0Simon, editor, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2\u20134, 1988, Chicago, Illinois, USA (ACM, 1988), pp. 11\u201319","DOI":"10.1145\/62212.62214"},{"issue":"8","key":"9565_CR22","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1016\/j.jpdc.2011.03.004","volume":"71","author":"A Choudhury","year":"2011","unstructured":"A.\u00a0Choudhury, A.\u00a0Patra, B.\u00a0V. Ashwinkumar, K.\u00a0Srinathan, C.\u00a0P. Rangan, Secure message transmission in asynchronous networks. J. Parallel Distrib. Comput. 71(8), 1067\u20131074 (2011)","journal-title":"J. Parallel Distrib. Comput."},{"key":"9565_CR23","doi-asserted-by":"crossref","unstructured":"D.\u00a0Dolev, Unanimity in an unknown and unreliable environment, in 22nd Annual Symposium on Foundations of Computer Science, Nashville, Tennessee, USA, 28\u201330 October 1981 (IEEE Computer Society, 1981), pp. 159\u2013168","DOI":"10.1109\/SFCS.1981.53"},{"key":"9565_CR24","doi-asserted-by":"crossref","unstructured":"D.\u00a0Dolev, C.\u00a0Dwork, O.\u00a0Waarts, M.\u00a0Yung, Perfectly secure message transmission, in 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume I, (IEEE Computer Society, 1990), pp. 36\u201345","DOI":"10.1109\/FSCS.1990.89522"},{"issue":"1","key":"9565_CR25","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/138027.138036","volume":"40","author":"D Dolev","year":"1993","unstructured":"D.\u00a0Dolev, C.\u00a0Dwork, O.\u00a0Waarts, M.\u00a0Yung, Perfectly secure message transmission. J. ACM 40(1), 17\u201347 (1993)","journal-title":"J. ACM"},{"key":"9565_CR26","doi-asserted-by":"crossref","unstructured":"C.\u00a0Dwork, D.\u00a0Peleg, N.\u00a0Pippenger, E.\u00a0Upfal, Fault tolerance in networks of bounded degree (preliminary version), in J.\u00a0Hartmanis, editor, Proceedings of the 18th Annual ACM Symposium on Theory of Computing, May 28\u201330, 1986, Berkeley, California, USA (ACM, 1986), pp. 370\u2013379","DOI":"10.1145\/12130.12169"},{"key":"9565_CR27","doi-asserted-by":"crossref","unstructured":"M.\u00a0Fitzi, J.\u00a0A. Garay, Efficient player-optimal protocols for strong and differential consensus, in E.\u00a0Borowsky, S.\u00a0Rajsbaum, editors, Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, PODC 2003, Boston, Massachusetts, USA, July 13\u201316, 2003 (ACM, 2003), pp. 211\u2013220","DOI":"10.1145\/872035.872066"},{"key":"9565_CR28","doi-asserted-by":"crossref","unstructured":"M.\u00a0Fitzi, M.\u00a0Hirt, U.\u00a0M. Maurer, Trading correctness for privacy in unconditional multi-party computation (extended abstract), in H.\u00a0Krawczyk, editor, Advances in Cryptology\u2014CRYPTO \u201998, 18th Annual International Cryptology Conference, Santa Barbara, California, USA, August 23\u201327, 1998, Proceedings, volume 1462 of Lecture Notes in Computer Science (Springer, 1998), pp. 121\u2013136","DOI":"10.1007\/BFb0055724"},{"key":"9565_CR29","doi-asserted-by":"crossref","unstructured":"J.\u00a0A. Garay, A.\u00a0Kiayias, H.\u00a0Zhou, A framework for the sound specification of cryptographic tasks, in Proceedings of the 23rd IEEE Computer Security Foundations Symposium, CSF 2010, Edinburgh, United Kingdom, July 17\u201319, 2010 (IEEE Computer Society, 2010), pp. 277\u2013289","DOI":"10.1109\/CSF.2010.26"},{"key":"9565_CR30","doi-asserted-by":"crossref","unstructured":"J.\u00a0A. Garay, R.\u00a0Ostrovsky. Almost-everywhere secure computation, in N.\u00a0P. Smart, editor, Advances in Cryptology\u2014EUROCRYPT 2008, 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul, Turkey, April 13\u201317, 2008. Proceedings, volume 4965 of Lecture Notes in Computer Science (Springer, 2008), pp. 307\u2013323","DOI":"10.1007\/978-3-540-78967-3_18"},{"key":"9565_CR31","unstructured":"J.\u00a0A. Garay, K.\u00a0J. Perry. A continuum of failure models for distributed computing, in A.\u00a0Segall and S.\u00a0Zaks, editors, Distributed Algorithms, 6th International Workshop, WDAG \u201992, Haifa, Israel, November 2\u20134, 1992, Proceedings, volume 647 of Lecture Notes in Computer Science (Springer, 1992), pp. 153\u2013165"},{"key":"9565_CR32","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 A.\u00a0V. Aho, editor, Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, New York, New York, USA (ACM, 1987), pp. 218\u2013229","DOI":"10.1145\/28395.28420"},{"key":"9565_CR33","unstructured":"J.\u00a0Griggio, Perfectly secure message transmission protocols with low communication overhead and their generalization. PhD thesis, Universiteit Leiden (2012)"},{"key":"9565_CR34","doi-asserted-by":"crossref","unstructured":"M.\u00a0Hirt, U.\u00a0M. Maurer, Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract), in J.\u00a0E. Burns, H.\u00a0Attiya, editors, Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, Santa Barbara, California, USA, August 21\u201324, 1997 (ACM, 1997), pp. 25\u201334","DOI":"10.1145\/259380.259412"},{"issue":"3","key":"9565_CR35","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s00145-013-9160-y","volume":"28","author":"D Hofheinz","year":"2015","unstructured":"D.\u00a0Hofheinz, V.\u00a0Shoup, GNUC: A new universal composability framework. J. Cryptol. 28(3), 423\u2013508 (2015)","journal-title":"J. Cryptol."},{"key":"9565_CR36","doi-asserted-by":"crossref","unstructured":"S.\u00a0Jayanti, S.\u00a0Raghuraman, N.\u00a0Vyas, Efficient constructions for almost-everywhere secure computation, in A.\u00a0Canteaut, Y.\u00a0Ishai, editors, Advances in Cryptology - EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10\u201314, 2020, Proceedings, Part II, volume 12106 of Lecture Notes in Computer Science (Springer, 2020), pp. 159\u2013183","DOI":"10.1007\/978-3-030-45724-2_6"},{"key":"9565_CR37","doi-asserted-by":"crossref","unstructured":"J.\u00a0Katz, U.\u00a0Maurer, B.\u00a0Tackmann, V.\u00a0Zikas, Universally composable synchronous computation, in A.\u00a0Sahai, editor, Theory of Cryptography\u201410th Theory of Cryptography Conference, TCC 2013, Tokyo, Japan, March 3\u20136, 2013. Proceedings, volume 7785 of Lecture Notes in Computer Science (Springer, 2013), pp. 477\u2013498","DOI":"10.1007\/978-3-642-36594-2_27"},{"key":"9565_CR38","doi-asserted-by":"crossref","unstructured":"V.\u00a0King, J.\u00a0Saia, From almost everywhere to everywhere: Byzantine agreement with \u00f5(n$$ ^{\\text{3\/2}}$$) bits, in I.\u00a0Keidar, editor, Distributed Computing, 23rd International Symposium, DISC 2009, Elche, Spain, September 23\u201325, 2009. Proceedings, volume 5805 of Lecture Notes in Computer Science (Springer, 2009), pp. 464\u2013478","DOI":"10.1007\/978-3-642-04355-0_47"},{"key":"9565_CR39","doi-asserted-by":"crossref","unstructured":"K.\u00a0Kurosawa, K.\u00a0Suzuki, Truly efficient 2-round perfectly secure message transmission scheme, in N.\u00a0P. Smart, editor, Advances in Cryptology - EUROCRYPT 2008, 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul, Turkey, April 13\u201317, 2008. Proceedings, volume 4965 of Lecture Notes in Computer Science (Springer, 2008), pp. 324\u2013340","DOI":"10.1007\/978-3-540-78967-3_19"},{"issue":"3","key":"9565_CR40","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"L.\u00a0Lamport, R.\u00a0E. Shostak, M.\u00a0C. Pease, The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9565_CR41","doi-asserted-by":"crossref","unstructured":"A.\u00a0Lubotzky, R.\u00a0Phillips, P.\u00a0Sarnak, Explicit expanders and the ramanujan conjectures, in J.\u00a0Hartmanis, editor, Proceedings of the 18th Annual ACM Symposium on Theory of Computing, May 28\u201330, 1986, Berkeley, California, USA (ACM, 1986), pp. 240\u2013246","DOI":"10.1145\/12130.12154"},{"key":"9565_CR42","unstructured":"U.\u00a0Maurer, R.\u00a0Renner, Abstract cryptography, in B.\u00a0Chazelle, editor, Innovations in Computer Science\u2014ICS 2011, Tsinghua University, Beijing, China, January 7\u20139, 2011. Proceedings (Tsinghua University Press, 2011), pp. 1\u201321"},{"key":"9565_CR43","unstructured":"J.\u00a0Nielsen, On Protocol Security in the Cryptographic Model. PhD thesis, University of Aarhus (2003)"},{"issue":"2","key":"9565_CR44","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. J. ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"issue":"1","key":"9565_CR45","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1006\/inco.1996.0033","volume":"126","author":"HM Sayeed","year":"1996","unstructured":"H.\u00a0M. Sayeed, H.\u00a0Abu-Amara, Efficient perfectly secure message transmission in synchronous networks. Inf. Comput. 126(1), 53\u201361 (1996)","journal-title":"Inf. Comput."},{"key":"9565_CR46","doi-asserted-by":"crossref","unstructured":"G.\u00a0Spini, G.\u00a0Z\u00e9mor, Perfectly secure message transmission in two rounds, in M.\u00a0Hirt, A.\u00a0D. Smith, editors, Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31\u2013November 3, 2016, Proceedings, Part I, volume 9985 of Lecture Notes in Computer Science (2016), pp. 286\u2013304","DOI":"10.1007\/978-3-662-53641-4_12"},{"key":"9565_CR47","doi-asserted-by":"crossref","unstructured":"K.\u00a0Srinathan, A.\u00a0Narayanan, C.\u00a0P. Rangan, Optimal perfectly secure message transmission, in M.\u00a0K. Franklin, editor, Advances in Cryptology\u2014CRYPTO 2004, 24th Annual International CryptologyConference, Santa Barbara, California, USA, August 15\u201319, 2004, Proceedings, volume 3152 of Lecture Notes in Computer Science (Springer, 2004), pp. 545\u2013561","DOI":"10.1007\/978-3-540-28628-8_33"},{"key":"9565_CR48","doi-asserted-by":"crossref","unstructured":"E.\u00a0Upfal, Tolerating linear number of faults in networks of bounded degree, in N.\u00a0C. Hutchinson, editor, Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, August 10\u201312, 1992 (ACM, 1992), pp. 83\u201389","DOI":"10.1145\/135419.135437"},{"key":"9565_CR49","doi-asserted-by":"crossref","unstructured":"A.\u00a0C. Yao, Protocols for secure computations (extended abstract), in 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3-5 November 1982 (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-025-09565-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-025-09565-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-025-09565-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T20:00:17Z","timestamp":1770840017000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-025-09565-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["9565"],"URL":"https:\/\/doi.org\/10.1007\/s00145-025-09565-2","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"19 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"12"}}