{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:19:52Z","timestamp":1757618392574,"version":"3.44.0"},"publisher-location":"Cham","reference-count":80,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031957604"},{"type":"electronic","value":"9783031957611"}],"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_11","type":"book-chapter","created":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T09:30:09Z","timestamp":1750498209000},"page":"308-338","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Share&Shrink: Efficient and\u00a0Delegatable MPC in\u00a0One Broadcast then Asynchrony"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-3670-0146","authenticated-orcid":false,"given":"Antoine","family":"Urban","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0003-3042-6504","authenticated-orcid":false,"given":"Matthieu","family":"Rambaud","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,22]]},"reference":[{"key":"11_CR1","unstructured":"Compilation of public comments on multi-party threshold cryptography project (2023). https:\/\/csrc.nist.gov\/files\/pubs\/ir\/8214\/c\/ipd\/docs\/nistir-8214c-ipd-public-feedback.pdf"},{"key":"11_CR2","unstructured":"Delegated multi-key private matching for compute: Improving match rates and enabling adoption (2023). https:\/\/research.facebook.com\/blog\/2023\/1\/delegated-multi-key-private-matching-for-compute-improving-match-rates-and-enabling-adoption\/"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Acharya, A., Hazay, C., Kolesnikov, V., Prabhakaran, M.: SCALES: MPC with small clients and larger ephemeral servers. TCC (2022)","DOI":"10.1007\/978-3-031-22365-5_18"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Boyen, X., Vaikuntanathan, V., Voulgaris, P., Wee, H.: Functional encryption for threshold functions (or fuzzy IBE) from lattices. In: PKC (2012)","DOI":"10.1007\/978-3-642-30057-8_17"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Albrecht, M., et al.: Homomorphic Encryption Standard (2021)","DOI":"10.1007\/978-3-030-77287-1_2"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Alon, B., Naor, M., Omri, E., Stemmer, U.: MPC for tech giants (GMPC): enabling gulliver and the lilliputians to cooperate amicably. In: CRYPTO (2024)","DOI":"10.1007\/978-3-031-68397-8_3"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Ananth, P., Choudhuri, A.R., Goel, A., Jain, A.: Round-optimal secure multiparty computation with honest majority. In: CRYPTO (2018)","DOI":"10.1007\/978-3-319-96881-0_14"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Ananth, P., Choudhuri, A.R., Goel, A., Jain, A.: Two round information-theoretic MPC with malicious security. In: EUROCRYPT (2019)","DOI":"10.1007\/978-3-030-17656-3_19"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Ananth, P., Choudhuri, A.R., Goel, A., Jain, A.: Towards efficiency-preserving round compression in MPC. In: ASIACRYPT (2020)","DOI":"10.1007\/978-3-030-64840-4_7"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Asharov, G., Jain, A., L\u00f3pez-Alt, A., Tromer, E., Vaikuntanathan, V., Wichs, D.: Multiparty computation with low communication, computation and interaction via threshold FHE. In: EUROCRYPT (2012)","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Babai, L., Fortnow, L., Levin, L.A., Szegedy, M.: Checking computations in polylogarithmic time. In: Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing. STOC 1991 (1991)","DOI":"10.1145\/103418.103428"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Badrinarayanan, S., Jain, A., Manohar, N., Sahai, A.: Secure MPC: laziness leads to GOD. In: ASIACRYPT (2020)","DOI":"10.1007\/978-3-030-64840-4_5"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Badrinarayanan, S., Miao, P., Mukherjee, P., Ravi, D.: On the round complexity of fully secure solitary MPC with honest majority. In: TCC (2023)","DOI":"10.1007\/978-3-031-48618-0_5"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Barak, A., Hirt, M., Koskas, L., Lindell, Y.: An end-to-end system for large scale P2P MPC-as-a-service and low-bandwidth MPC for weak participants. In: CCS (2018)","DOI":"10.1145\/3243734.3243801"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, pp. 503\u2013513 (1990)","DOI":"10.1145\/100216.100287"},{"key":"11_CR16","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M., Nielsen, J.B.: Almost-asynchronous MPC with faulty minority. In: PODC 2010 (2010). We refer to eprint 2008\/416"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Bell, J.H., Bonawitz, K.A., Gasc\u00f3n, A., Lepoint, T., Raykova, M.: Secure single-server aggregation with (poly) logarithmic overhead. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security (2020)","DOI":"10.1145\/3372297.3417885"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Bonawitz, K., et al.: Practical secure aggregation for privacy-preserving machine learning. In: CCS (2017)","DOI":"10.1145\/3133956.3133982"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Boneh, D., et al.: Threshold cryptosystems from threshold fully homomorphic encryption. In: CRYPTO (2018)","DOI":"10.1007\/978-3-319-96884-1_19"},{"key":"11_CR20","unstructured":"Boneh, D., Goh, E., Nissim, K.: Evaluating encryption schemes for pattern matching. In: EUROCRYPT 2005, pp. 40\u201362. Springer (2005)"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Halevi, S., Polychroniadou, A.: Four round secure computation without setup. In: TCC (2017)","DOI":"10.1007\/978-3-319-70500-2_22"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Braun, L., Damg\u00e5rd, I., Orlandi, C.: Secure multiparty computation from threshold encryption based on class groups. In: CRYPTO (2023)","DOI":"10.1007\/978-3-031-38557-5_20"},{"key":"11_CR23","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS (2001). We refer to eprint 2000\/067 version 02\/20\/2020"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Castagnos, G., Laguillaumie, F.: Linearly homomorphic encryption from DDH. In: CT RSA (2015)","DOI":"10.1007\/978-3-319-16715-2_26"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Chen, H., Dai, W., Kim, M., Song, Y.: Efficient multi-key homomorphic encryption with packed ciphertexts with application to oblivious neural network inference. In: CCS (2019)","DOI":"10.1145\/3319535.3363207"},{"key":"11_CR26","unstructured":"Chen, S., Cheon, J.H., Kim, D., Park, D.: Verifiable computing for approximate computation. Cryptology ePrint Archive (2019)"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In: ASIACRYPT (2017)","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Choudhury, A., Loftus, J., Orsini, E., Patra, A., Smart, N.P.: Between a rock and a hard place: interpolating between MPC and FHE. In: ASIACRYPT (2013)","DOI":"10.1007\/978-3-642-42045-0_12"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Cohen, R., Garay, J., Zikas, V.: Broadcast-optimal two-round MPC. In: EUROCRYPT (2020)","DOI":"10.1007\/978-3-030-45724-2_28"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Coretti, S., Garay, J., Hirt, M., Zikas, V.: Constant-round asynchronous multi-party computation based on one-way functions. In: ASIACRYPT (2016)","DOI":"10.1007\/978-3-662-53890-6_33"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.B.: Multiparty computation from threshold homomorphic encryption. In: EUROCRYPT (2001)","DOI":"10.1007\/3-540-44987-6_18"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.: Secure Multiparty Computation and Secret Sharing. Cambridge University Press (2015)","DOI":"10.1017\/CBO9781107337756"},{"key":"11_CR33","doi-asserted-by":"crossref","unstructured":"Dachman-Soled, D., Gong, H., Kulkarni, M., Shahverdi, A.: Towards a ring analogue of the leftover hash lemma. J. Math. Cryptol. (2021)","DOI":"10.1515\/jmc-2020-0076"},{"key":"11_CR34","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Magri, B., Ravi, D., Siniscalchi, L., Yakoubov, S.: Broadcast-optimal two round MPC with an honest majority. In: CRYPTO (2021)","DOI":"10.1007\/978-3-030-84245-1_6"},{"key":"11_CR35","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Ravi, D., Siniscalchi, L., Yakoubov, S.: Minimizing setup in broadcast-optimal two round MPC. In: EUROCRYPT (2023)","DOI":"10.1007\/978-3-031-30617-4_5"},{"key":"11_CR36","doi-asserted-by":"crossref","unstructured":"Dao, Q., Grubbs, P.: Spartan and bulletproofs are simulation-extractable (for free!). In: EUROCRYPT (2023)","DOI":"10.1007\/978-3-031-30617-4_18"},{"issue":"1","key":"11_CR37","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1145\/2455.214112","volume":"32","author":"D Dolev","year":"1985","unstructured":"Dolev, D., Reischuk, R.: Bounds on information exchange for byzantine agreement. J. ACM (JACM) 32(1), 191\u2013204 (1985)","journal-title":"J. ACM (JACM)"},{"key":"11_CR38","doi-asserted-by":"crossref","unstructured":"Dov\u00a0Gordon, S., Liu, F.H., Shi, E.: Constant-round MPC with fairness and guarantee of output delivery. In: CRYPTO (2015)","DOI":"10.1007\/978-3-662-48000-7_4"},{"key":"11_CR39","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. IACR ePrint (2012)"},{"key":"11_CR40","unstructured":"Fehr, S.: Span Programs over Rings and How to Share a Secret from a Module. Master\u2019s thesis, ETH Zurich (1998)"},{"key":"11_CR41","doi-asserted-by":"crossref","unstructured":"Fiore, D., Nitulescu, A., Pointcheval, D.: Boosting verifiable computation on encrypted data. In: Public-Key Cryptography\u2013PKC (2020)","DOI":"10.1007\/978-3-030-45388-6_5"},{"key":"11_CR42","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Nielsen, J.B.: On the number of synchronous rounds sufficient for authenticated byzantine agreement. In: DISC (2009)","DOI":"10.1007\/978-3-642-04355-0_46"},{"key":"11_CR43","doi-asserted-by":"crossref","unstructured":"Fouque, P.A., Stern, J.: One round threshold discrete-log key generation without private channels. In: PKC (2001)","DOI":"10.1007\/3-540-44586-2_22"},{"key":"11_CR44","doi-asserted-by":"crossref","unstructured":"Garay, J., Givens, C., Ostrovsky, R., Raykov, P.: Broadcast (and round) efficient verifiable secret sharing. In: ITC (2013)","DOI":"10.1007\/978-3-319-04268-8_12"},{"key":"11_CR45","doi-asserted-by":"crossref","unstructured":"Gentry, C., et al.: YOSO: you only speak once\/secure MPC with stateless ephemeral roles. In: CRYPTO (2021)","DOI":"10.1007\/978-3-030-84245-1_3"},{"key":"11_CR46","doi-asserted-by":"crossref","unstructured":"Gentry, C., Halevi, S., Vadim, L.: Practical non-interactive publicly verifiable secret sharing with thousands of parties. In: EUROCRYPT (2022)","DOI":"10.1007\/978-3-031-06944-4_16"},{"key":"11_CR47","doi-asserted-by":"crossref","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: CRYPTO (2013)","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"11_CR48","doi-asserted-by":"crossref","unstructured":"Goel, A., Jain, A., Prabhakaran, M., Raghunath, R.: On communication models and best-achievable security in two-round MPC. In: TCC (2021)","DOI":"10.1007\/978-3-030-90453-1_4"},{"key":"11_CR49","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions. In: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing. STOC 1989 (1989)","DOI":"10.1145\/73007.73009"},{"key":"11_CR50","unstructured":"ISO\/IEC: ISO\/IEC 18033-6:2019 it security techniques-encryption algorithms-part 6: Homomorphic encryption (2019). https:\/\/www.iso.org\/obp\/ui\/#iso:std:iso-iec:18033:-6"},{"key":"11_CR51","doi-asserted-by":"crossref","unstructured":"Kate, A., Mangipudi, E.V., Mukherjee, P., Saleem, H., Thyagarajan, S.A.K.: Non-interactive VSS using class groups and application to DKG. In: CCS (2024)","DOI":"10.1145\/3658644.3670312"},{"key":"11_CR52","doi-asserted-by":"crossref","unstructured":"Katz, J., Koo, C.Y.: On expected constant-round protocols for byzantine agreement. In: Annual International Cryptology Conference (2006)","DOI":"10.1007\/11818175_27"},{"key":"11_CR53","unstructured":"Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Universally composable synchronous computation. In: TCC (2011)"},{"key":"11_CR54","doi-asserted-by":"crossref","unstructured":"Kim, E., Jeong, J., Yoon, H., Kim, Y., Cho, J., Cheon, J.H.: How to securely collaborate on data: decentralized threshold he and secure key update. IEEE Access (2020)","DOI":"10.1109\/ACCESS.2020.3030970"},{"key":"11_CR55","doi-asserted-by":"crossref","unstructured":"Kim, T., Kwak, H., Lee, D., Seo, J., Song, Y.: Asymptotically faster multi-key homomorphic encryption from homomorphic gadget decomposition. In: CCS (2023)","DOI":"10.1145\/3576915.3623176"},{"key":"11_CR56","unstructured":"Klemsa, J., \u00d6nen, M., Akin, Y.: A practical TFHE-based multi-key homomorphic encryption with linear complexity and low noise growth. In: ESORICS (2023)"},{"key":"11_CR57","unstructured":"Kolby, S., Ravi, D., Yakoubov, S.: Constant-round YOSO MPC without setup. Cryptology ePrint Archive, Paper 2022\/187 (2022)"},{"key":"11_CR58","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1007\/s00145-019-09322-2","volume":"32","author":"Y Lindell","year":"2019","unstructured":"Lindell, Y., Pinkas, B., Smart, N.P., Yanai, A.: Efficient constant-round multi-party computation combining BMR and SPDZ. J. Cryptol. 32, 1026\u20131069 (2019)","journal-title":"J. Cryptol."},{"key":"11_CR59","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Smart, N.P., Soria-Vazquez, E.: More efficient constant-round multi-party computation from BMR and SHE. In: TCC (2016)","DOI":"10.1007\/978-3-662-53641-4_21"},{"key":"11_CR60","doi-asserted-by":"crossref","unstructured":"Liu-Zhang, C., Loss, J., Maurer, U., Moran, T., Tschudi, D.: MPC with synchronous security and asynchronous responsiveness. In: ASIACRYPT (2020)","DOI":"10.1007\/978-3-030-64840-4_4"},{"key":"11_CR61","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. J. ACM (2013)","DOI":"10.1145\/2535925"},{"key":"11_CR62","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: A toolkit for ring-LWE cryptography. In: EUROCRYPT (2013)","DOI":"10.1007\/978-3-642-38348-9_3"},{"issue":"2","key":"11_CR63","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/s00145-023-09452-8","volume":"36","author":"C Mouchet","year":"2023","unstructured":"Mouchet, C., Bertrand, E., Hubaux, J.P.: An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption. J. Cryptol. 36(2), 10 (2023)","journal-title":"J. Cryptol."},{"key":"11_CR64","doi-asserted-by":"crossref","unstructured":"Mouchet, C., Troncoso-Pastoriza, J., Bossuat, J.P., Hubaux, J.P.: Multiparty homomorphic encryption from ring-learning-with-errors. PoPETS (2021)","DOI":"10.2478\/popets-2021-0071"},{"key":"11_CR65","doi-asserted-by":"crossref","unstructured":"Mouris, D., Masny, D., Trieu, N., Sengupta, S., Buddhavarapu, P., Case, B.: Delegated private matching for compute. Proc. Priv. Enhancing Technol. (2024)","DOI":"10.56553\/popets-2024-0040"},{"key":"11_CR66","doi-asserted-by":"crossref","unstructured":"Mukherjee, P., Wichs, D.: Two round multiparty computation via multi-key FHE. In: EUROCRYPT (2016)","DOI":"10.1007\/978-3-662-49896-5_26"},{"key":"11_CR67","doi-asserted-by":"crossref","unstructured":"Park, J.: Homomorphic encryption for multiple users with less communications. IEEE Access (2021)","DOI":"10.1109\/ACCESS.2021.3117029"},{"key":"11_CR68","doi-asserted-by":"crossref","unstructured":"Parno, B., Raykova, M., Vaikuntanathan, V.: How to delegate and verify in public: verifiable computation from attribute-based encryption. In: TCC (2012)","DOI":"10.1007\/978-3-642-28914-9_24"},{"key":"11_CR69","doi-asserted-by":"crossref","unstructured":"Patra, A., Ravi, D.: On the power of hybrid networks in multi-party computation. IEEE Trans. Inf. Theory (2018)","DOI":"10.1109\/TIT.2018.2827360"},{"key":"11_CR70","doi-asserted-by":"crossref","unstructured":"Rachuri, R., Scholl, P.: Le mans: dynamic and fluid MPC for dishonest majority. In: CRYPTO (2022)","DOI":"10.1007\/978-3-031-15802-5_25"},{"key":"11_CR71","doi-asserted-by":"crossref","unstructured":"Reyzin, L., Smith, A.D., Yakoubov, S.: Turning HATE into LOVE: compact homomorphic ad hoc threshold encryption for scalable MPC. In: CSCML (2021)","DOI":"10.1007\/978-3-030-78086-9_27"},{"key":"11_CR72","doi-asserted-by":"crossref","unstructured":"Schoenmakers, B., Veeningen, M., de\u00a0Vreede, N.: Trinocchio: privacy-preserving outsourcing by distributed verifiable computation. In: ACNS (2016)","DOI":"10.1007\/978-3-319-39555-5_19"},{"issue":"11","key":"11_CR73","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). https:\/\/doi.org\/10.1145\/359168.359176","journal-title":"Commun. ACM"},{"key":"11_CR74","unstructured":"Shrestha, N., Bhat, A., Kate, A., Nayak, K.: Synchronous distributed key generation without broadcasts. ePrint 2021\/1635 (2021)"},{"key":"11_CR75","doi-asserted-by":"publisher","first-page":"3517","DOI":"10.1109\/TIFS.2023.3283910","volume":"18","author":"F Tang","year":"2023","unstructured":"Tang, F., et al.: Solving small exponential ECDLP in EC-based additively homomorphic encryption and applications. IEEE Trans. Inf. Forensics Secur. 18, 3517\u20133530 (2023)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"11_CR76","unstructured":"Urban, A., Rambaud, M.: Share & shrink: (in-)feasibility of MPC from one broadcast-then-asynchrony, and delegated computation. Cryptology ePrint Archive, Paper 2022\/378 (2022). https:\/\/eprint.iacr.org\/2022\/378"},{"key":"11_CR77","doi-asserted-by":"crossref","unstructured":"Urban, A., Rambaud, M.: Robust multiparty computation from threshold encryption based on RLWE. ISC (2024)","DOI":"10.1007\/978-3-031-75757-0_15"},{"key":"11_CR78","doi-asserted-by":"crossref","unstructured":"Wan, J., Momose, A., Ren, L., Shi, E., Xiang, Z.: On the amortized communication complexity of byzantine broadcast. In: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, pp. 253\u2013261 (2023)","DOI":"10.1145\/3583668.3594596"},{"key":"11_CR79","doi-asserted-by":"crossref","unstructured":"Wu, W., Homsi, S., Zhang, Y.: Confidential and verifiable machine learning delegations on the cloud. Cryptology ePrint, Paper 2024\/537 (2024)","DOI":"10.1007\/978-3-031-70890-9_10"},{"key":"11_CR80","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982), pp. 160\u2013164. IEEE (1982)","DOI":"10.1109\/SFCS.1982.38"}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T21:22:36Z","timestamp":1757193756000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-95761-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031957604","9783031957611"],"references-count":80,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-95761-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}}]}}