{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T09:06:15Z","timestamp":1753520775358,"version":"3.40.3"},"publisher-location":"Cham","reference-count":42,"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_3","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T22:01:41Z","timestamp":1723759301000},"page":"74-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["MPC for\u00a0Tech Giants (GMPC): Enabling Gulliver and\u00a0the\u00a0Lilliputians to\u00a0Cooperate Amicably"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8392-0245","authenticated-orcid":false,"given":"Bar","family":"Alon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3381-0221","authenticated-orcid":false,"given":"Moni","family":"Naor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8928-0587","authenticated-orcid":false,"given":"Eran","family":"Omri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7584-8768","authenticated-orcid":false,"given":"Uri","family":"Stemmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"3_CR1","unstructured":"Alon, B., Naor, M., Omri, E., Stemmer, U.: MPC for tech giants (GMPC): enabling Gulliver and the lilliputians to cooperate amicably. Cryptology ePrint Archive, Paper 2022\/902 (2022). https:\/\/eprint.iacr.org\/2022\/902"},{"issue":"4","key":"3_CR2","doi-asserted-by":"publisher","first-page":"48","DOI":"10.2478\/popets-2020-0062","volume":"2020","author":"B Avent","year":"2020","unstructured":"Avent, B., Dubey, Y., Korolova, A.: The power of the hybrid model for mean estimation. Proc. Priv. Enhancing Technol. 2020(4), 48\u201368 (2020)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"3_CR3","unstructured":"Avent, B., Korolova, A., Zeber, D., Hovden, T., Livshits, B.: BLENDER: enabling local search with a hybrid differential privacy model. In: 26th USENIX Security Symposium (USENIX Security 17), pp. 747\u2013764. USENIX Association (2017)"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/978-3-030-26951-7_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18\u201322, 2019, Proceedings, Part II","author":"B Balle","year":"2019","unstructured":"Balle, B., Bell, J., Gasc\u00f3n, A., Nissim, K.: The privacy blanket of the shuffle model. In: Boldyreva, A., Micciancio, D. (eds.) Advances in Cryptology \u2013 CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18\u201322, 2019, Proceedings, Part II, pp. 638\u2013667. Springer International Publishing, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_22"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Balle, B., Bell, J., Gasc\u00f3n, A., Nissim, K.: Private summation in the multi-message shuffle model. In: CCS, pp. 657\u2013676. ACM (2020)","DOI":"10.1145\/3372297.3417242"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/978-3-030-64378-2_24","volume-title":"Theory of Cryptography: 18th International Conference, TCC 2020, Durham, NC, USA, November 16\u201319, 2020, Proceedings, Part II","author":"A Beimel","year":"2020","unstructured":"Beimel, A., Haitner, I., Nissim, K., Stemmer, U.: On the round complexity of the shuffle model. In: Pass, R., Pietrzak, K. (eds.) Theory of Cryptography: 18th International Conference, TCC 2020, Durham, NC, USA, November 16\u201319, 2020, Proceedings, Part II, pp. 683\u2013712. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_24"},{"key":"3_CR7","unstructured":"Beimel, A., Korolova, A., Nissim, K., Sheffet, O., Stemmer, U.: The power of synergy in differential privacy: combining a small curator with local randomizers. In: ITC, LIPIcs, vol. 163, pp. 14:1\u201314:25. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"3_CR8","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: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) CCS \u201920: 2020 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, USA, November 9-13, 2020, pp. 1253\u20131269. ACM (2020)","DOI":"10.1145\/3372297.3417885"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Bittau, A., et al.: PROCHLO: strong privacy for analytics in the crowd. In: Proceedings of the 26th Symposium on Operating Systems Principles, pp. 441\u2013459. ACM (2017)","DOI":"10.1145\/3132747.3132769"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Bonawitz, K., et al.: Practical secure aggregation for privacy-preserving machine learning. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 1175\u20131191. CCS \u201917, Association for Computing Machinery, New York, NY, USA (2017)","DOI":"10.1145\/3133956.3133982"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-030-26954-8_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18\u201322, 2019, Proceedings, Part III","author":"D Boneh","year":"2019","unstructured":"Boneh, D., Boyle, E., Corrigan-Gibbs, H., Gilboa, N., Ishai, Y.: Zero-knowledge proofs on secret-shared data via fully linear PCPs. In: Boldyreva, A., Micciancio, D. (eds.) Advances in Cryptology \u2013 CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18\u201322, 2019, Proceedings, Part III, pp. 67\u201397. Springer International Publishing, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_3"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-319-96878-0_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018: 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19\u201323, 2018, Proceedings, Part III","author":"E Boyle","year":"2018","unstructured":"Boyle, E., Cohen, R., Data, D., Hub\u00e1\u010dek, P.: Must the communication graph of MPC protocols be an expander? In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2018: 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19\u201323, 2018, Proceedings, Part III, pp. 243\u2013272. Springer International Publishing, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_9"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Boyle, E., Cohen, R., Goel, A.: Breaking the $$O(\\sqrt{n})$$-bit barrier: byzantine agreement with polylog bits per party. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, pp. 319\u2013330 (2021)","DOI":"10.1145\/3465084.3467897"},{"issue":"3","key":"3_CR14","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s00446-013-0206-z","volume":"27","author":"E Boyle","year":"2014","unstructured":"Boyle, E., Goldwasser, S., Kalai, Y.T.: Leakage-resilient coin tossing. Distrib. Comput. 27(3), 147\u2013164 (2014)","journal-title":"Distrib. Comput."},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-642-36594-2_21","volume-title":"Theory of Cryptography: 10th Theory of Cryptography Conference, TCC 2013, Tokyo, Japan, March 3-6, 2013. Proceedings","author":"E Boyle","year":"2013","unstructured":"Boyle, E., Goldwasser, S., Tessaro, S.: Communication locality in secure multi-party computation: how to run sublinear algorithms in a distributed setting. In: Sahai, A. (ed.) Theory of Cryptography: 10th Theory of Cryptography Conference, TCC 2013, Tokyo, Japan, March 3-6, 2013. Proceedings, pp. 356\u2013376. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_21"},{"key":"3_CR16","unstructured":"Boyle, E., Jain, A., Prabhakaran, M., Yu, C.H.: The bottleneck complexity of secure multiparty computation. In: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Bracha, G.: An O(log n) expected rounds randomized byzantine generals protocol. In: STOC (1985)","DOI":"10.1145\/22145.22180"},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pp. 136\u2013145. IEEE (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-44647-8_2","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"R Canetti","year":"2001","unstructured":"Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) Advances in Cryptology \u2014 CRYPTO 2001, pp. 19\u201340. Springer, Berlin, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_2"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Chandran, N., Chongchitmate, W., Garay, J.A., Goldwasser, S., Ostrovsky, R., Zikas, V.: The hidden graph model: communication locality and optimal resiliency with adaptive faults. In: Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, pp. 153\u2013162 (2015)","DOI":"10.1145\/2688073.2688102"},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-030-17653-2_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019: 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19\u201323, 2019, Proceedings, Part I","author":"A Cheu","year":"2019","unstructured":"Cheu, A., Smith, A., Ullman, J., Zeber, D., Zhilyaev, M.: Distributed differential privacy via shuffling. In: Ishai, Y., Rijmen, V. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2019: 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19\u201323, 2019, Proceedings, Part I, pp. 375\u2013403. Springer International Publishing, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_13"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Cheu, A., Ullman, J.R.: The limits of pan privacy and shuffle privacy for learning and estimation. In: STOC, pp. 1081\u20131094. ACM (2021)","DOI":"10.1145\/3406325.3450995"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Cohen, R., Haitner, I., Omri, E., Rotem, L.: From fairness to full security in multiparty computation. In: SCN, pp. 216\u2013234 (2018)","DOI":"10.1007\/978-3-319-98113-0_12"},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"Theory of Cryptography","author":"C Dwork","year":"2006","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) Theory of Cryptography, pp. 265\u2013284. Springer, Berlin, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_14"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Erlingsson, \u00da., Feldman, V., Mironov, I., Raghunathan, A., Talwar, K., Thakurta, A.: Amplification by shuffling: from local to central differential privacy via anonymity. In: Chan, T.M. (ed.) Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, pp. 2468\u20132479. SIAM (2019)","DOI":"10.1137\/1.9781611975482.151"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Feige, U.: Noncryptographic selection protocols. In: 40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039), pp. 142\u2013152. IEEE (1999)","DOI":"10.1109\/SFFCS.1999.814586"},{"key":"3_CR28","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-84245-1_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16\u201320, 2021, Proceedings, Part II","author":"C Gentry","year":"2021","unstructured":"Gentry, C., et al.: YOSO: you only speak once: secure MPC with stateless ephemeral roles. In: Malkin, T., Peikert, C. (eds.) Advances in Cryptology \u2013 CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16\u201320, 2021, Proceedings, Part II, pp. 64\u201393. Springer International Publishing, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_3"},{"key":"3_CR29","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-030-77883-5_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021: 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, October 17\u201321, 2021, Proceedings, Part III","author":"B Ghazi","year":"2021","unstructured":"Ghazi, B., Golowich, N., Kumar, R., Pagh, R., Velingker, A.: On the power of multiple anonymous messages: frequency estimation and\u00a0selection in the shuffle model of\u00a0differential privacy. In: Canteaut, A., Standaert, F.-X. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2021: 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, October 17\u201321, 2021, Proceedings, Part III, pp. 463\u2013488. Springer International Publishing, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_16"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography, Volume II \u2013 Basic Applications. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Cryptography from anonymity. In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 239\u2013248. IEEE Computer Society (2006)","DOI":"10.1109\/FOCS.2006.25"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M.: The small-world phenomenon: an algorithmic perspective. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, May 21-23, 2000, pp. 163\u2013170. ACM (2000)","DOI":"10.1145\/335305.335325"},{"key":"3_CR33","unstructured":"Kohen, R., Sheffet, O.: Transfer learning in differential privacy\u2019s hybrid-model. CoRR abs\/2201.12018 (2022)"},{"issue":"3","key":"3_CR34","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R.E., Pease, M.C.: The byzantine generals problem. ACM Trans. Programm. Lang. Syst. (TOPLAS) 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Programm. Lang. Syst. (TOPLAS)"},{"key":"3_CR35","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-540-24638-1_12","volume-title":"Theory of Cryptography","author":"Y Lindell","year":"2004","unstructured":"Lindell, Y.: Lower bounds for concurrent self composition. In: Naor, M. (ed.) Theory of Cryptography, pp. 203\u2013222. Springer, Berlin, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_12"},{"issue":"2","key":"3_CR36","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/s00145-007-9015-5","volume":"21","author":"Y Lindell","year":"2008","unstructured":"Lindell, Y.: Lower bounds and impossibility results for concurrent self composition. J. Cryptol. 21(2), 200\u2013249 (2008)","journal-title":"J. Cryptol."},{"key":"3_CR37","doi-asserted-by":"crossref","unstructured":"Manku, G.S., Naor, M., Wieder, U.: Know thy neighbor\u2019s neighbor: the power of lookahead in randomized P2P networks. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 54\u201363. ACM (2004)","DOI":"10.1145\/1007352.1007368"},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"Naor, M., Parter, M., Yogev, E.: The power of distributed verifiers in interactive proofs. In: Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, pp. 1096\u2013115. SIAM (2020)","DOI":"10.1137\/1.9781611975994.67"},{"key":"3_CR39","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/978-3-642-34961-4_42","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"R Pass","year":"2012","unstructured":"Pass, R., Lin, H., Venkitasubramaniam, M.: A unified framework for UC from only OT. In: Wang, X., Sako, K. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2012, pp. 699\u2013717. Springer, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_42"},{"issue":"2","key":"3_CR40","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"MC Pease","year":"1980","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"3_CR41","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-030-78086-9_27","volume-title":"Cyber Security Cryptography and Machine Learning: 5th International Symposium, CSCML 2021, Be\u2019er Sheva, Israel, July 8\u20139, 2021, Proceedings","author":"L Reyzin","year":"2021","unstructured":"Reyzin, L., Smith, A., Yakoubov, S.: Turning HATE into LOVE: compact homomorphic ad hoc threshold encryption for scalable MPC. In: Dolev, S., Margalit, O., Pinkas, B., Schwarzmann, A. (eds.) Cyber Security Cryptography and Machine Learning: 5th International Symposium, CSCML 2021, Be\u2019er Sheva, Israel, July 8\u20139, 2021, Proceedings, pp. 361\u2013378. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-78086-9_27"},{"key":"3_CR42","unstructured":"Tenenbaum, J., Kaplan, H., Mansour, Y., Stemmer, U.: Differentially private multi-armed bandits in the shuffle model. In: Advances in Neural Information Processing Systems, vol.\u00a034, pp. 24956\u201324967. Curran Associates, Inc. (2021)"}],"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_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T19:25:18Z","timestamp":1732649118000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68397-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683961","9783031683978"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68397-8_3","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"}}]}}