{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T14:10:08Z","timestamp":1750515008979,"version":"3.41.0"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031957604","type":"print"},{"value":"9783031957611","type":"electronic"}],"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":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-95761-1_12","type":"book-chapter","created":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T13:30:15Z","timestamp":1750512615000},"page":"339-368","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Delayed-Input Multi-party Computation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5062-0388","authenticated-orcid":false,"given":"Michele","family":"Ciampi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-3831-5993","authenticated-orcid":false,"given":"Jure","family":"Sternad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-3130-5046","authenticated-orcid":false,"given":"Yu","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,22]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","unstructured":"Ananth, P., Choudhuri, A.R., Jain, A.: A new approach to round-optimal secure multiparty computation. In: Katz, J., Shacham, H. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02017, Part\u00a0I. Lecture Notes in Computer Science, vol. 10401, pp. 468\u2013499. Springer, Cham, Switzerland, Santa Barbara, CA, USA (Aug\u00a020\u201324, 2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_16","DOI":"10.1007\/978-3-319-63688-7_16"},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"Badrinarayanan, S., Goyal, V., Jain, A., Kalai, Y.T., Khurana, D., Sahai, A.: Promise zero knowledge and its applications to round optimal MPC. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02018, Part\u00a0II. Lecture Notes in Computer Science, vol. 10992, pp. 459\u2013487. Springer, Cham, Switzerland, Santa Barbara, CA, USA (Aug\u00a019\u201323, 2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_16","DOI":"10.1007\/978-3-319-96881-0_16"},{"key":"12_CR3","doi-asserted-by":"publisher","unstructured":"Beaver, D.: Precomputing oblivious transfer. In: Coppersmith, D. (ed.) Advances in Cryptology \u2013 CRYPTO\u201995. Lecture Notes in Computer Science, vol.\u00a0963, pp. 97\u2013109. Springer Berlin Heidelberg, Germany, Santa Barbara, CA, USA (Aug\u00a027\u201331, 1995). https:\/\/doi.org\/10.1007\/3-540-44750-4_8","DOI":"10.1007\/3-540-44750-4_8"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Beaver, D.: Correlated pseudorandomness and the complexity of private computations. In: 28th Annual ACM Symposium on Theory of Computing. pp. 479\u2013488. ACM Press, Philadephia, PA, USA (May\u00a022\u201324, 1996). https:\/\/doi.org\/10.1145\/237814.237996","DOI":"10.1145\/237814.237996"},{"key":"12_CR5","doi-asserted-by":"publisher","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols (extended abstract). In: 22nd Annual ACM Symposium on Theory of Computing, pp. 503\u2013513. ACM Press, Baltimore, MD, USA (May\u00a014\u201316, 1990). https:\/\/doi.org\/10.1145\/100216.100287","DOI":"10.1145\/100216.100287"},{"key":"12_CR6","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Secure computation with preprocessing via function secret sharing. In: Hofheinz, D., Rosen, A. (eds.) TCC\u00a02019: 17th Theory of Cryptography Conference, Part\u00a0I. Lecture Notes in Computer Science, vol. 11891, pp. 341\u2013371. Springer, Cham, Switzerland, Nuremberg, Germany (Dec\u00a01\u20135, 2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_14","DOI":"10.1007\/978-3-030-36030-6_14"},{"key":"12_CR7","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Nof, A.: Secure multiparty computation with sublinear preprocessing. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02022, Part\u00a0I. Lecture Notes in Computer Science, vol. 13275, pp. 427\u2013457. Springer, Cham, Switzerland, Trondheim, Norway (May\u00a030\u00a0\u2013\u00a0Jun\u00a03, 2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_15","DOI":"10.1007\/978-3-031-06944-4_15"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Halevi, S., Polychroniadou, A.: Four round secure computation without setup. In: Kalai, Y., Reyzin, L. (eds.) TCC\u00a02017: 15th Theory of Cryptography Conference, Part\u00a0I. Lecture Notes in Computer Science, vol. 10677, pp. 645\u2013677. Springer, Cham, Switzerland, Baltimore, MD, USA (Nov\u00a012\u201315, 2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_22","DOI":"10.1007\/978-3-319-70500-2_22"},{"key":"12_CR9","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42nd Annual Symposium on Foundations of Computer Science, pp. 136\u2013145. IEEE Computer Society Press, Las Vegas, NV, USA (Oct\u00a014\u201317, 2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"12_CR10","doi-asserted-by":"publisher","unstructured":"Canetti, R., Cohen, A., Lindell, Y.: A simpler variant of universally composable security for standard multiparty computation. In: Gennaro, R., Robshaw, M.J.B. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02015, Part\u00a0II. Lecture Notes in Computer Science, vol.\u00a09216, pp. 3\u201322. Springer Berlin Heidelberg, Germany, Santa Barbara, CA, USA (Aug\u00a016\u201320, 2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_1","DOI":"10.1007\/978-3-662-48000-7_1"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Canetti, R., Kushilevitz, E., Lindell, Y.: On the limitations of universally composable two-party computation without set-up assumptions. In: Biham, E. (ed.) Advances in Cryptology \u2013 EUROCRYPT\u00a02003. Lecture Notes in Computer Science, vol.\u00a02656, pp. 68\u201386. Springer Berlin Heidelberg, Germany, Warsaw, Poland (May\u00a04\u20138, 2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_5","DOI":"10.1007\/3-540-39200-9_5"},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"Choudhuri, A.R., Ciampi, M., Goyal, V., Jain, A., Ostrovsky, R.: Round optimal secure multiparty computation from minimal assumptions. In: Pass, R., Pietrzak, K. (eds.) TCC\u00a02020: 18th Theory of Cryptography Conference, Part\u00a0II. Lecture Notes in Computer Science, vol. 12551, pp. 291\u2013319. Springer, Cham, Switzerland, Durham, NC, USA (Nov\u00a016\u201319, 2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_11","DOI":"10.1007\/978-3-030-64378-2_11"},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"Ciampi, M., Ostrovsky, R., Siniscalchi, L., Visconti, I.: Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds. In: Kalai, Y., Reyzin, L. (eds.) TCC\u00a02017: 15th Theory of Cryptography Conference, Part\u00a0I. Lecture Notes in Computer Science, vol. 10677, pp. 711\u2013742. Springer, Cham, Switzerland, Baltimore, MD, USA (Nov\u00a012\u201315, 2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_24","DOI":"10.1007\/978-3-319-70500-2_24"},{"key":"12_CR14","doi-asserted-by":"publisher","unstructured":"Ciampi, M., Ostrovsky, R., Siniscalchi, L., Visconti, I.: Round-optimal secure two-party computation from trapdoor permutations. In: Kalai, Y., Reyzin, L. (eds.) TCC\u00a02017: 15th Theory of Cryptography Conference, Part\u00a0I. Lecture Notes in Computer Science, vol. 10677, pp. 678\u2013710. Springer, Cham, Switzerland, Baltimore, MD, USA (Nov\u00a012\u201315, 2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_23","DOI":"10.1007\/978-3-319-70500-2_23"},{"key":"12_CR15","unstructured":"Ciampi, M., Ostrovsky, R., Siniscalchi, L., Waldner, H.: Round-optimal black-box multiparty computation from polynomial-time assumptions. Cryptology ePrint Archive, Paper 2023\/1742 (2023). https:\/\/eprint.iacr.org\/2023\/1742, https:\/\/eprint.iacr.org\/2023\/1742"},{"key":"12_CR16","doi-asserted-by":"publisher","unstructured":"Ciampi, M., Ravi, D., Siniscalchi, L., Waldner, H.: Round-Optimal Multi-party Computation with Identifiable Abort, p. 335\u2013364. Springer International Publishing (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_12, http:\/\/dx.doi.org\/10.1007\/978-3-031-06944-4_12","DOI":"10.1007\/978-3-031-06944-4_12"},{"key":"12_CR17","doi-asserted-by":"publisher","unstructured":"Cohen, R., Garay, J.A., Zikas, V.: Broadcast-optimal two-round MPC. In: Canteaut, A., Ishai, Y. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02020, Part\u00a0II. Lecture Notes in Computer Science, vol. 12106, pp. 828\u2013858. Springer, Cham, Switzerland, Zagreb, Croatia (May\u00a010\u201314, 2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_28","DOI":"10.1007\/978-3-030-45724-2_28"},{"key":"12_CR18","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Ravi, D., Siniscalchi, L., Yakoubov, S.: Minimizing setup in broadcast-optimal two round MPC. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02023, Part\u00a0II. Lecture Notes in Computer Science, vol. 14005, pp. 129\u2013158. Springer, Cham, Switzerland, Lyon, France (Apr\u00a023\u201327, 2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_5","DOI":"10.1007\/978-3-031-30617-4_5"},{"key":"12_CR19","doi-asserted-by":"publisher","unstructured":"Dittmer, S., Ishai, Y., Lu, S., Ostrovsky, R.: Authenticated garbling from simple correlations. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02022, Part\u00a0IV. Lecture Notes in Computer Science, vol. 13510, pp. 57\u201387. Springer, Cham, Switzerland, Santa Barbara, CA, USA (Aug\u00a015\u201318, 2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_3","DOI":"10.1007\/978-3-031-15985-5_3"},{"key":"12_CR20","doi-asserted-by":"publisher","unstructured":"Garg, S., Mukherjee, P., Pandey, O., Polychroniadou, A.: The exact round complexity of secure computation. In: Fischlin, M., Coron, J.S. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02016, Part\u00a0II. Lecture Notes in Computer Science, vol.\u00a09666, pp. 448\u2013476. Springer Berlin Heidelberg, Germany, Vienna, Austria (May\u00a08\u201312, 2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_16","DOI":"10.1007\/978-3-662-49896-5_16"},{"key":"12_CR21","doi-asserted-by":"publisher","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 Annual ACM Symposium on Theory of Computing, pp. 218\u2013229. ACM Press, New York City, NY, USA (May\u00a025\u201327, 1987). https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"12_CR22","unstructured":"Goldwasser, S., Bellare, M.: Lecture notes on cryptography. Summer Course \u201cCryptography and Computer Security\u201d at MIT (2008). http:\/\/www-cse.ucsd.edu\/users\/mihir\/ papers\/gb.pdf"},{"key":"12_CR23","doi-asserted-by":"publisher","unstructured":"Goyal, V.: Constant round non-malleable protocols using one way functions. In: Fortnow, L., Vadhan, S.P. (eds.) 43rd Annual ACM Symposium on Theory of Computing, pp. 695\u2013704. ACM Press, San Jose, CA, USA (Jun\u00a06\u20138, 2011). https:\/\/doi.org\/10.1145\/1993636.1993729","DOI":"10.1145\/1993636.1993729"},{"key":"12_CR24","doi-asserted-by":"publisher","unstructured":"Goyal, V., Jain, A., Ostrovsky, R., Richelson, S., Visconti, I.: Concurrent Zero Knowledge in the Bounded Player Model, pp. 60\u201379. Springer Berlin Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_4, http:\/\/dx.doi.org\/10.1007\/978-3-642-36594-2_4","DOI":"10.1007\/978-3-642-36594-2_4"},{"key":"12_CR25","doi-asserted-by":"publisher","unstructured":"Halevi, S., Hazay, C., Polychroniadou, A., Venkitasubramaniam, M.: Round-optimal secure multi-party computation. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02018, Part\u00a0II. Lecture Notes in Computer Science, vol. 10992, pp. 488\u2013520. Springer, Cham, Switzerland, Santa Barbara, CA, USA (Aug\u00a019\u201323, 2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_17","DOI":"10.1007\/978-3-319-96881-0_17"},{"key":"12_CR26","doi-asserted-by":"publisher","unstructured":"Hazay, C., Lindell, Y.: Efficient Secure Two-Party Protocols. Springer Berlin Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14303-8","DOI":"10.1007\/978-3-642-14303-8"},{"key":"12_CR27","doi-asserted-by":"publisher","unstructured":"Hazay, C., Orsini, E., Scholl, P., Soria-Vazquez, E.: Concretely efficient large-scale MPC with active security (or, TinyKeys for TinyOT). In: Peyrin, T., Galbraith, S. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02018, Part\u00a0III. Lecture Notes in Computer Science, vol. 11274, pp. 86\u2013117. Springer, Cham, Switzerland, Brisbane, Queensland, Australia (Dec\u00a02\u20136, 2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_4","DOI":"10.1007\/978-3-030-03332-3_4"},{"key":"12_CR28","doi-asserted-by":"publisher","unstructured":"Hazay, C., Scholl, P., Soria-Vazquez, E.: Low cost constant round MPC combining BMR and oblivious transfer. In: Takagi, T., Peyrin, T. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02017, Part\u00a0I. Lecture Notes in Computer Science, vol. 10624, pp. 598\u2013628. Springer, Cham, Switzerland, Hong Kong, China (Dec\u00a03\u20137, 2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_21","DOI":"10.1007\/978-3-319-70694-8_21"},{"key":"12_CR29","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Khurana, D., Sahai, A., Srinivasan, A.: Round-optimal black-box MPC in the plain model. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02023, Part\u00a0I. Lecture Notes in Computer Science, vol. 14081, pp. 393\u2013426. Springer, Cham, Switzerland, Santa Barbara, CA, USA (Aug\u00a020\u201324, 2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_13","DOI":"10.1007\/978-3-031-38557-5_13"},{"key":"12_CR30","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer - efficiently. In: Wagner, D. (ed.) Advances in Cryptology \u2013 CRYPTO\u00a02008. Lecture Notes in Computer Science, vol.\u00a05157, pp. 572\u2013591. Springer Berlin Heidelberg, Germany, Santa Barbara, CA, USA (Aug\u00a017\u201321, 2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_32","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography, Second Edition. Chapman & Hall\/CRC Cryptography and Network Security Series, Taylor & Francis (2014). https:\/\/books.google.co.uk\/books?id=OWZYBQAAQBAJ","DOI":"10.1201\/b17668"},{"key":"12_CR32","doi-asserted-by":"publisher","unstructured":"Katz, J., Ostrovsky, R.: Round-optimal secure two-party computation. In: Advances in Cryptology - CRYPTO 2004, 24th Annual International CryptologyConference, Santa Barbara, California, USA, August 15-19, 2004, Proceedings. Lecture Notes in Computer Science, vol.\u00a03152, pp. 335\u2013354. Springer (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_21, https:\/\/iacr.org\/archive\/crypto2004\/31520336\/revised-Katz-Ostrovsky.pdf","DOI":"10.1007\/978-3-540-28628-8_21"},{"key":"12_CR33","doi-asserted-by":"publisher","unstructured":"Katz, J., Ostrovsky, R., Smith, A.: Round efficiency of multi-party computation with a dishonest majority. In: Biham, E. (ed.) Advances in Cryptology \u2013 EUROCRYPT\u00a02003. Lecture Notes in Computer Science, vol.\u00a02656, pp. 578\u2013595. Springer Berlin Heidelberg, Germany, Warsaw, Poland (May\u00a04\u20138, 2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_36","DOI":"10.1007\/3-540-39200-9_36"},{"key":"12_CR34","doi-asserted-by":"publisher","unstructured":"Katz, J., Ranellucci, S., Rosulek, M., Wang, X.: Optimizing authenticated garbling for faster secure two-party computation. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02018, Part\u00a0III. Lecture Notes in Computer Science, vol. 10993, pp. 365\u2013391. Springer, Cham, Switzerland, Santa Barbara, CA, USA (Aug\u00a019\u201323, 2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0v13","DOI":"10.1007\/978-3-319-96878-0v13"},{"key":"12_CR35","doi-asserted-by":"publisher","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: 20th Annual ACM Symposium on Theory of Computing, pp. 20\u201331. ACM Press, Chicago, IL, USA (May\u00a02\u20134, 1988). https:\/\/doi.org\/10.1145\/62212.62215","DOI":"10.1145\/62212.62215"},{"key":"12_CR36","doi-asserted-by":"publisher","unstructured":"Nielsen, J.B., Nordholt, P.S., Orlandi, C., Burra, S.S.: A new approach to practical active-secure two-party computation. In: Safavi-Naini, R., Canetti, R. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02012. Lecture Notes in Computer Science, vol.\u00a07417, pp. 681\u2013700. Springer Berlin Heidelberg, Germany, Santa Barbara, CA, USA (Aug\u00a019\u201323, 2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_40","DOI":"10.1007\/978-3-642-32009-5_40"},{"key":"12_CR37","doi-asserted-by":"publisher","unstructured":"Nielsen, J.B., Schneider, T., Trifiletti, R.: Constant round maliciously secure 2PC with function-independent preprocessing using LEGO. In: ISOC Network and Distributed System Security Symposium \u2013 NDSS\u00a02017. The Internet Society, San Diego, CA, USA (Feb\u00a026\u00a0\u2013\u00a0Mar\u00a01, 2017). https:\/\/doi.org\/10.14722\/ndss.2017.23075","DOI":"10.14722\/ndss.2017.23075"},{"key":"12_CR38","doi-asserted-by":"publisher","unstructured":"Pass, R.: Bounded-concurrent secure multi-party computation with a dishonest majority. In: Babai, L. (ed.) 36th Annual ACM Symposium on Theory of Computing, pp. 232\u2013241. ACM Press, Chicago, IL, USA (Jun\u00a013\u201316, 2004). https:\/\/doi.org\/10.1145\/1007352.1007393","DOI":"10.1145\/1007352.1007393"},{"key":"12_CR39","doi-asserted-by":"publisher","unstructured":"Pass, R., Wee, H.: Constant-round non-malleable commitments from sub-exponential one-way functions. In: Gilbert, H. (ed.) Advances in Cryptology \u2013 EUROCRYPT\u00a02010. Lecture Notes in Computer Science, vol.\u00a06110, pp. 638\u2013655. Springer Berlin Heidelberg, Germany, French Riviera (May\u00a030\u00a0\u2013\u00a0Jun\u00a03, 2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_32","DOI":"10.1007\/978-3-642-13190-5_32"},{"key":"12_CR40","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: 27th Annual Symposium on Foundations of Computer Science, pp. 162\u2013167. IEEE Computer Society Press, Toronto, Ontario, Canada (Oct\u00a027\u201329, 1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-95761-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T13:30:19Z","timestamp":1750512619000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-95761-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031957604","9783031957611"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-95761-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/acns2025.fordaysec.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}