{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T10:57:33Z","timestamp":1778065053825,"version":"3.51.4"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031683961","type":"print"},{"value":"9783031683978","type":"electronic"}],"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_6","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T22:01:41Z","timestamp":1723759301000},"page":"170-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Towards Achieving Asynchronous MPC with\u00a0Linear Communication and\u00a0Optimal Resilience"],"prefix":"10.1007","author":[{"given":"Vipul","family":"Goyal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen-Da","family":"Liu-Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yifan","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","unstructured":"Abraham, I., Asharov, G., Patil, S., Patra, A.: Asymptotically free broadcast in constant expected time via packed VSS. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC 2022, Part I. LNCS, vol. 13747, pp. 384\u2013414. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_14","DOI":"10.1007\/978-3-031-22318-1_14"},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Abraham, I., Asharov, G., Patil, S., Patra, A.: Perfect asynchronous MPC with linear communication overhead. In: Joye, M., Leander, G. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2024. LNCS, vol. 14655, pp. 280\u2013309. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58740-5_10","DOI":"10.1007\/978-3-031-58740-5_10"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D., Stern, G.: Revisiting asynchronous fault tolerant computation with optimal resilience. In: Emek, Y., Cachin, C. (eds.) 39th ACM PODC, pp. 139\u2013148. ACM (2020)","DOI":"10.1145\/3382734.3405722"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous secure computation. In: 25th ACM STOC, pp. 52\u201361. ACM Press (1993)","DOI":"10.1145\/167088.167109"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Bacho, R., Collins, D., Liu-Zhang, C.-D., Loss, J.: Network-agnostic security comes (almost) for free in DKG and MPC. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part I. LNCS, vol. 14081, pp. 71\u2013106. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_3","DOI":"10.1007\/978-3-031-38557-5_3"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Bhimrajka, N., Choudhury, A., Varadarajan, S.: Network-Agnostic Multi-party Computation Revisited (Extended Abstract). Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-57722-2_6","DOI":"10.1007\/978-3-031-57722-2_6"},{"key":"6_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/978-3-642-32009-5_39","volume-title":"CRYPTO 2012","author":"E Ben-Sasson","year":"2012","unstructured":"Ben-Sasson, E., Fehr, S., Ostrovsky, R.: Near-linear unconditionally-secure multiparty computation with a dishonest minority. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 663\u2013680. Springer, Heidelberg (2012)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: 20th ACM STOC, pp. 1\u201310. ACM Press (1988)","DOI":"10.1145\/62212.62213"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Bhimrajka, N., Choudhury, A., Varadarajan, S.: Network-agnostic multi-party computation revisited (extended abstract). In: Tang, Q., Teague, V. (eds.) Public-Key Cryptography - PKC 2024. LNCS, vol. 14602, pp. 213\u2013230. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57722-2_6","DOI":"10.1007\/978-3-031-57722-2_6"},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"Blum, E., Katz, J., Liu-Zhang, C.-D., Loss, J.: Asynchronous byzantine agreement with subquadratic communication. In: Pass, R., Pietrzak, K. (eds.) TCC 2020, Part I. LNCS, vol. 12550, pp. 353\u2013380. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_13","DOI":"10.1007\/978-3-030-64375-1_13"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Kelmer, B., Rabin, T.: Asynchronous secure computations with optimal resilience (extended abstract). In: Anderson, J., Toueg, S. (eds.) 13th ACM PODC, pp. 183\u2013192. ACM (1994)","DOI":"10.1145\/197917.198088"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Bracha, G.: An asynchronous [(n - 1)\/3]-resilient consensus protocol. In: Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, PODC 1984, pp. 154\u2014162. Association for Computing Machinery, New York (1984)","DOI":"10.1145\/800222.806743"},{"key":"6_CR13","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Fehr, S., Ostrovsky, R.: Near-linear unconditionally-secure multiparty computation with a dishonest minority. In: Safavi-Naini, R., Canetti, R. (eds.) Advances in Cryptology \u2013 CRYPTO 2012. LNCS, vol. 7417, pp. 663\u2013680. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_39","DOI":"10.1007\/978-3-642-32009-5_39"},{"key":"6_CR14","doi-asserted-by":"publisher","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Efficient multi-party computation with dispute control. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 305\u2013328. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_16","DOI":"10.1007\/11681878_16"},{"key":"6_CR15","doi-asserted-by":"publisher","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Perfectly-secure MPC with linear communication complexity. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 213\u2013230. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_13","DOI":"10.1007\/978-3-540-78524-8_13"},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Blum, E., Liu-Zhang, C.D., Loss, J.: Always have a backup plan: Fully secure synchronous MPC with asynchronous fallback. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part II. LNCS, vol. 12171, pp. 707\u2013731. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_25","DOI":"10.1007\/978-3-030-56880-1_25"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptol. 13, 143\u2013202 (2000)","DOI":"10.1007\/s001459910006"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, pp. 136\u2013145. IEEE Computer Society Press (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: 20th ACM STOC, pp. 11\u201319. ACM Press (1988)","DOI":"10.1145\/62212.62214"},{"key":"6_CR20","doi-asserted-by":"publisher","unstructured":"Cramer, R., Damg\u00e5rd, I., Dziembowski, S., Hirt, M., Rabin, T.: Efficient multiparty computations secure against an adaptive adversary. In: Stern, J. (ed.) EUROCRYPT\u201999. LNCS, vol. 1592, pp. 311\u2013326. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_22","DOI":"10.1007\/3-540-48910-X_22"},{"key":"6_CR21","doi-asserted-by":"publisher","unstructured":"Cohen, R., Forghani, P., Garay, J., Patel, R., Zikas, V.: Concurrent asynchronous byzantine agreement in expected-constant rounds, revisited. In: Rothblum, G., Wee, H. (eds.) Theory of Cryptography. LNCS, pp. 422\u2013451. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-48624-1_16","DOI":"10.1007\/978-3-031-48624-1_16"},{"key":"6_CR22","doi-asserted-by":"publisher","unstructured":"Coretti, S., Garay, J., Hirt, M., Zikas, V.: Constant-round asynchronous multi-party computation based on one-way functions. In: Cheon, J., Takagi, T. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2016, vol. 10032, pp. 998\u20131021. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_33","DOI":"10.1007\/978-3-662-53890-6_33"},{"key":"6_CR23","doi-asserted-by":"publisher","unstructured":"Chopard, A., Hirt, M., Liu-Zhang, C.-D.: On communication-efficient asynchronous MPC with adaptive security. In: Nissim, K., Waters, B. (eds.) TCC 2021, Part II. LNCS, vol. 13043, pp. 35\u201365. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_2","DOI":"10.1007\/978-3-030-90453-1_2"},{"key":"6_CR24","doi-asserted-by":"publisher","unstructured":"Choudhury, A., Hirt, M., Patra, A.: Asynchronous Multiparty Computation with Linear Communication Complexity. In: Afek, Y. (ed.) DISC 2013. LNCS, vol. 8205, pp. 388\u2013402. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41527-2_27","DOI":"10.1007\/978-3-642-41527-2_27"},{"key":"6_CR25","doi-asserted-by":"publisher","unstructured":"Cohen, R.: Asynchronous secure multiparty computation in constant time. In: Cheng, C.-M., Chung, K.-M., Persiano, G., Yang, B.-Y. (eds.) PKC 2016, Part II. LNCS, vol. 9615, pp. 183\u2013207. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49387-8_8","DOI":"10.1007\/978-3-662-49387-8_8"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Choudhury, A., Patra, A.: Optimally resilient asynchronous MPC with linear communication complexity. In: Proceedings of International Conference on Distributed Computing and Networking (ICDCN), pp. 1\u201310 (2015)","DOI":"10.1145\/2684464.2684470"},{"issue":"1","key":"6_CR27","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1109\/TIT.2016.2614685","volume":"63","author":"A Choudhury","year":"2017","unstructured":"Choudhury, A., Patra, A.: An efficient framework for unconditionally secure multiparty computation. IEEE Trans. Inf. Theory 63(1), 428\u2013468 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"6_CR28","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s00145-023-09451-9","volume":"36","author":"A Choudhury","year":"2023","unstructured":"Choudhury, A., Patra, A.: On the communication efficiency of statistically secure asynchronous mpc with optimal resilience. J. Cryptol. 36(2), 13 (2023)","journal-title":"J. Cryptol."},{"key":"6_CR29","doi-asserted-by":"publisher","unstructured":"Deligios, G., Hirt, M., Liu-Zhang, C.-D.: Round-efficient byzantine agreement and multi-party computation with asynchronous fallback. In: Nissim, K., Waters, B. (eds.) TCC 2021, Part I. LNCS, vol. 13042, pp. 623\u2013653. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_21","DOI":"10.1007\/978-3-030-90459-3_21"},{"key":"6_CR30","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Ishai, Y.: Scalable secure multiparty computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 501\u2013520. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_30","DOI":"10.1007\/11818175_30"},{"key":"6_CR31","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Nielsen, J.B:. Scalable and unconditionally secure multiparty computation. In: Menezes, A. (eds.) CRYPTO 2007, vol. 4622, pp. 572\u2013590. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_32","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"Escudero, D., Goyal, V., Polychroniadou, A., Song, Y.: Turbopack: honest majority MPC with constant online communication. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, pp. 951\u2013964. Association for Computing Machinery, New York (2022)","DOI":"10.1145\/3548606.3560633"},{"issue":"2","key":"6_CR33","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM (JACM) 32(2), 374\u2013382 (1985)","journal-title":"J. ACM (JACM)"},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"Franklin, M., Yung, M.: Communication complexity of secure computation (extended abstract). In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, STOC 1992, pp. 699\u2013710. Association for Computing Machinery, New York (1992)","DOI":"10.1145\/129712.129780"},{"key":"6_CR35","doi-asserted-by":"publisher","unstructured":"Goyal, V., Liu, Y., Song, Y.: Communication-efficient unconditional MPC with guaranteed output delivery. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part II. LNCS, vol. 11693, pp. 85\u2013114. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_4","DOI":"10.1007\/978-3-030-26951-7_4"},{"key":"6_CR36","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: Aho, A. (ed.) 19th ACM STOC, pp. 218\u2013229. ACM Press (1987)","DOI":"10.1145\/28395.28420"},{"key":"6_CR37","doi-asserted-by":"publisher","unstructured":"Goyal, V., Polychroniadou, A., Song, Y.: Sharing transformation and dishonest majority MPC with packed secret sharing. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13510, pp. 3\u201332. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_1","DOI":"10.1007\/978-3-031-15985-5_1"},{"key":"6_CR38","doi-asserted-by":"publisher","unstructured":"Goyal, V., Song, Y., Zhu, C.: Guaranteed output delivery comes free in honest majority MPC. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part II. LNCS, vol. 12171, pp. 618\u2013646. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_22","DOI":"10.1007\/978-3-030-56880-1_22"},{"key":"6_CR39","doi-asserted-by":"publisher","unstructured":"Hirt, M., Nielsen, J.B.: Robust multiparty computation with linear communication complexity. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 463\u2013482. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_28","DOI":"10.1007\/11818175_28"},{"key":"6_CR40","doi-asserted-by":"publisher","unstructured":"Hirt, M., Nielsen, J.B., Przydatek, B.: Cryptographic asynchronous multi-party computation with optimal resilience (extended abstract). In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 322\u2013340. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_19","DOI":"10.1007\/11426639_19"},{"key":"6_CR41","doi-asserted-by":"publisher","unstructured":"Hirt, M., Nielsen, J.B., Przydatek, B.: Asynchronous multi-party computation with quadratic communication. In: Aceto, L., et\u00a0al. (eds.) ICALP 2008, Part\u00a0II, vol. 5126, pp. 473\u2013485. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_39","DOI":"10.1007\/978-3-540-70583-3_39"},{"key":"6_CR42","doi-asserted-by":"crossref","unstructured":"Ji, X., Li, J., Song, Y.: Linear-communication asynchronous complete secret sharing with optimal resilience. In: Crypto (2024)","DOI":"10.1007\/978-3-031-68397-8_13"},{"issue":"4","key":"6_CR43","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/2785953","volume":"62","author":"A Most\u00e9faoui","year":"2015","unstructured":"Most\u00e9faoui, A., Moumen, H., Raynal, M.: Signature-free asynchronous binary byzantine consensus with $$t<n\/3$$, o($$n^2$$) messages, and o(1) expected time. J. ACM 62(4), 8 (2015)","journal-title":"J. ACM"},{"key":"6_CR44","doi-asserted-by":"publisher","unstructured":"Patra, A.: Error-free multi-valued broadcast and byzantine agreement with optimal communication complexity. In: Fernandez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol. 7109, pp. 34\u201349. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25873-2_4","DOI":"10.1007\/978-3-642-25873-2_4"},{"key":"6_CR45","unstructured":"Patra, A., Choudhury, A., Rangan, C.P.: Efficient asynchronous multiparty computation with optimal resilience. Cryptology ePrint Archive, Report 2008\/425 (2008). https:\/\/eprint.iacr.org\/2008\/425"},{"key":"6_CR46","doi-asserted-by":"publisher","unstructured":"Patra, A., Choudhary, A., Rangan, C.P.: Efficient statistical asynchronous verifiable secret sharing with optimal resilience. In: Kurosawa, K. (ed.) ICITS 09. LNCS, vol. 5973, pp. 74\u201392. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14496-7_7","DOI":"10.1007\/978-3-642-14496-7_7"},{"key":"6_CR47","doi-asserted-by":"crossref","unstructured":"Patra, A., Choudhury, A., Pandu Rangan, C.: Efficient asynchronous verifiable secret sharing and multiparty computation. J. Cryptol. 28, 49\u2013109 (2015)","DOI":"10.1007\/s00145-013-9172-7"},{"key":"6_CR48","doi-asserted-by":"publisher","unstructured":"Prabhu, B., Srinathan, K.: Asynchronous unconditionally secure computation: an efficiency improvement. In: Menezes, A., Sarkar, P. (eds.) INDOCRYPT 2002. LNCS, vol. 2551, pp. 93\u2013107. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36231-2_9","DOI":"10.1007\/3-540-36231-2_9"},{"key":"6_CR49","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: 21st ACM STOC, pp. 73\u201385. ACM Press (1989)","DOI":"10.1145\/73007.73014"},{"key":"6_CR50","doi-asserted-by":"publisher","unstructured":"Rachuri, R., Scholl, P.: Le mans: dynamic and fluid MPC for dishonest majority. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2022. LNCS, vol. 13507, pp. 719\u2013749. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_25","DOI":"10.1007\/978-3-031-15802-5_25"},{"issue":"11","key":"6_CR51","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"6_CR52","doi-asserted-by":"publisher","unstructured":"Srinathan, K., Pandu Rangan, C.: Efficient Asynchronous Secure Multiparty Distributed Computation. In: Roy, B., Okamoto, E. (eds.) INDOCRYPT 2000. LNCS, vol. 1977, pp. 117\u2013129. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44495-5_11","DOI":"10.1007\/3-540-44495-5_11"},{"key":"6_CR53","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Theory and applications of trapdoor functions (extended abstract). In: 23rd FOCS, pp. 80\u201391. IEEE Computer Society Press (1982)","DOI":"10.1109\/SFCS.1982.45"}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T19:25:01Z","timestamp":1732649101000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68397-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683961","9783031683978"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68397-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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"}}]}}