{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T05:31:21Z","timestamp":1739338281043,"version":"3.37.0"},"reference-count":81,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025,1]]},"DOI":"10.1007\/s00145-024-09523-4","type":"journal-article","created":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T18:25:45Z","timestamp":1736792745000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Guaranteed Output in $$O(\\sqrt{n})$$ Rounds for Round-Robin Sampling Protocols"],"prefix":"10.1007","volume":"38","author":[{"given":"Ran","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jack","family":"Doerner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yashvanth","family":"Kondi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhi","family":"Shelat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,13]]},"reference":[{"key":"9523_CR1","doi-asserted-by":"crossref","unstructured":"M. Abe, Mix-networks on permutation networks. in Advances in Cryptology \u2013 ASIACRYPT 1999 (1999), pp. 258\u2013273","DOI":"10.1007\/978-3-540-48000-6_21"},{"key":"9523_CR2","unstructured":"D. Abram, M. Obremski, P. Scholl, On the (im)possibility of distributed samplers: lower bounds and party-dynamic constructions (2023). http:\/\/eprint.iacr.org\/2023\/863"},{"key":"9523_CR3","doi-asserted-by":"crossref","unstructured":"D. Abram, P. Scholl, S. Yakoubov, Distributed (correlation) samplers: how to remove a trusted dealer in one round. nn Advances in Cryptology\u2014EUROCRYPT 2022, Part I (2022), pp. 790\u2013820","DOI":"10.1007\/978-3-031-06944-4_27"},{"key":"9523_CR4","doi-asserted-by":"crossref","unstructured":"D. Abram, B. Waters, M. Zhandry, Security-preserving distributed samplers: how to generate any CRS in one round without random oracles. in Advances in Cryptology\u2014CRYPTO 2023, Part I (2023), pp. 489\u2013514","DOI":"10.1007\/978-3-031-38557-5_16"},{"key":"9523_CR5","doi-asserted-by":"crossref","unstructured":"B. Alon, E. Omri, Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious. nn Proceedings of the 14th Theory of Cryptography Conference, TCC 2016-B, Part I (2016), pp. 307\u2013335","DOI":"10.1007\/978-3-662-53641-4_13"},{"key":"9523_CR6","doi-asserted-by":"crossref","unstructured":"G. Asharov, Towards characterizing complete fairness in secure two-party computation. in Proceedings of the 11th Theory of Cryptography Conference, TCC 2014 (2014), pp. 291\u2013316","DOI":"10.1007\/978-3-642-54242-8_13"},{"key":"9523_CR7","doi-asserted-by":"crossref","unstructured":"G. Asharov, A. Beimel, N. Makriyannis, E. Omri. Complete characterization of fairness in secure two-party computation of Boolean functions. in Proceedings of the 12th Theory of Cryptography Conference, TCC 2015, Part I (2015), pp. 199\u2013228","DOI":"10.1007\/978-3-662-46494-6_10"},{"key":"9523_CR8","doi-asserted-by":"crossref","unstructured":"G. Asharov, A. Jain, A. L\u00f3pez-Alt, E. Tromer, V. Vaikuntanathan, D. Wichs, Multiparty computation with low communication, computation and interaction via threshold FHE. in Advances in Cryptology\u2014EUROCRYPT 2012 (2012), pp. 483\u2013501","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"9523_CR9","doi-asserted-by":"crossref","unstructured":"G. Asharov, Y. Lindell, T. Rabin, A full characterization of functions that imply fair coin tossing and ramifications to fairness. in Proceedings of the 10th Theory of Cryptography Conference, TCC 2013 (2013), pp. 243\u2013262","DOI":"10.1007\/978-3-642-36594-2_14"},{"key":"9523_CR10","unstructured":"B. Awerbuch, M. Blum, B. Chor, S. Goldwasser, S. Micali. How to implement Bracha\u2019s $${O}(\\log n)$$ Byzantine agreement algorithm (1985). Unpublished manuscript"},{"key":"9523_CR11","doi-asserted-by":"crossref","unstructured":"C. Baum, I. Damg\u00e5rd, C. Orlandi. Publicly auditable secure multi-party computation. in Proceedings of the 9th Conference on Security and Cryptography for Networks (SCN) (2014), pp. 175\u2013196","DOI":"10.1007\/978-3-319-10879-7_11"},{"key":"9523_CR12","doi-asserted-by":"crossref","unstructured":"C. Baum, B. David, R. Dowsley, J.B. Nielsen, S. Oechsner. TARDIS: a foundation of time-lock puzzles in UC. in Advances in Cryptology\u2014EUROCRYPT 2021, Part III (2021), pp. 429\u2013459","DOI":"10.1007\/978-3-030-77883-5_15"},{"key":"9523_CR13","doi-asserted-by":"crossref","unstructured":"C. Baum, E. Orsini, P. Scholl, Efficient secure multiparty computation with identifiable abort. in Proceedings of the 14th Theory of Cryptography Conference, TCC 2016-B, Part I (2016), pp. 461\u2013490","DOI":"10.1007\/978-3-662-53641-4_18"},{"key":"9523_CR14","doi-asserted-by":"crossref","unstructured":"C. Baum, E. Orsini, P. Scholl, E. Soria-Vazquez. Efficient constant-round MPC with identifiable abort and public verifiability. in Advances in Cryptology\u2014CRYPTO 2020, Part II (2020), pp. 562\u2013592","DOI":"10.1007\/978-3-030-56880-1_20"},{"key":"9523_CR15","doi-asserted-by":"crossref","unstructured":"D. Beaver, S. Micali, P. Rogaway, The round complexity of secure protocols (extended abstract). in Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (STOC) (1990), pp. 503\u2013513","DOI":"10.1145\/100216.100287"},{"key":"9523_CR16","doi-asserted-by":"crossref","unstructured":"A. Beimel, Y. Lindell, E. Omri, I. Orlov. 1\/p-secure multiparty computation without honest majority and the best of both worlds. in Advances in Cryptology\u2014CRYPTO 2011 (2011), pp. 277\u2013296","DOI":"10.1007\/978-3-642-22792-9_16"},{"issue":"3","key":"9523_CR17","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s00145-013-9168-3","volume":"28","author":"A Beimel","year":"2015","unstructured":"A. Beimel, E. Omri, I. Orlov, Protocols for multiparty coin toss with a dishonest majority. J. Cryptol. 28(3), 551\u2013600 (2015)","journal-title":"J. Cryptol."},{"key":"9523_CR18","doi-asserted-by":"crossref","unstructured":"M. Bellare, D. Hofheinz, S. Yilek, Possibility and impossibility results for encryption and commitment secure under selective opening. in Advances in Cryptology\u2014EUROCRYPT 2009 (2009), pp. 1\u201335","DOI":"10.1007\/978-3-642-01001-9_1"},{"key":"9523_CR19","doi-asserted-by":"crossref","unstructured":"E. Ben-Sasson, A. Chiesa, M. Green, E. Tromer, M. Virza, Secure sampling of public parameters for succinct zero knowledge proofs. in Proceedings of the 36th IEEE Symposium on Security and Privacy, (S &P) (2015), pp. 287\u2013304","DOI":"10.1109\/SP.2015.25"},{"key":"9523_CR20","doi-asserted-by":"crossref","unstructured":"D. Boneh, X. Boyen, Short signatures without random oracles. in Advances in Cryptology\u2014EUROCRYPT 2004 (2004), pp. 56\u201373","DOI":"10.1007\/978-3-540-24676-3_4"},{"issue":"4","key":"9523_CR21","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1145\/502090.502094","volume":"48","author":"D Boneh","year":"2001","unstructured":"D. Boneh, M.K. Franklin, Efficient generation of shared RSA keys. J. ACM 48(4), 702\u2013722 (2001)","journal-title":"Journal of the ACM"},{"key":"9523_CR22","unstructured":"Sean Bowe. https:\/\/github.com\/ebfull\/powersoftau\/blob\/5429415959175082207fd61c10319e47a6b56e87\/src\/lib.rs#L633, 2018."},{"key":"9523_CR23","doi-asserted-by":"crossref","unstructured":"S. Bowe, A. Gabizon, M.D. Green, A multi-party protocol for constructing the public parameters of the pinocchio zk-snark. in Proceedings of the 22nd Financial Cryptography and Data Security (FC) (2018), pp. 64\u201377","DOI":"10.1007\/978-3-662-58820-8_5"},{"key":"9523_CR24","first-page":"1050","volume":"2017","author":"S Bowe","year":"2017","unstructured":"S. Bowe, A. Gabizon, I. Miers, Scalable multi-party computation for zk-snark parameters in the random beacon model. IACR Cryptol. ePrint Arch. 2017, 1050 (2017)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"9523_CR25","doi-asserted-by":"crossref","unstructured":"E. Boyle, S. Klein, A. Rosen, G. Segev, Securing Abe\u2019s mix-net against malicious verifiers via witness indistinguishability. in Proceedings of the 11th Conference on Security and Cryptography for Networks (SCN) (2018), pp. 274\u2013291","DOI":"10.1007\/978-3-319-98113-0_15"},{"issue":"4","key":"9523_CR26","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1145\/31846.42229","volume":"34","author":"G Bracha","year":"1987","unstructured":"G. Bracha, An O(log n) expected rounds randomized Byzantine generals protocol. J. ACM 34(4), 910\u2013920 (1987)","journal-title":"Journal of the ACM"},{"key":"9523_CR27","doi-asserted-by":"crossref","unstructured":"N. Buchbinder, I. Haitner, N. Levi, E. Tsfadia, Fair coin flipping: Tighter analysis and the many-party case. in Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2017), pp. 2580\u20132600","DOI":"10.1137\/1.9781611974782.170"},{"key":"9523_CR28","doi-asserted-by":"crossref","unstructured":"R. Canetti, Universally composable security: A new paradigm for cryptographic protocols. in Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (FOCS) (2001), pp. 136\u2013145","DOI":"10.1109\/SFCS.2001.959888"},{"key":"9523_CR29","doi-asserted-by":"crossref","unstructured":"R. Canetti, Universally composable security. J. ACM 67(5), 28:1\u201328:94 (2020)","DOI":"10.1145\/3402457"},{"key":"9523_CR30","doi-asserted-by":"crossref","unstructured":"R. Canetti, M. Fischlin, Universally composable commitments. in Advances in Cryptology\u2013CRYPTO 2001 (2001), pp. 19\u201340","DOI":"10.1007\/3-540-44647-8_2"},{"key":"9523_CR31","doi-asserted-by":"crossref","unstructured":"R. Canetti, Y. Lindell, R. Ostrovsky, A. Sahai, Universally composable two-party and multi-party secure computation. in Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC) (2002), pp. 494\u2013503","DOI":"10.1145\/509907.509980"},{"key":"9523_CR32","unstructured":"R. Canetti, P. Sarkar, X. Wang, Triply adaptive UC NIZK. IACR Cryptol. ePrint Arch. (2020)"},{"key":"9523_CR33","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.tcs.2019.02.001","volume":"777","author":"J Chen","year":"2019","unstructured":"J. Chen, S. Micali, Algorand: a secure and efficient distributed ledger. Theoret. Comput. Sci. 777, 155\u2013183 (2019)","journal-title":"Theoretical Computer Science"},{"key":"9523_CR34","doi-asserted-by":"crossref","unstructured":"M. Chen, R. Cohen, J. Doerner, Y. Kondi, E. Lee, S. Rosefield, A Shelat, Multiparty generation of an RSA modulus. in Advances in Cryptology\u2014CRYPTO 2020, Part III (2020), pp. 64\u201393","DOI":"10.1007\/978-3-030-56877-1_3"},{"key":"9523_CR35","doi-asserted-by":"crossref","unstructured":"M. Chen, C. Hazay, Y. Ishai, Y. Kashnikov, D. Micciancio, T. Riviere, A. Shelat, M. Venkitasubramaniam, R. Wang, Diogenes: lightweight scalable RSA modulus generation with a dishonest majority. in Proceedings of the 42nd IEEE Symposium on Security and Privacy, (S &P) (2021), pp. 590\u2013607","DOI":"10.1109\/SP40001.2021.00025"},{"key":"9523_CR36","doi-asserted-by":"crossref","unstructured":"A. Chiesa, Y. Hu, M. Maller, P. Mishra, N. Vesely, N. P. Ward, Marlin: preprocessing zksnarks with universal and updatable SRS. in Advances in Cryptology\u2014EUROCRYPT 2020, Part I (2020), pp. 738\u2013768","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"9523_CR37","doi-asserted-by":"crossref","unstructured":"R. Cleve, Limits on the security of coin flips when half the processors are faulty (extended abstract). in Proceedings of the 18th Annual ACM Symposium on Theory of Computing (STOC) (1986), pp. 364\u2013369","DOI":"10.1145\/12130.12168"},{"key":"9523_CR38","doi-asserted-by":"crossref","unstructured":"R. Cohen, J. Doerner, Y. Kondi, A. Shelat, Guaranteed output in $${O}(\\sqrt{n})$$ rounds for round-robin sampling protocols. in Advances in Cryptology\u2014EUROCRYPT 2022, Part I (2022), pp. 241\u2013271","DOI":"10.1007\/978-3-031-06944-4_9"},{"issue":"1","key":"9523_CR39","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s00145-021-09415-x","volume":"35","author":"R Cohen","year":"2022","unstructured":"R. Cohen, I. Haitner, E. Omri, L. Rotem, From fairness to full security in multiparty computation. J. Cryptol. 35(1), 4 (2022)","journal-title":"Journal of Cryptology"},{"issue":"4","key":"9523_CR40","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1007\/s00145-016-9245-5","volume":"30","author":"R Cohen","year":"2017","unstructured":"R. Cohen, Y. Lindell, Fairness versus guaranteed output delivery in secure multiparty computation. J. Cryptol. 30(4), 1157\u20131186 (2017)","journal-title":"Journal of Cryptology"},{"key":"9523_CR41","doi-asserted-by":"crossref","unstructured":"R. Cohen, A. Shelat, D. Wichs, Adaptively secure MPC with sublinear communication complexity. in Advances in Cryptology\u2014CRYPTO 2019, Part II (2019), pp. 30\u201360","DOI":"10.1007\/978-3-030-26951-7_2"},{"key":"9523_CR42","doi-asserted-by":"crossref","unstructured":"R.K. Cunningham, B. Fuller, S. Yakoubov, Catching MPC cheaters: Identification and openability. in Proceedings of the 10th International Conference on Information Theoretic Security (ICITS) (2017), pp. 110\u2013134","DOI":"10.1007\/978-3-319-72089-0_7"},{"key":"9523_CR43","doi-asserted-by":"crossref","unstructured":"D. Dachman-Soled, Revisiting fairness in MPC: polynomial number of parties and general adversarial structures. in Proceedings of the 18th Theory of Cryptography Conference, TCC 2020, Part II (2020), pp. 595\u2013620","DOI":"10.1007\/978-3-030-64378-2_21"},{"key":"9523_CR44","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, V. Pastro, N.P. Smart, S. Zakarias, Multiparty computation from somewhat homomorphic encryption. in Advances in Cryptology\u2014CRYPTO 2012 (2012), pp. 643\u2013662","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"9523_CR45","doi-asserted-by":"crossref","unstructured":"M. Fischlin, Communication-efficient non-interactive proofs of knowledge with online extractors. in Advances in Cryptology\u2014CRYPTO 2005 (2005), pp. 152\u2013168","DOI":"10.1007\/11535218_10"},{"key":"9523_CR46","doi-asserted-by":"crossref","unstructured":"P.-A. Fouque, J. Stern, One round threshold discrete-log key generation without private channels. in Proceedings of the 4th International Conference on the Theory and Practice of Public-Key Cryptography (PKC), (2001), pp. 300\u2013316","DOI":"10.1007\/3-540-44586-2_22"},{"key":"9523_CR47","doi-asserted-by":"crossref","unstructured":"T.K. Frederiksen, Y. Lindell, V. Osheter, B. Pinkas, Fast distributed RSA key generation for semi-honest and malicious adversaries. in Advances in Cryptology\u2014CRYPTO 2018, Part II (2018), pp. 331\u2013361","DOI":"10.1007\/978-3-319-96881-0_12"},{"key":"9523_CR48","doi-asserted-by":"crossref","unstructured":"G. Fuchsbauer, E. Kiltz, J. Loss, The algebraic group model and its applications. in Advances in Cryptology\u2014CRYPTO 2018, Part II (2018), pp. 33\u201362","DOI":"10.1007\/978-3-319-96881-0_2"},{"key":"9523_CR49","unstructured":"A. Gabizon, Z.J. Williamson, O. Ciobotaru. PLONK: permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. IACR Cryptol. ePrint Arch. (2019)"},{"key":"9523_CR50","doi-asserted-by":"crossref","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk, T. Rabin, Secure distributed key generation for discrete-log based cryptosystems. in Advances in Cryptology\u2014EUROCRYPT 1999 (1999), pp. 295\u2013310","DOI":"10.1007\/3-540-48910-X_21"},{"key":"9523_CR51","doi-asserted-by":"crossref","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk, T. Rabin, Secure applications of Pedersen\u2019s distributed key generation protocol. in Proceedings of the Cryptographers\u2019 Track at the RSA Conference (CT-RSA) (2003), pp. 373\u2013390","DOI":"10.1007\/3-540-36563-X_26"},{"key":"9523_CR52","doi-asserted-by":"crossref","unstructured":"Y. Gertner, S. Kannan, T. Malkin, O. Reingold, M. Viswanathan, The relationship between public key encryption and oblivious transfer. in Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS) (2000), pp. 325\u2013335","DOI":"10.1109\/SFCS.2000.892121"},{"key":"9523_CR53","doi-asserted-by":"crossref","unstructured":"O. Goldreich. Foundations of Cryptography\u2014VOLUME 2: Basic Applications. (Cambridge University Press, 2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"9523_CR54","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 Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC) (1987), pp. 218\u2013229","DOI":"10.1145\/28395.28420"},{"key":"9523_CR55","doi-asserted-by":"crossref","unstructured":"S.D. Gordon, C. Hazay, J. Katz, Y. Lindell, Complete fairness in secure two-party computation. in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC) (2008), pp. 413\u2013422","DOI":"10.1145\/1374376.1374436"},{"key":"9523_CR56","doi-asserted-by":"crossref","unstructured":"S.D. Gordon, J. Katz, Complete fairness in multi-party computation without an honest majority. in Proceedings of the 6th Theory of Cryptography Conference, TCC 2009 (2009), pp. 19\u201335","DOI":"10.1007\/978-3-642-00457-5_2"},{"key":"9523_CR57","doi-asserted-by":"crossref","unstructured":"S.D. Gordon, J. Katz. Partial fairness in secure two-party computation. J. Cryptol. 25(1), 14\u201340 (2012)","DOI":"10.1007\/s00145-010-9079-5"},{"key":"9523_CR58","doi-asserted-by":"crossref","unstructured":"J. Groth, On the size of pairing-based non-interactive arguments. in Advances in Cryptology\u2014EUROCRYPT 2016, Part II (2016), pp. 305\u2013326","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"9523_CR59","doi-asserted-by":"crossref","unstructured":"J. Groth, M. Kohlweiss, M. Maller, S. Meiklejohn, I. Miers, Updatable and universal common reference strings with applications to zk-snarks. in Advances in Cryptology\u2014CRYPTO 2018, Part III (2018), pp. 698\u2013728","DOI":"10.1007\/978-3-319-96878-0_24"},{"key":"9523_CR60","doi-asserted-by":"crossref","unstructured":"J. Groth, R. Ostrovsky, A. Sahai, New techniques for noninteractive zero-knowledge. J. ACM59(3), 11:1\u201311:35 (2012)","DOI":"10.1145\/2220357.2220358"},{"issue":"2","key":"9523_CR61","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1137\/15M1009147","volume":"46","author":"I Haitner","year":"2017","unstructured":"I. Haitner, E. Tsfadia, An almost-optimally fair three-party coin-flipping protocol. SIAM J. Comput. 46(2), 479\u2013542 (2017)","journal-title":"SIAM Journal on Computing"},{"key":"9523_CR62","doi-asserted-by":"crossref","unstructured":"C. Hazay, G.L. Mikkelsen, T. Rabin, T. Toft, A.A. Nicolosi, Efficient RSA key generation and threshold paillier in the two-party setting. J. Cryptol. 32(2), 265\u2013323 (2019)","DOI":"10.1007\/s00145-017-9275-7"},{"issue":"1","key":"9523_CR63","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M Hirt","year":"2000","unstructured":"M. Hirt, U.M. Maurer, Player simulation and general adversary structures in perfect multiparty computation. J. Cryptol. 13(1), 31\u201360 (2000)","journal-title":"Journal of Cryptology"},{"key":"9523_CR64","doi-asserted-by":"crossref","unstructured":"Y. Ishai, R. Ostrovsky, V. Zikas, Secure multi-party computation with identifiable abort. in Advances in Cryptology\u2014CRYPTO 2014, Part II (2014), pp. 369\u2013386","DOI":"10.1007\/978-3-662-44381-1_21"},{"key":"9523_CR65","doi-asserted-by":"crossref","unstructured":"Y. Ishai, M. Prabhakaran, A. Sahai, Founding cryptography on oblivious transfer: efficiently. in Advances in Cryptology\u2014CRYPTO 2008 (2008), pp. 572\u2013591","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"9523_CR66","doi-asserted-by":"crossref","unstructured":"A. Kate, G.M. Zaverucha, I. Goldberg, Constant-size commitments to polynomials and their applications. in Advances in Cryptology\u2014ASIACRYPT 2010 (2010), pp. 177\u2013194","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"9523_CR67","doi-asserted-by":"crossref","unstructured":"J. Katz, U. Maurer, B. Tackmann, V. Zikas, Universally composable synchronous computation. in Proceedings of the 10th Theory of Cryptography Conference, TCC 2013 (2013), pp. 477\u2013498","DOI":"10.1007\/978-3-642-36594-2_27"},{"key":"9523_CR68","doi-asserted-by":"crossref","unstructured":"A. Kiayias, H.-S. Zhou, V. Zikas, Fair and robust multi-party computation using a global transaction ledger. in Marc Fischlin and Jean-S\u00e9bastien Coron, editors, Advances in Cryptology\u2014EUROCRYPT 2016, Part II (2016), pp. 705\u2013734","DOI":"10.1007\/978-3-662-49896-5_25"},{"key":"9523_CR69","doi-asserted-by":"crossref","unstructured":"M. Kohlweiss, M. Maller, J. Siim, M. Volkhov, Snarky ceremonies. in Advances in Cryptology\u2014ASIACRYPT 2021, Part III (2021), pp. 98\u2013127","DOI":"10.1007\/978-3-030-92078-4_4"},{"key":"9523_CR70","doi-asserted-by":"crossref","unstructured":"C.-D. Liu-Zhang, U. Maurer, Synchronous constructive cryptography. in Proceedings of the 18th Theory of Cryptography Conference, TCC 2020, Part II (2020), pp. 439\u2013472","DOI":"10.1007\/978-3-030-64378-2_16"},{"key":"9523_CR71","doi-asserted-by":"crossref","unstructured":"N. Makriyannis, On the classification of finite Boolean functions up to fairness. in Proceedings of the 9th Conference on Security and Cryptography for Networks (SCN) (2014), pp. 135\u2013154","DOI":"10.1007\/978-3-319-10879-7_9"},{"key":"9523_CR72","doi-asserted-by":"crossref","unstructured":"M. Maller, S. Bowe, M. Kohlweiss, S. Meiklejohn, Sonic: zero-knowledge snarks from linear-size universal and updatable structured reference strings. in Proceedings of the 26th ACM Conference on Computer and Communications Security, (CCS) (2019), pp. 2111\u20132128 (2019)","DOI":"10.1145\/3319535.3339817"},{"issue":"3","key":"9523_CR73","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s00145-015-9199-z","volume":"29","author":"T Moran","year":"2016","unstructured":"T. Moran, M. Naor, G. Segev, An optimally fair coin toss. J. Cryptol. 29(3), 491\u2013513 (2016)","journal-title":"Journal of Cryptology"},{"key":"9523_CR74","first-page":"316","volume":"2003","author":"R Pass","year":"2003","unstructured":"R. Pass, On deniability in the common reference string and random oracle model. in Advances in Cryptology\u2014CRYPTO 2003 (2003), pp. 316\u2013337","journal-title":"In Advances in Cryptology - CRYPTO"},{"key":"9523_CR75","unstructured":"T.P. Pedersen, A threshold cryptosystem without a trusted party (extended abstract). in Advances in Cryptology\u2014EUROCRYPT 1991 (1991)"},{"key":"9523_CR76","doi-asserted-by":"crossref","unstructured":"A.D. Santis, G.D. Crescenzo, R. Ostrovsky, G. Persiano, A. Sahai, Robust non-interactive zero knowledge. in Advances in Cryptology\u2014CRYPTO 2001 (2001), pp. 566\u2013598","DOI":"10.1007\/3-540-44647-8_33"},{"key":"9523_CR77","doi-asserted-by":"crossref","unstructured":"C.-P. Schnorr, Efficient identification and signatures for smart cards. in Advances in Cryptology\u2014CRYPTO 1989 (1989), pp. 239\u2013252","DOI":"10.1007\/0-387-34805-0_22"},{"key":"9523_CR78","doi-asserted-by":"crossref","unstructured":"B. Schoenmakers, M. Veeningen, Universally verifiable multiparty computation from threshold homomorphic cryptosystems. in Proceedings of the 13th International Conference on Applied Cryptography and Network Security (ACNS) (2015), pp. 3\u201322","DOI":"10.1007\/978-3-319-28166-7_1"},{"key":"9523_CR79","doi-asserted-by":"crossref","unstructured":"G. Spini, S. Fehr, Cheater detection in SPDZ multiparty computation. in Proceedings of the 9th International Conference on Information Theoretic Security (ICITS) (2016), pp. 151\u2013176","DOI":"10.1007\/978-3-319-49175-2_8"},{"key":"9523_CR80","doi-asserted-by":"crossref","unstructured":"M. Stadler, Publicly verifiable secret sharing. in Advances in Cryptology\u2014EUROCRYPT 1996 (1996), pp. 190\u2013199","DOI":"10.1007\/3-540-68339-9_17"},{"key":"9523_CR81","doi-asserted-by":"crossref","unstructured":"D. Wikstr\u00f6m, A sender verifiable mix-net and a new proof of a shuffle. in Advances in Cryptology\u2014ASIACRYPT 2005 (2005), pp. 273\u2013292","DOI":"10.1007\/11593447_15"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-024-09523-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-024-09523-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-024-09523-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T21:34:22Z","timestamp":1739309662000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-024-09523-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":81,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["9523"],"URL":"https:\/\/doi.org\/10.1007\/s00145-024-09523-4","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"type":"print","value":"0933-2790"},{"type":"electronic","value":"1432-1378"}],"subject":[],"published":{"date-parts":[[2025,1]]},"assertion":[{"value":"22 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"16"}}