{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:57:18Z","timestamp":1743073038465,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":56,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819609376"},{"type":"electronic","value":"9789819609383"}],"license":[{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"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-981-96-0938-3_11","type":"book-chapter","created":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T18:23:21Z","timestamp":1733941401000},"page":"328-362","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Concrete Security of\u00a0Two-Party Computation: Simple Definitions, and\u00a0Tight Proofs for\u00a0PSI and\u00a0OPRFs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8765-5573","authenticated-orcid":false,"given":"M.","family":"Bellare","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0007-3776-0096","authenticated-orcid":false,"given":"R.","family":"Ranjan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4990-0929","authenticated-orcid":false,"given":"D.","family":"Riepel","sequence":"additional","affiliation":[]},{"given":"A.","family":"Aldakheel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,12]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Abdalla, M., Bellare, M., Rogaway, P.: The oracle Diffie-Hellman assumptions and an analysis of DHIES. In: Naccache, D. (ed.) CT-RSA\u00a02001. LNCS, vol. 2020, pp. 143\u2013158. Springer, Heidelberg (Apr 2001)","DOI":"10.1007\/3-540-45353-9_12"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Agrawal, S., Prabhakaran, M.: Cryptographic agents: Towards a unified theory of computing on encrypted data. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT\u00a02015, Part\u00a0II. LNCS, vol. 9057, pp. 501\u2013531. Springer, Heidelberg (Apr 2015)","DOI":"10.1007\/978-3-662-46803-6_17"},{"key":"11_CR3","unstructured":"Apple: Password monitoring. https:\/\/support.apple.com\/guide\/security\/password-monitoring-sec78e79fc3b\/web (Feb 2021)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Baldi, P., Baronio, R., De Cristofaro, E., Gasti, P., Tsudik, G.: Countering GATTACA: efficient and secure testing of fully-sequenced human genomes. In: Chen, Y., Danezis, G., Shmatikov, V. (eds.) ACM CCS 2011. pp. 691\u2013702. ACM Press (Oct 2011)","DOI":"10.1145\/2046707.2046785"},{"key":"11_CR5","unstructured":"Bellare, M.: A concrete-security analysis of the apple psi protocol. https:\/\/www.apple.com\/child-safety\/pdf\/Alternative_Security_Proof_of_Apple_PSI_System_Mihir_Bellare.pdf (July 2021)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Bellare, M., Canetti, R., Krawczyk, H.: Pseudorandom functions revisited: The cascade construction and its concrete security. In: 37th FOCS. pp. 514\u2013523. IEEE Computer Society Press (Oct 1996)","DOI":"10.1109\/SFCS.1996.548510"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Bellare, M., Hoang, V.T., Keelveedhi, S., Rogaway, P.: Efficient garbling from a fixed-key blockcipher. In: 2013 IEEE Symposium on Security and Privacy. pp. 478\u2013492. IEEE Computer Society Press (May 2013)","DOI":"10.1109\/SP.2013.39"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Bellare, M., Hoang, V.T., Rogaway, P.: Foundations of garbled circuits. In: Yu, T., Danezis, G., Gligor, V.D. (eds.) ACM CCS 2012. pp. 784\u2013796. ACM Press (Oct 2012)","DOI":"10.1145\/2382196.2382279"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Bellare, M., Kilian, J., Rogaway, P.: The security of cipher block chaining. In: Desmedt, Y. (ed.) CRYPTO\u201994. LNCS, vol. 839, pp. 341\u2013358. Springer, Heidelberg (Aug 1994)","DOI":"10.1007\/3-540-48658-5_32"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Bellare, M., Namprempre, C., Pointcheval, D., Semanko, M.: The one-more-RSA-inversion problems and the security of Chaum\u2019s blind signature scheme. Journal of Cryptology 16(3), 185\u2013215 (Jun 2003)","DOI":"10.1007\/s00145-002-0120-1"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Bellare, M., O\u2019Neill, A.: Semantically-secure functional encryption: Possibility results, impossibility results and the quest for a general definition. In: Abdalla, M., Nita-Rotaru, C., Dahab, R. (eds.) CANS 13. LNCS, vol. 8257, pp. 218\u2013234. Springer, Heidelberg (Nov 2013)","DOI":"10.1007\/978-3-319-02937-5_12"},{"key":"11_CR12","unstructured":"Bellare, M., Ranjan, R., Riepel, D., Aldakheel, A.: The concrete security of two-party computation: Simpler definitions, and tight proofs for psi and oprfs. Cryptology ePrint Archive (2024), full version of this paper"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: Denning, D.E., Pyle, R., Ganesan, R., Sandhu, R.S., Ashby, V. (eds.) ACM CCS 93. pp. 62\u201373. ACM Press (Nov 1993)","DOI":"10.1145\/168588.168596"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: The exact security of digital signatures: How to sign with RSA and Rabin. In: Maurer, U.M. (ed.) EUROCRYPT\u201996. LNCS, vol. 1070, pp. 399\u2013416. Springer, Heidelberg (May 1996)","DOI":"10.1007\/3-540-68339-9_34"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: The security of triple encryption and a framework for code-based game-playing proofs. In: Vaudenay, S. (ed.) EUROCRYPT\u00a02006. LNCS, vol. 4004, pp. 409\u2013426. Springer, Heidelberg (May\u00a0\/\u00a0Jun 2006)","DOI":"10.1007\/11761679_25"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudorandom bits. SIAM Journal on Computing 13(4), 850\u2013864 (1984)","DOI":"10.1137\/0213053"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Boldyreva, A.: Threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme. In: Desmedt, Y. (ed.) PKC\u00a02003. LNCS, vol. 2567, pp. 31\u201346. Springer, Heidelberg (Jan 2003)","DOI":"10.1007\/3-540-36288-6_3"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Boneh, D., Sahai, A., Waters, B.: Functional encryption: Definitions and challenges. In: Ishai, Y. (ed.) TCC\u00a02011. LNCS, vol. 6597, pp. 253\u2013273. Springer, Heidelberg (Mar 2011)","DOI":"10.1007\/978-3-642-19571-6_16"},{"key":"11_CR19","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 (Oct 2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Chase, M., Miao, P.: Private set intersection in the internet setting from lightweight oblivious PRF. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO\u00a02020, Part\u00a0III. LNCS, vol. 12172, pp. 34\u201363. Springer, Heidelberg (Aug 2020)","DOI":"10.1007\/978-3-030-56877-1_2"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Chen, H., Laine, K., Rindal, P.: Fast private set intersection from homomorphic encryption. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017. pp. 1243\u20131255. ACM Press (Oct\u00a0\/\u00a0Nov 2017)","DOI":"10.1145\/3133956.3134061"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Davidson, A., Goldberg, I., Sullivan, N., Tankersley, G., Valsorda, F.: Privacy pass: Bypassing internet challenges anonymously. PoPETs 2018(3), 164\u2013180 (Jul 2018)","DOI":"10.1515\/popets-2018-0026"},{"key":"11_CR23","unstructured":"Everspaugh, A., Chatterjee, R., Scott, S., Juels, A., Ristenpart, T.: The pythia PRF service. In: Jung, J., Holz, T. (eds.) USENIX Security 2015. pp. 547\u2013562. USENIX Association (Aug 2015)"},{"key":"11_CR24","unstructured":"Feige, U., Lapidot, D., Shamir, A.: Multiple non-interactive zero knowledge proofs based on a single random string (extended abstract). In: 31st FOCS. pp. 308\u2013317. IEEE Computer Society Press (Oct 1990)"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Freedman, M.J., Ishai, Y., Pinkas, B., Reingold, O.: Keyword search and oblivious pseudorandom functions. In: Kilian, J. (ed.) TCC\u00a02005. LNCS, vol. 3378, pp. 303\u2013324. Springer, Heidelberg (Feb 2005)","DOI":"10.1007\/978-3-540-30576-7_17"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J. (eds.) EUROCRYPT\u00a02004. LNCS, vol. 3027, pp. 1\u201319. Springer, Heidelberg (May 2004)","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"11_CR27","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Tools, vol.\u00a01. Cambridge University Press, Cambridge, UK (2001)"},{"key":"11_CR28","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Applications, vol.\u00a02. Cambridge University Press, Cambridge, UK (2004)"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. Journal of the ACM 33(4), 792\u2013807 (Oct 1986)","DOI":"10.1145\/6490.6503"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System Sciences 28(2), 270\u2013299 (1984)","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM Journal on Computing 18(1), 186\u2013208 (1989)","DOI":"10.1137\/0218012"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Hazay, C., Lindell, Y.: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. In: Canetti, R. (ed.) TCC\u00a02008. LNCS, vol. 4948, pp. 155\u2013175. Springer, Heidelberg (Mar 2008)","DOI":"10.1007\/978-3-540-78524-8_10"},{"key":"11_CR33","unstructured":"Hunt, T., Hunt, C., Siguroarson, S.: Have I been pwned? https:\/\/haveibeenpwned.com\/"},{"key":"11_CR34","unstructured":"Ion, M., Kreuter, B., Nergiz, A.E., Patel, S., Raykova, M., Saxena, S., Seth, K., Shanahan, D., Yung, M.: On deploying secure computing commercially: Private intersection-sum protocols and their business applications. Cryptology ePrint Archive, Report 2019\/723 (2019), https:\/\/eprint.iacr.org\/2019\/723"},{"key":"11_CR35","unstructured":"Ion, M., Kreuter, B., Nergiz, E., Patel, S., Saxena, S., Seth, K., Shanahan, D., Yung, M.: Private intersection-sum protocol with applications to attributing aggregate ad conversions. Cryptology ePrint Archive, Report 2017\/738 (2017), https:\/\/eprint.iacr.org\/2017\/738"},{"key":"11_CR36","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Kiayias, A., Krawczyk, H.: Round-optimal password-protected secret sharing and T-PAKE in the password-only model. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT\u00a02014, Part\u00a0II. LNCS, vol. 8874, pp. 233\u2013253. Springer, Heidelberg (Dec 2014)","DOI":"10.1007\/978-3-662-45608-8_13"},{"key":"11_CR37","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Krawczyk, H., Xu, J.: OPAQUE: An asymmetric PAKE protocol secure against pre-computation attacks. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT\u00a02018, Part\u00a0III. LNCS, vol. 10822, pp. 456\u2013486. Springer, Heidelberg (Apr\u00a0\/\u00a0May 2018)","DOI":"10.1007\/978-3-319-78372-7_15"},{"key":"11_CR38","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Liu, X.: Efficient oblivious pseudorandom function with applications to adaptive OT and secure computation of set intersection. In: Reingold, O. (ed.) TCC\u00a02009. LNCS, vol. 5444, pp. 577\u2013594. Springer, Heidelberg (Mar 2009)","DOI":"10.1007\/978-3-642-00457-5_34"},{"key":"11_CR39","unstructured":"Juvekar, C., Vaikuntanathan, V., Chandrakasan, A.: GAZELLE: A low latency framework for secure neural network inference. In: Enck, W., Felt, A.P. (eds.) USENIX Security 2018. pp. 1651\u20131669. USENIX Association (Aug 2018)"},{"key":"11_CR40","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Kumaresan, R., Rosulek, M., Trieu, N.: Efficient batched oblivious PRF with applications to private set intersection. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016. pp. 818\u2013829. ACM Press (Oct 2016)","DOI":"10.1145\/2976749.2978381"},{"key":"11_CR41","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Matania, N., Pinkas, B., Rosulek, M., Trieu, N.: Practical multi-party private set intersection from symmetric-key techniques. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017. pp. 1257\u20131272. ACM Press (Oct\u00a0\/\u00a0Nov 2017)","DOI":"10.1145\/3133956.3134065"},{"key":"11_CR42","doi-asserted-by":"crossref","unstructured":"Li, L., Pal, B., Ali, J., Sullivan, N., Chatterjee, R., Ristenpart, T.: Protocols for checking compromised credentials. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019. pp. 1387\u20131403. ACM Press (Nov 2019)","DOI":"10.1145\/3319535.3354229"},{"key":"11_CR43","unstructured":"Lindell, Y.: How to simulate it - A tutorial on the simulation proof technique. Cryptology ePrint Archive, Report 2016\/046 (2016), https:\/\/eprint.iacr.org\/2016\/046"},{"key":"11_CR44","unstructured":"Marlinspike, M.: The difficulty of private contact discovery. https:\/\/signal.org\/blog\/contact-discovery\/ (Jan 2014)"},{"key":"11_CR45","doi-asserted-by":"crossref","unstructured":"Mezzour, G., Perrig, A., Gligor, V.D., Papadimitratos, P.: Privacy-preserving relationship path discovery in social networks. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 09. LNCS, vol. 5888, pp. 189\u2013208. Springer, Heidelberg (Dec 2009)","DOI":"10.1007\/978-3-642-10433-6_13"},{"key":"11_CR46","doi-asserted-by":"crossref","unstructured":"Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. In: 38th FOCS. pp. 458\u2013467. IEEE Computer Society Press (Oct 1997)","DOI":"10.1109\/SFCS.1997.646134"},{"key":"11_CR47","unstructured":"Narayanan, A., Thiagarajan, N., Lakhani, M., Hamburg, M., Boneh, D.: Location privacy via private proximity testing. In: NDSS\u00a02011. The Internet Society (Feb 2011)"},{"key":"11_CR48","doi-asserted-by":"crossref","unstructured":"Okamoto, T., Pointcheval, D.: The gap-problems: A new class of problems for the security of cryptographic schemes. In: Kim, K. (ed.) PKC\u00a02001. LNCS, vol. 1992, pp. 104\u2013118. Springer, Heidelberg (Feb 2001)","DOI":"10.1007\/3-540-44586-2_8"},{"key":"11_CR49","unstructured":"O\u2019Neill, A.: Definitional issues in functional encryption. Cryptology ePrint Archive, Report 2010\/556 (2010), https:\/\/eprint.iacr.org\/2010\/556"},{"key":"11_CR50","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: SpOT-light: Lightweight private set intersection from sparse OT extension. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO\u00a02019, Part\u00a0III. LNCS, vol. 11694, pp. 401\u2013431. Springer, Heidelberg (Aug 2019)","DOI":"10.1007\/978-3-030-26954-8_13"},{"key":"11_CR51","unstructured":"Pinkas, B., Schneider, T., Segev, G., Zohner, M.: Phasing: Private set intersection using permutation-based hashing. In: Jung, J., Holz, T. (eds.) USENIX Security 2015. pp. 515\u2013530. USENIX Association (Aug 2015)"},{"key":"11_CR52","unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. Cryptology ePrint Archive, Report 2005\/187 (2005), https:\/\/eprint.iacr.org\/2005\/187"},{"key":"11_CR53","doi-asserted-by":"crossref","unstructured":"Rajan, A., Qin, L., Archer, D.W., Boneh, D., Lepoint, T., Varia, M.: Callisto: A cryptographic approach to detecting serial perpetrators of sexual misconduct. In: Proceedings of the 1st ACM SIGCAS Conference on Computing and Sustainable Societies. pp. 1\u20134 (2018)","DOI":"10.1145\/3209811.3212699"},{"key":"11_CR54","unstructured":"Thomas, K., Pullman, J., Yeo, K., Raghunathan, A., Kelley, P.G., Invernizzi, L., Benko, B., Pietraszek, T., Patel, S., Boneh, D., Bursztein, E.: Protecting accounts from credential stuffing with password breach alerting. In: Heninger, N., Traynor, P. (eds.) USENIX Security 2019. pp. 1556\u20131571. USENIX Association (Aug 2019)"},{"key":"11_CR55","doi-asserted-by":"crossref","unstructured":"Tyagi, N., Celi, S., Ristenpart, T., Sullivan, N., Tessaro, S., Wood, C.A.: A fast and simple partially oblivious PRF, with applications. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT\u00a02022, Part\u00a0II. LNCS, vol. 13276, pp. 674\u2013705. Springer, Heidelberg (May\u00a0\/\u00a0Jun 2022)","DOI":"10.1007\/978-3-031-07085-3_23"},{"key":"11_CR56","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Protocols for secure computations (extended abstract). In: 23rd FOCS. pp. 160\u2013164. IEEE Computer Society Press (Nov 1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0938-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T19:30:26Z","timestamp":1733945426000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0938-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,12]]},"ISBN":["9789819609376","9789819609383"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0938-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,12]]},"assertion":[{"value":"12 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}