{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:34:36Z","timestamp":1743143676518,"version":"3.40.3"},"publisher-location":"Cham","reference-count":45,"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_12","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T22:01:41Z","timestamp":1723759301000},"page":"384-417","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scalable Multiparty Computation from\u00a0Non-linear Secret Sharing"],"prefix":"10.1007","author":[{"given":"Sanjam","family":"Garg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhishek","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pratyay","family":"Mukherjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingyuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"12_CR1","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-030-36030-6_19","volume-title":"TCC 2019, Part I","author":"M Abspoel","year":"2019","unstructured":"Abspoel, M., Cramer, R., Damg\u00e5rd, I., Escudero, D., Yuan, C.: Efficient information-theoretic secure multiparty computation over $$\\mathbb{Z} \/p^k\\mathbb{Z} $$ via galois rings. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019, Part I. LNCS, vol. 11891, pp. 471\u2013501. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_19"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: How to garble arithmetic circuits. In: Ostrovsky, R. (ed.) 52nd Annual Symposium on Foundations of Computer Science, Palm Springs, CA, USA, 22\u201325 October 2011, pp. 120\u2013129. IEEE Computer Society Press (2011)","DOI":"10.1109\/FOCS.2011.40"},{"key":"12_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-642-29011-4_29","volume-title":"EUROCRYPT 2012","author":"G Asharov","year":"2012","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: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 483\u2013501. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_29"},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s00145-015-9214-4","volume":"30","author":"G Asharov","year":"2017","unstructured":"Asharov, G., Lindell, Y.: A full proof of the BGW protocol for perfectly secure multiparty computation. J. Cryptol. 30(1), 58\u2013151 (2017)","journal-title":"J. Cryptol."},{"issue":"2","key":"12_CR5","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/TIT.1983.1056651","volume":"29","author":"C Asmuth","year":"1983","unstructured":"Asmuth, C., Bloom, J.: A modular approach to key safeguarding. IEEE Trans. Inf. Theory 29(2), 208\u2013210 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"12_CR6","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-031-30617-4_1","volume-title":"EUROCRYPT 2023, Part II","author":"M Ball","year":"2023","unstructured":"Ball, M., Li, H., Lin, H., Liu, T.: New ways to garble arithmetic circuits. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part II. LNCS, vol. 14005, pp. 3\u201334. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_1"},{"key":"12_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"CRYPTO 1991","author":"D Beaver","year":"1992","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 420\u2013432. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_34"},{"key":"12_CR8","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/978-3-030-77886-6_23","volume-title":"EUROCRYPT 2021, Part II","author":"G Beck","year":"2021","unstructured":"Beck, G., Goel, A., Jain, A., Kaptchuk, G.: Order-C secure multiparty computation for highly repetitive circuits. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part II. LNCS, vol. 12697, pp. 663\u2013693. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_23"},{"key":"12_CR9","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 Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, 2\u20134 May 1988, pp. 1\u201310. ACM Press (1988)","DOI":"10.1145\/62212.62213"},{"key":"12_CR10","unstructured":"Bernstein, D.J.: Scaled remainder trees (2004)"},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1016\/S0022-0000(74)80029-2","volume":"8","author":"A Borodin","year":"1974","unstructured":"Borodin, A., Moenck, R.: Fast modular transforms. J. Comput. Syst. Sci. 8(3), 366\u2013386 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-46766-1_7","volume-title":"CRYPTO 1991","author":"RM Capocelli","year":"1991","unstructured":"Capocelli, R.M., De Santis, A., Gargano, L., Vaccaro, U.: On the size of shares for secret sharing schemes. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 101\u2013113. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46766-1_7"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: 20th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, 2\u20134 May 1988, pp. 11\u201319. ACM Press (1988)","DOI":"10.1145\/62212.62214"},{"key":"12_CR14","unstructured":"Chiesa, A., Lehmkuhl, R., Mishra, P., Zhang, Y.: Eos: efficient private delegation of zkSNARK provers. In: 32nd USENIX Security Symposium (USENIX Security 2023), Anaheim, CA, August 2023, pp. 6453\u20136469. USENIX Association (2023)"},{"key":"12_CR15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/3-540-39200-9_37","volume-title":"EUROCRYPT 2003","author":"R Cramer","year":"2003","unstructured":"Cramer, R., Fehr, S., Ishai, Y., Kushilevitz, E.: Efficient multi-party computation over rings. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 596\u2013613. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_37"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Dalskov, A.P.K., Escudero, D., Nof, A.: Fast fully secure multi-party computation over any ring with two-thirds honest majority. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022: 29th Conference on Computer and Communications Security, Los Angeles, CA, USA, 7\u201311 November 2022, pp. 653\u2013666. ACM Press (2022)","DOI":"10.1145\/3548606.3559389"},{"key":"12_CR17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-642-13190-5_23","volume-title":"EUROCRYPT 2010","author":"I Damg\u00e5rd","year":"2010","unstructured":"Damg\u00e5rd, I., Ishai, Y., Kr\u00f8igaard, M.: Perfectly secure multiparty computation and the computational overhead of cryptography. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 445\u2013465. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_23"},{"key":"12_CR18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-540-85174-5_14","volume-title":"CRYPTO 2008","author":"I Damg\u00e5rd","year":"2008","unstructured":"Damg\u00e5rd, I., Ishai, Y., Kr\u00f8igaard, M., Nielsen, J.B., Smith, A.: Scalable multiparty computation with nearly optimal work and resilience. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 241\u2013261. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_14"},{"key":"12_CR19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-030-26951-7_3","volume-title":"CRYPTO 2019, Part II","author":"I Damg\u00e5rd","year":"2019","unstructured":"Damg\u00e5rd, I., Larsen, K.G., Nielsen, J.B.: Communication lower bounds for statistically secure MPC, with or without preprocessing. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part II. LNCS, vol. 11693, pp. 61\u201384. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_3"},{"key":"12_CR20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-74143-5_32","volume-title":"CRYPTO 2007","author":"I Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Scalable and unconditionally secure multiparty computation. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 572\u2013590. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_32"},{"key":"12_CR21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-030-84245-1_12","volume-title":"CRYPTO 2021, Part II","author":"D Escudero","year":"2021","unstructured":"Escudero, D., Soria-Vazquez, E.: Efficient information-theoretic multi-party computation over non-commutative rings. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part II. LNCS, vol. 12826, pp. 335\u2013364. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_12"},{"key":"12_CR22","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-031-15802-5_14","volume-title":"CRYPTO 2022, Part I","author":"D Escudero","year":"2022","unstructured":"Escudero, D., Xing, C., Yuan, C.: More efficient dishonest majority secure computation over $$\\mathbb{Z} _{2^k}$$ via galois rings. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part I. LNCS, vol. 13507, pp. 383\u2013412. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_14"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Franklin, M.K., Yung, M.: Communication complexity of secure computation (extended abstract). In: 24th Annual ACM Symposium on Theory of Computing, Victoria, BC, Canada, 4\u20136 May 1992, pp. 699\u2013710. ACM Press (1992)","DOI":"10.1145\/129712.129780"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"F\u00fcrer, M.: Faster integer multiplication. In: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, pp. 57\u201366 (2007)","DOI":"10.1145\/1250790.1250800"},{"key":"12_CR25","unstructured":"Garg, S., Goel, A., Jain, A., Policharla, G.-V., Sekar, S.: zkSaaS: zero-knowledge SNARKs as a service. In: 32nd USENIX Security Symposium (USENIX Security 2023), Anaheim, CA, August 2023, pp. 4427\u20134444. USENIX Association (2023)"},{"key":"12_CR26","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-031-38557-5_10","volume-title":"CRYPTO 2023, Part I","author":"S Garg","year":"2023","unstructured":"Garg, S., Jain, A., Mukherjee, P., Sinha, R., Wang, M., Zhang, Y.: Cryptography with weights: MPC, encryption and signatures. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part I. LNCS, vol. 14081, pp. 295\u2013327. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_10"},{"key":"12_CR27","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/978-3-662-48000-7_35","volume-title":"CRYPTO 2015, Part II","author":"D Genkin","year":"2015","unstructured":"Genkin, D., Ishai, Y., Polychroniadou, A.: Efficient multi-party computation: from passive to active security via secure SIMD circuits. In: Gennaro, R., Robshaw, M.J.B. (eds.) CRYPTO 2015, Part II. LNCS, vol. 9216, pp. 721\u2013741. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_35"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher, M. (ed.) 41st Annual ACM Symposium on Theory of Computing, Bethesda, MD, USA, 31 May\u20132 June 2009, pp. 169\u2013178. ACM Press (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"12_CR29","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 Annual ACM Symposium on Theory of Computing, New York City, NY, USA, 25\u201327 May 1987, pp. 218\u2013229. ACM Press (1987)","DOI":"10.1145\/28395.28420"},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Ron, D., Sudan, M.: Chinese remaindering with errors. In: 31st Annual ACM Symposium on Theory of Computing, Atlanta, GA, USA, 1\u20134 May 1999, pp. 225\u2013234. ACM Press (1999)","DOI":"10.1145\/301250.301309"},{"key":"12_CR31","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-030-84245-1_10","volume-title":"CRYPTO 2021, Part II","author":"V Goyal","year":"2021","unstructured":"Goyal, V., Polychroniadou, A., Song, Y.: Unconditional communication-efficient MPC via hall\u2019s marriage theorem. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part II. LNCS, vol. 12826, pp. 275\u2013304. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_10"},{"key":"12_CR32","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-031-15985-5_1","volume-title":"CRYPTO 2022, Part IV","author":"V Goyal","year":"2022","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, Part IV. LNCS, vol. 13510, pp. 3\u201332. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_1"},{"key":"12_CR33","unstructured":"Hamburg, M., Tunstall, M., Xiao, Q.: Improvements to RSA key generation and CRT on embedded devices. Cryptology ePrint Archive, Report 2020\/1507 (2020). https:\/\/eprint.iacr.org\/2020\/1507"},{"issue":"2","key":"12_CR34","doi-asserted-by":"publisher","first-page":"563","DOI":"10.4007\/annals.2021.193.2.4","volume":"193","author":"D Harvey","year":"2021","unstructured":"Harvey, D., Van Der Hoeven, J.: Integer multiplication in time o(nlog$$\\backslash $$, n). Ann. Math. 193(2), 563\u2013617 (2021)","journal-title":"Ann. Math."},{"key":"12_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jco.2016.03.001","volume":"36","author":"D Harvey","year":"2016","unstructured":"Harvey, D., Van Der Hoeven, J., Lecerf, G.: Even faster integer multiplication. J. Complex. 36, 1\u201330 (2016)","journal-title":"J. Complex."},{"key":"12_CR36","unstructured":"Heath, D.: Efficient Arithmetic in Garbled Circuits. Cryptology ePrint Archive, Paper 2024\/139 (2024). https:\/\/eprint.iacr.org\/2024\/139"},{"key":"12_CR37","unstructured":"Iftene, S., Ciobaca, S., Grindei, M.: Compartmented threshold RSA based on the Chinese remainder theorem. Cryptology ePrint Archive, Report 2008\/370 (2008). https:\/\/eprint.iacr.org\/2008\/370"},{"key":"12_CR38","doi-asserted-by":"crossref","unstructured":"Lin, W.-K., Mook, E., Wichs, D.: Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE. Cryptology ePrint Archive, Report 2022\/1703 (2022). https:\/\/eprint.iacr.org\/2022\/1703","DOI":"10.1145\/3564246.3585175"},{"key":"12_CR39","doi-asserted-by":"crossref","unstructured":"Mignotte, M.: How to share a secret? In: Beth, T. (ed.) EUROCRYPT 1982. LNCS, vol. 149, pp. 371\u2013375. Springer, Heidelberg (1982)","DOI":"10.1007\/3-540-39466-4_27"},{"key":"12_CR40","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1007\/978-3-662-49896-5_26","volume-title":"EUROCRYPT 2016, Part II","author":"P Mukherjee","year":"2016","unstructured":"Mukherjee, P., Wichs, D.: Two round multiparty computation via multi-key FHE. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016, Part II. LNCS, vol. 9666, pp. 735\u2013763. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_26"},{"key":"12_CR41","unstructured":"Ozdemir, A., Boneh, D.: Experimenting with collaborative zk-SNARKs: zero-knowledge proofs for distributed secrets. In: Butler, K.R.B., Thomas, K. (eds.) USENIX Security 2022: 31st USENIX Security Symposium, Boston, MA, USA, 10\u201312 August 2022, pp. 4291\u20134308. USENIX Association (2022)"},{"key":"12_CR42","unstructured":"Rudra, A.: (dense structured) matrix vector multiplication (2023)"},{"issue":"3\/4","key":"12_CR43","first-page":"281","volume":"7","author":"V Strassen","year":"1971","unstructured":"Strassen, V., Sch\u00f6nhage, A.: Schnelle multiplikation gro\u00dfer zahlen. Computing 7(3\/4), 281\u2013292 (1971)","journal-title":"Computing"},{"key":"12_CR44","doi-asserted-by":"crossref","unstructured":"von zur Gathen, J., Seroussi, G.: Boolean circuits versus arithmetic circuits. Inf. Comput. 91(1), 142\u2013154 (1991)","DOI":"10.1016\/0890-5401(91)90078-G"},{"key":"12_CR45","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets (extended abstract). In: 27th Annual Symposium on Foundations of Computer Science, Toronto, Ontario, Canada, 27\u201329 October 1986, pp. 162\u2013167. IEEE Computer Society Press (1986)","DOI":"10.1109\/SFCS.1986.25"}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T22:03:09Z","timestamp":1723759389000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68397-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683961","9783031683978"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68397-8_12","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"}}]}}