{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T00:30:10Z","timestamp":1766449810634,"version":"3.40.3"},"publisher-location":"Cham","reference-count":89,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031683961"},{"type":"electronic","value":"9783031683978"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-68397-8_2","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T22:01:41Z","timestamp":1723759301000},"page":"36-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Secure Multiparty Computation with\u00a0Identifiable Abort via\u00a0Vindicating Release"],"prefix":"10.1007","author":[{"given":"Ran","family":"Cohen","sequence":"first","affiliation":[]},{"given":"Jack","family":"Doerner","sequence":"additional","affiliation":[]},{"given":"Yashvanth","family":"Kondi","sequence":"additional","affiliation":[]},{"given":"Abhi","family":"Shelat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Abram, D., Doerner, J., Ishai, Y., Narayanan, V.: Constant-round simulation-secure coin tossing extension with guaranteed output. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024, Part V. LNCS, vol. 14655, pp. 122\u2013154. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58740-5_5","DOI":"10.1007\/978-3-031-58740-5_5"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Abram, D., Nof, A., Orlandi, C., Scholl, P., Shlomovits, O.: Low-bandwidth threshold ECDSA via pseudorandom correlation generators. In: Proceedings of the 43rd IEEE Symposium on Security and Privacy, (S &P) (2022)","DOI":"10.1109\/SP46214.2022.9833559"},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Alon, B., Chung, H., Chung, K.M., Huang, M.Y., Lee, Y., Shen, Y.C.: Round efficient secure multiparty quantum computation with identifiable abort. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part I. LNCS, vol. 12825, pp. 436\u2013466. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_16","DOI":"10.1007\/978-3-030-84242-0_16"},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Alon, B., Omri, E.: Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious. In: Hirt, M., Smith, A. (eds.) TCC 2016, Part I. LNCS, vol. 9985, pp. 307\u2013335. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53641-4_13","DOI":"10.1007\/978-3-662-53641-4_13"},{"issue":"2","key":"2_CR5","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00145-009-9040-7","volume":"23","author":"Y Aumann","year":"2010","unstructured":"Aumann, Y., Lindell, Y.: Security against covert adversaries: efficient protocols for realistic adversaries. J. Cryptol. 23(2), 281\u2013343 (2010)","journal-title":"J. Cryptol."},{"key":"2_CR6","unstructured":"Baum, C., Melissaris, N., Rachuri, R., Scholl, P.: Cheater identification on a budget: MPC with identifiable abort from pairwise macs. Cryptology ePrint Archive, Paper 2023\/1548 (2023). https:\/\/eprint.iacr.org\/2023\/1548"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Baum, C., Orsini, E., Scholl, P.: Efficient secure multiparty computation with identifiable abort. In: Hirt, M., Smith, A. (eds.) TCC 2016-B, Part I. LNCS, vol. 9985, pp. 461\u2013490. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53641-4_18","DOI":"10.1007\/978-3-662-53641-4_18"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Baum, C., Orsini, E., Scholl, P., Soria-Vazquez, E.: Efficient constant-round MPC with identifiable abort and public verifiability. In Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part II. LNCS, vol. 12171, pp. 562\u2013592. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_20","DOI":"10.1007\/978-3-030-56880-1_20"},{"key":"2_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/3-540-44750-4_8","volume-title":"CRYPTO 1995","author":"D Beaver","year":"1995","unstructured":"Beaver, D.: Precomputing oblivious transfer. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 97\u2013109. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-44750-4_8"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols (extended abstract). In: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (STOC), pp. 503\u2013513 (1990)","DOI":"10.1145\/100216.100287"},{"key":"2_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-22792-9_16","volume-title":"CRYPTO 2011","author":"A Beimel","year":"2011","unstructured":"Beimel, A., Lindell, Y., Omri, E., Orlov, I.: 1\/p-secure multiparty computation without honest majority and the best of both worlds. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 277\u2013296. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_16"},{"issue":"3","key":"2_CR12","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s00145-013-9168-3","volume":"28","author":"A Beimel","year":"2015","unstructured":"Beimel, A., Omri, E., Orlov, I.: Protocols for multiparty coin toss with a dishonest majority. J. Cryptol. 28(3), 551\u2013600 (2015)","journal-title":"J. Cryptol."},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Green, M., Tromer, E., Virza, M.: Secure sampling of public parameters for succinct zero knowledge proofs. In: Proceedings of the 36th IEEE Symposium on Security and Privacy, (S &P), pp. 287\u2013304 (2015)","DOI":"10.1109\/SP.2015.25"},{"key":"2_CR14","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-20465-4_11","volume-title":"EUROCRYPT 2011","author":"R Bendlin","year":"2011","unstructured":"Bendlin, R., Damg\u00e5rd, I., Orlandi, C., Zakarias, S.: Semi-homomorphic encryption and multiparty computation. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 169\u2013188. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_11"},{"issue":"4","key":"2_CR15","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1145\/502090.502094","volume":"48","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.K.: Efficient generation of shared RSA keys. J. ACM 48(4), 702\u2013722 (2001)","journal-title":"J. ACM"},{"key":"2_CR16","first-page":"1050","volume":"2017","author":"S Bowe","year":"2017","unstructured":"Bowe, S., Gabizon, A., Miers, I.: 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":"2_CR17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-031-06944-4_15","volume-title":"EUROCRYPT 2022, Part I","author":"E Boyle","year":"2022","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Nof, A.: Secure Multiparty computation with sublinear preprocessing. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part I. LNCS, vol. 13275, pp. 427\u2013457. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_15"},{"key":"2_CR18","unstructured":"Brandt, N.: Tight setup bounds for identifiable abort (2021). http:\/\/eprint.iacr.org\/2021\/684"},{"key":"2_CR19","unstructured":"Brandt, N.-P., Maier, S., M\u00fcller, T., M\u00fcller-Quade, J.: Constructing secure multi-party computation with identifiable abort (2020). http:\/\/eprint.iacr.org\/2020\/153"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Haitner, I., Levi, N., Tsfadia, E.: Fair coin flipping: tighter analysis and the many-party case. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2580\u20132600 (2017)","DOI":"10.1137\/1.9781611974782.170"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Burkhardt, J., Damg\u00e5rd, I., Frederiksen, T.K., Ghosh, S., Orlandi, C.: Improved distributed RSA key generation using the miller-rabin test. IACR Cryptol. ePrint Arch., 644 (2023)","DOI":"10.1145\/3576915.3623163"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"2_CR23","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-44647-8_2","volume-title":"CRYPTO \u2013 2001","author":"R Canetti","year":"2001","unstructured":"Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO \u2013 2001. LNCS, vol. 2139, pp. 19\u201340. Springer, Cham (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_2"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Canetti, R., Gennaro, R., Goldfeder, S., Makriyannis, N., Peled, U.: UC non-interactive, proactive, threshold ECDSA with identifiable aborts. In: Proceedings of the 27th ACM Conference on Computer and Communications Security, (CCS), pp. 1769\u20131787. ACM (2020)","DOI":"10.1145\/3372297.3423367"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), pp. 494\u2013503 (2002)","DOI":"10.1145\/509907.509980"},{"key":"2_CR26","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.tcs.2022.10.016","volume":"939","author":"G Castagnos","year":"2023","unstructured":"Castagnos, G., Catalano, D., Laguillaumie, F., Savasta, F., Tucker, I.: Bandwidth-efficient threshold EC-DSA revisited: online\/offline extensions, identifiable aborts proactive and adaptive security. Theor. Comput. Sci. 939, 78\u2013104 (2023)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR27","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-56877-1_3","volume-title":"CRYPTO 2020, Part III","author":"M Chen","year":"2020","unstructured":"Chen, M., et al.: Multiparty generation of an RSA modulus. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part III. LNCS, vol. 12172, pp. 64\u201393. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_3"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Chen, M., et al.: Diogenes: lightweight scalable RSA modulus generation with a dishonest majority. In: Proceedings of the 42nd IEEE Symposium on Security and Privacy, (S &P), pp. 590\u2013607 (2021)","DOI":"10.1109\/SP40001.2021.00025"},{"key":"2_CR29","series-title":"LNCS","first-page":"335","volume-title":"EUROCRYPT 2022, Part I","author":"M Ciampi","year":"2022","unstructured":"Ciampi, M., Ravi, D., Siniscalchi, L., Waldner, H.: Round-optimal multi-party computation with identifiable abort. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part I. LNCS, vol. 13275, pp. 335\u2013364. Springer, Cham (2022)"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Cleve, R.: 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), pp. 364\u2013369 (1986)","DOI":"10.1145\/12130.12168"},{"key":"2_CR31","unstructured":"Cohen, R., Doerner, J., Kondi, Y., Shelat, A.: Secure multiparty computation with identifiable abort via vindicating release. Cryptology ePrint Archive, Paper 2023\/1136 (2023). https:\/\/eprint.iacr.org\/2023\/1136"},{"key":"2_CR32","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-031-06944-4_9","volume-title":"EUROCRYPT 2022, Part I","author":"R Cohen","year":"2022","unstructured":"Cohen, R., Doerner, J., Kondi, Y., Ahelat, A.: Guaranteed output in $${O}(\\sqrt{n})$$ rounds for round-robin sampling protocols. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part I. LNCS, vol. 13275, pp. 241\u2013271. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_9"},{"key":"2_CR33","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1007\/978-3-030-45724-2_28","volume-title":"EUROCRYPT 2020, Part II","author":"R Cohen","year":"2020","unstructured":"Cohen, R., Garay, J., Zikas, V.: Broadcast-optimal two-round MPC. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020, Part II. LNCS, vol. 12106, pp. 828\u2013858. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_28"},{"issue":"1","key":"2_CR34","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s00145-021-09415-x","volume":"35","author":"R Cohen","year":"2022","unstructured":"Cohen, R., Haitner, I., Omri, E., Rotem, L.: From fairness to full security in multiparty computation. J. Cryptol. 35(1), 4 (2022)","journal-title":"J. Cryptol."},{"issue":"4","key":"2_CR35","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1007\/s00145-016-9245-5","volume":"30","author":"R Cohen","year":"2017","unstructured":"Cohen, R., Lindell, Y.: Fairness versus guaranteed output delivery in secure multiparty computation. J. Cryptol. 30(4), 1157\u20131186 (2017)","journal-title":"J. Cryptol."},{"key":"2_CR36","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-030-45724-2_28","volume-title":"EUROCRYPT 2020","author":"C Cr\u00e9peau","year":"1995","unstructured":"Cr\u00e9peau, C., van de Graaf, J., Tapp, A.: Committed oblivious transfer and private multi-party computation. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 110\u2013123. Springer, Cham (1995). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_28"},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Crescenzo, G.D., Ishai, Y., Ostrovsky, R.: Non-interactive and non-malleable commitment. In: Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, Dallas, Texas, USA, May 23\u201326, 1998, pp. 141\u2013150 (1998)","DOI":"10.1145\/276698.276722"},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"Cunningham, R.K., Fuller, B., Yakoubov, S.: Catching MPC cheaters: identification and openability. In: Proceedings of the 10th International Conference on Information Theoretic Security (ICITS), pp. 110\u2013134 (2017)","DOI":"10.1007\/978-3-319-72089-0_7"},{"key":"2_CR39","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-030-64378-2_21","volume-title":"TCC 2020, Part II","author":"D Dachman-Soled","year":"2020","unstructured":"Dachman-Soled, D.: Revisiting fairness in MPC: polynomial number of parties and general adversarial structures. In: Pass, R., Pietrzak, K. (eds.) TCC 2020, Part II. LNCS, vol. 12551, pp. 595\u2013620. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_21"},{"key":"2_CR40","unstructured":"Damg\u00e5rd, I.: On $$\\sigma $$-protocols (2010). https:\/\/www.cs.au.dk\/~ivan\/Sigma.pdf"},{"key":"2_CR41","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-030-64378-2_21","volume-title":"Advances in Cryptology - CRYPTO 2021, Part II","author":"I Damg\u00e5rd","year":"2021","unstructured":"Damg\u00e5rd, I., Magri, B., Ravi, D., Siniscalchi, L., Yakoubov, S.: Broadcast-optimal two round MPC with an honest majority. In: Advances in Cryptology - CRYPTO 2021, Part II. LNCS, vol. 12551, pp. 155\u2013184. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_21"},{"key":"2_CR42","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"CRYPTO 2012","author":"I Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N.P., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, pp. 643\u2013662. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38"},{"key":"2_CR43","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Ravi, D., Siniscalchi, L., Yakoubov, S.: Minimizing setup in broadcast-optimal two round MPC (2022). http:\/\/eprint.iacr.org\/2022\/293","DOI":"10.1007\/978-3-031-30617-4_5"},{"key":"2_CR44","doi-asserted-by":"crossref","unstructured":"de Saint Guilhem, C.D., Makri, E., Rotaru, D., Tanguy, T.: The return of Eratosthenes: secure generation of RSA moduli using distributed sieving. In: Proceedings of the 28th ACM Conference on Computer and Communications Security, (CCS), pp. 594\u2013609 (2021)","DOI":"10.1145\/3460120.3484754"},{"key":"2_CR45","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-540-85174-5_29","volume-title":"CRYPTO 2008","author":"Y Dodis","year":"2008","unstructured":"Dodis, Y., Shoup, V., Walfish, S.: Efficient constructions of composable commitments and zero-knowledge proofs. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 515\u2013535. Springer, Heidelberg (2008)"},{"key":"2_CR46","doi-asserted-by":"crossref","unstructured":"Doerner, J., Kondi, Y., Lee, E., Shelat, A.: Secure two-party threshold ECDSA from ECDSA assumptions. In: Proceedings of the 39th IEEE Symposium on Security and Privacy, (S &P), pp. 980\u2013997 (2018)","DOI":"10.1109\/SP.2018.00036"},{"key":"2_CR47","doi-asserted-by":"crossref","unstructured":"Doerner, J., Kondi, Y., Lee, E., Shelat, A.: Threshold ECDSA from ECDSA assumptions: the multiparty case. In: Proceedings of the 40th IEEE Symposium on Security and Privacy, (S &P) (2019)","DOI":"10.1109\/SP.2019.00024"},{"key":"2_CR48","unstructured":"Doerner, J., Kondi, Y., Lee, E., Shelat, A.: Threshold ECDSA in three rounds. Cryptology ePrint Archive, Paper 2023\/765 (2023). https:\/\/eprint.iacr.org\/2023\/765"},{"issue":"6","key":"2_CR49","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM 28(6), 637\u2013647 (1985)","journal-title":"Commun. ACM"},{"key":"2_CR50","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"CRYPTO \u2013 1986","author":"A Fiat","year":"1986","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO \u2013 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"2_CR51","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/11535218_10","volume-title":"CRYPTO 2005","author":"M Fischlin","year":"2005","unstructured":"Fischlin, M.: Communication-efficient non-interactive proofs of knowledge with online extractors. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, pp. 152\u2013168. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_10"},{"key":"2_CR52","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-319-56614-6_8","volume-title":"EUROCRYPT 2017, Part II","author":"J Furukawa","year":"2017","unstructured":"Furukawa, J., Lindell, Y., Nof, A., Weinstein, O.: High-throughput secure three-party computation for malicious adversaries and an honest majority. In: Coron, J.S., Nielsen, J. (eds.) EUROCRYPT 2017, Part II. LNCS, vol. 10211, pp. 225\u2013255. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_8"},{"key":"2_CR53","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-319-76581-5_17","volume-title":"PKC 2018, Part II","author":"C Ganesh","year":"2018","unstructured":"Ganesh, C., Kondi, Y., Patra, A., Sarkar, P.: Efficient adaptively secure zero-knowledge from garbled circuits. In: Abdalla, M., Dahab, R. (eds.) PKC 2018, Part II. LNCS, vol. 10770, pp. 499\u2013529. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76581-5_17"},{"key":"2_CR54","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-540-24638-1_17","volume-title":"TCC 2004","author":"JA Garay","year":"2004","unstructured":"Garay, J.A.: Efficient and universally composable committed oblivious transfer and applications. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 297\u2013316. Springer (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_17"},{"key":"2_CR55","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Goldfeder, S.: Fast multiparty threshold ECDSA with fast trustless setup. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, Toronto, ON, Canada, October 15\u201319, 2018, pp. 1179\u20131194. ACM (2018)","DOI":"10.1145\/3243734.3243859"},{"key":"2_CR56","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/3-540-48405-1_8","volume-title":"CRYPTO 1999","author":"N Gilboa","year":"1999","unstructured":"Gilboa, N.: Two party RSA key generation. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 116\u2013129. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_8"},{"key":"2_CR57","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: 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), pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"2_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-00457-5_2","volume-title":"Theory of Cryptography","author":"SD Gordon","year":"2009","unstructured":"Gordon, S.D., Katz, J.: Complete fairness in multi-party computation without an honest majority. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 19\u201335. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_2"},{"issue":"1","key":"2_CR59","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/s00145-010-9079-5","volume":"25","author":"SD Gordon","year":"2012","unstructured":"Gordon, S.D., Katz, J.: Partial fairness in secure two-party computation. J. Cryptol. 25(1), 14\u201340 (2012)","journal-title":"J. Cryptol."},{"key":"2_CR60","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1007\/978-3-319-96878-0_24","volume-title":"CRYPTO 2018, Part III","author":"J Groth","year":"2018","unstructured":"Groth, J., Kohlweiss, M., Maller, M., Meiklejohn, S., Miers, I.: Updatable and universal common reference strings with applications to ZK-snarks. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part III. LNCS, vol. 10993, pp. 698\u2013728. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_24"},{"issue":"2","key":"2_CR61","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1137\/15M1009147","volume":"46","author":"I Haitner","year":"2017","unstructured":"Haitner, I., Tsfadia, E.: An almost-optimally fair three-party coin-flipping protocol. SIAM J. Comput. 46(2), 479\u2013542 (2017)","journal-title":"SIAM J. Comput."},{"key":"2_CR62","doi-asserted-by":"crossref","unstructured":"Hazay, C., Mikkelsen, G.L., Rabin, T., Toft, T.: Efficient RSA key generation and threshold Paillier in the two-party setting. In: Proceedings of the Cryptographers\u2019 Track at the RSA Conference (CT-RSA), pp. 313\u2013331 (2012)","DOI":"10.1007\/978-3-642-27954-6_20"},{"key":"2_CR63","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/978-3-319-70694-8_21","volume-title":"ASIACRYPT 2017, Part I","author":"C Hazay","year":"2017","unstructured":"Hazay, C., Scholl, P., Soria-Vazquez, E.: Low cost constant round MPC combining BMR and oblivious transfer. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017, Part I. LNCS, vol. 10624, pp. 598\u2013628. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_21"},{"key":"2_CR64","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-89255-7_1","volume-title":"ASIACRYPT 2008","author":"M Hirt","year":"2008","unstructured":"Hirt, M., Maurer, U., Zikas, V.: MPC vs. SFE: unconditional and computational security. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 1\u201318. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89255-7_1"},{"key":"2_CR65","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions (extended abstracts). In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14\u201317, 1989, Seattle, Washington, USA, pp. 12\u201324 (1989)","DOI":"10.1145\/73007.73009"},{"issue":"1","key":"2_CR66","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1137\/100783224","volume":"40","author":"Y Ishai","year":"2011","unstructured":"Ishai, Y., Katz, J., Kushilevitz, E., Lindell, Y., Petrank, E.: On achieving the \u201cbest of both worlds\u2019\u2019 in secure multiparty computation. SIAM J. Comput. 40(1), 122\u2013141 (2011)","journal-title":"SIAM J. Comput."},{"key":"2_CR67","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), pp. 21\u201330 (2007)","DOI":"10.1145\/1250790.1250794"},{"key":"2_CR68","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-28914-9_2","volume-title":"TCC 2012","author":"Y Ishai","year":"2012","unstructured":"Ishai, Y., Ostrovsky, R., Seyalioglu, H.: Identifying cheaters without an honest majority. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 21\u201338. Springer, Cham (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_2"},{"key":"2_CR69","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-662-44381-1_21","volume-title":"CRYPTO 2014, Part II","author":"Y Ishai","year":"2014","unstructured":"Ishai, Y., Ostrovsky, R., Zikas, V.: Secure multi-party computation with identifiable abort. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part II. LNCS, vol. 8617, pp. 369\u2013386. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_21"},{"key":"2_CR70","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-85174-5_32","volume-title":"CRYPTO 2008","author":"Y Ishai","year":"2008","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer - efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 572\u2013591. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_32"},{"key":"2_CR71","doi-asserted-by":"crossref","unstructured":"Jawurek, M., Kerschbaum, F., Orlandi, C.: Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently. In: Proceedings of the 20th ACM Conference on Computer and Communications Security, (CCS), pp 955\u2013966. ACM (2013)","DOI":"10.1145\/2508859.2516662"},{"key":"2_CR72","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-642-36594-2_27","volume-title":"TCC 2013","author":"J Katz","year":"2013","unstructured":"Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Universally composable synchronous computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 477\u2013498. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_27"},{"key":"2_CR73","doi-asserted-by":"crossref","unstructured":"Keller, M., Orsini, E., Scholl, P.: MASCOT: faster malicious arithmetic secure computation with oblivious transfer. In: Proceedings of the 23th ACM Conference on Computer and Communications Security, (CCS), pp. 830\u2013842 (2016)","DOI":"10.1145\/2976749.2978357"},{"key":"2_CR74","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), pp. 20\u201331 (1988)","DOI":"10.1145\/62212.62215"},{"key":"2_CR75","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-030-92078-4_4","volume-title":"ASIACRYPT 2021, Part III","author":"M Kohlweiss","year":"2021","unstructured":"Kohlweiss, M., Maller, M., Siim, J., Volkhov, M.: Snarky ceremonies. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021, Part III. LNCS, vol. 13092, pp. 98\u2013127. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_4"},{"key":"2_CR76","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-031-22966-4_10","volume-title":"ASIACRYPT 2022, Part II","author":"Y Kondi","year":"2022","unstructured":"Kondi, Y., Shelat, A.: Improved straight-line extraction in the random oracle model with applications to signature aggregation. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022, Part II. LNCS, vol. 13792, pp. 279\u2013309. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22966-4_10"},{"key":"2_CR77","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Nof, A.: Fast secure multiparty ECDSA with practical distributed key generation and applications to cryptocurrency custody. In: Proceedings of the 25th ACM Conference on Computer and Communications Security, (CCS), pp. 1837\u20131854 (2018)","DOI":"10.1145\/3243734.3243788"},{"key":"2_CR78","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-540-45146-4_19","volume-title":"CRYPTO 2003","author":"R Pass","year":"2003","unstructured":"Pass, R.: On deniability in the common reference string and random oracle model. In: CRYPTO 2003. LNCS, vol. 2729, pp. 316\u2013337. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_19"},{"key":"2_CR79","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"CRYPTO 1991","author":"TP Pedersen","year":"1991","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129\u2013140. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46766-1_9"},{"key":"2_CR80","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-540-85174-5_31","volume-title":"CRYPTO 2008","author":"C Peikert","year":"2008","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 554\u2013571. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_31"},{"key":"2_CR81","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-030-57990-6_10","volume-title":"Security and Cryptography for Networks","author":"W Quach","year":"2020","unstructured":"Quach, W.: UC-secure OT from LWE, revisited. In: Galdi, C., Kolesnikov, V. (eds.) SCN 2020. LNCS, vol. 12238, pp. 192\u2013211. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57990-6_10"},{"key":"2_CR82","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/978-3-031-15802-5_23","volume-title":"CRYPTO 2022, Part I","author":"L Roy","year":"2022","unstructured":"Roy, L.: Softspokenot: quieter OT extension from small-field silent VOLE in the Minicrypt model. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part I. LNCS, vol. 13507, pp. 657\u2013687. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_23"},{"key":"2_CR83","doi-asserted-by":"crossref","unstructured":"Simkin, M., Siniscalchi, L., Yakoubov, S.: On sufficient oracles for secure computation with identifiable abort. In: Proceedings of the 13th Conference on Security and Cryptography for Networks (SCN), pp. 494\u2013515 (2022)","DOI":"10.1007\/978-3-031-14791-3_22"},{"key":"2_CR84","doi-asserted-by":"crossref","unstructured":"Smart, N.P., Tanguy, T.: TAAS: commodity MPC via triples-as-a-service. In: Proceedings of the 2019 ACM SIGSAC Conference on Cloud Computing Security Workshop, CCSW@CCS 2019, London, UK, November 11, 2019, pp. 105\u2013116 (2019)","DOI":"10.1145\/3338466.3358918"},{"key":"2_CR85","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-319-49175-2_8","volume-title":"Information Theoretic Security","author":"G Spini","year":"2016","unstructured":"Spini, G., Fehr, S.: Cheater detection in SPDZ multiparty computation. In: Nascimento, A.C.A., Barreto, P. (eds.) ICITS 2016. LNCS, vol. 10015, pp. 151\u2013176. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49175-2_8"},{"key":"2_CR86","doi-asserted-by":"crossref","unstructured":"Wang, X., Ranellucci, S., Katz, J.: Global-scale secure multiparty computation. In: Proceedings of the 24th ACM Conference on Computer and Communications Security, (CCS), pp. 39\u201356 (2017)","DOI":"10.1145\/3133956.3133979"},{"key":"2_CR87","doi-asserted-by":"crossref","unstructured":"Yang, K., Wang, X., Zhang, J.: More efficient MPC from improved triple generation and authenticated garbling. In: Proceedings of the 27th ACM Conference on Computer and Communications Security, (CCS), pp. 1627\u20131646 (2020)","DOI":"10.1145\/3372297.3417285"},{"key":"2_CR88","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Protocols for secure computations (extended abstract). In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"2_CR89","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-642-00457-5_17","volume-title":"TCC 2009","author":"V Zikas","year":"2009","unstructured":"Zikas, V., Hauser, S., Maurer, U.: Realistic failures in secure multi-party computation. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 274\u2013293. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_17"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68397-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T19:25:08Z","timestamp":1732649108000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68397-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683961","9783031683978"],"references-count":89,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68397-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}