{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:26:17Z","timestamp":1765106777933,"version":"3.46.0"},"publisher-location":"Singapore","reference-count":52,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819550951","type":"print"},{"value":"9789819550968","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-5096-8_2","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:24:24Z","timestamp":1765106664000},"page":"34-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Policy Compliant Secure Messaging"],"prefix":"10.1007","author":[{"given":"Jo\u00ebl","family":"Alwen","sequence":"first","affiliation":[]},{"given":"Xiaohui","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Sanjam","family":"Garg","sequence":"additional","affiliation":[]},{"given":"Yiannis","family":"Tselekounis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"2_CR1","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-642-55220-5_22","volume-title":"EUROCRYPT 2014","author":"A Afshar","year":"2014","unstructured":"Afshar, A., Mohassel, P., Pinkas, B., Riva, B.: Non-interactive secure computation based on cut-and-choose. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 387\u2013404. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_22"},{"key":"2_CR2","unstructured":"Alliance, W.G.: Global threat assessment 2019: working together to end the sexual exploitation of children online (2019)"},{"key":"2_CR3","series-title":"Part I, volume 11476 of LNCS","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-030-17653-2_5","volume-title":"EUROCRYPT 2019","author":"J Alwen","year":"2019","unstructured":"Alwen, J., Coretti, S., Dodis, Y.: The double ratchet: security notions, proofs, and modularization for the signal protocol. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. Part I, volume 11476 of LNCS, pp. 129\u2013158. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_5"},{"key":"2_CR4","series-title":"Part I, volume 12170 of LNCS","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-030-56784-2_9","volume-title":"CRYPTO 2020","author":"J Alwen","year":"2020","unstructured":"Alwen, J., Coretti, S., Dodis, Y., Tselekounis, Y.: Security analysis and improvements for the IETF MLS standard for group messaging. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. Part I, volume 12170 of LNCS, pp. 248\u2013277. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_9"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Alwen, J., Coretti, S., Dodis, Y., Tselekounis, Y.: Modular design of secure group messaging protocols and the security of MLS. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 1463\u20131483. ACM Press (2021)","DOI":"10.1145\/3460120.3484820"},{"key":"2_CR6","series-title":"Part II, volume 12551 of LNCS","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-030-64378-2_10","volume-title":"TCC 2020","author":"J Alwen","year":"2020","unstructured":"Alwen, J., Coretti, S., Jost, D., Mularczyk, M.: Continuous group key agreement with active security. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. Part II, volume 12551 of LNCS, pp. 261\u2013290. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_10"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Alwen, J., Hartmann, D., Kiltz, E., Mularczyk, M.: Server-aided continuous group key agreement. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022, pp. 69\u201382. ACM Press (2022)","DOI":"10.1145\/3548606.3560632"},{"key":"2_CR8","series-title":"Part II, volume 13508 of LNCS","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-031-15979-4_2","volume-title":"CRYPTO 2022","author":"J Alwen","year":"2022","unstructured":"Alwen, J., Jost, D., Mularczyk, M.: On the insider security of MLS. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. Part II, volume 13508 of LNCS, pp. 34\u201368. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_2"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/978-3-031-38551-3_13","volume-title":"Advances in Cryptology - CRYPTO 2023","author":"J Alwen","year":"2023","unstructured":"Alwen, J., Mularczyk, M., Tselekounis, Y.: Fork-resilient continuous group key agreement. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology - CRYPTO 2023, pp. 396\u2013429. Springer Nature Switzerland, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_13"},{"key":"2_CR10","series-title":"Part III, volume 10626 of LNCS","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-319-70700-6_10","volume-title":"ASIACRYPT 2017","author":"S Badrinarayanan","year":"2017","unstructured":"Badrinarayanan, S., Garg, S., Ishai, Y., Sahai, A., Wadia, A.: Two-message witness indistinguishability and secure computation in the plain model from new assumptions. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. Part III, volume 10626 of LNCS, pp. 275\u2013303. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_10"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Banfi, F., Gegier, K., Hirt, M., Maurer, U.: Anamorphic encryption, revisited. Cryptology ePrint Archive (2023)","DOI":"10.1007\/978-3-031-58723-8_1"},{"issue":"2","key":"2_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2160158.2160159","volume":"59","author":"B Barak","year":"2012","unstructured":"Barak, B., et al.: On the (Im)possibility of obfuscating programs. J. ACM (JACM) 59(2), 1\u201348 (2012)","journal-title":"J. ACM (JACM)"},{"key":"2_CR13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44647-8_1","volume-title":"CRYPTO 2001","author":"B Barak","year":"2001","unstructured":"Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S.P., Yang, K.: On the (Im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 1\u201318. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_1"},{"key":"2_CR14","series-title":"Part V, volume 14008 of LNCS","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-031-30589-4_2","volume-title":"EUROCRYPT 2023","author":"J Bartusek","year":"2023","unstructured":"Bartusek, J., Garg, S., Jain, A., Policharla, G.-V.: End-to-end secure messaging with traceability only for illegal content. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. Part V, volume 14008 of LNCS, pp. 35\u201366. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_2"},{"key":"2_CR15","unstructured":"Bhowmick, A., Boneh, D., Myers, S., Talwar, K., Tarbe, K.: The apple PSI system. Apple Inc, Tech. Rep (2021)"},{"key":"2_CR16","series-title":"Part I, volume 13507 of LNCS","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1007\/978-3-031-15802-5_27","volume-title":"CRYPTO 2022","author":"A Bienstock","year":"2022","unstructured":"Bienstock, A., Fairoze, J., Garg, S., Mukherjee, P., Raghuraman, S.: A more complete analysis of the Signal double ratchet algorithm. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. Part I, volume 13507 of LNCS, pp. 784\u2013813. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_27"},{"key":"2_CR17","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 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"2_CR18","series-title":"Part II, volume 13508 of LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-031-15979-4_1","volume-title":"CRYPTO 2022","author":"R Canetti","year":"2022","unstructured":"Canetti, R., Jain, P., Swanberg, M., Varia, M.: Universally composable end-to-end secure messaging. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. Part II, volume 13508 of LNCS, pp. 3\u201333. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_1"},{"issue":"4","key":"2_CR19","doi-asserted-by":"publisher","first-page":"1914","DOI":"10.1007\/s00145-020-09360-1","volume":"33","author":"K Cohn-Gordon","year":"2020","unstructured":"Cohn-Gordon, K., Cremers, C., Dowling, B., Garratt, L., Stebila, D.: A formal security analysis of the signal messaging protocol. J. Cryptol. 33(4), 1914\u20131983 (2020)","journal-title":"J. Cryptol."},{"key":"2_CR20","unstructured":"Comey, J.: Going dark: are technology, privacy, and public safety on a collision course? US Department of Justice (2014)"},{"key":"2_CR21","unstructured":"European Commission. Child sexual abuse (2022)"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"David, B., Engelmann, F., Frederiksen, T., Kohlweiss, M., Pagnin, E., Volkhov, M.: Updatable privacy-preserving blueprints. Cryptology ePrint Archive (2023)","DOI":"10.1007\/978-981-96-0875-1_4"},{"key":"2_CR23","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-14577-3_13","volume-title":"FC 2010","author":"E De Cristofaro","year":"2010","unstructured":"De Cristofaro, E., Tsudik, G.: Practical private set intersection protocols with linear complexity. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, pp. 143\u2013159. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14577-3_13"},{"key":"2_CR24","series-title":"Part I, volume 10991 of LNCS","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-319-96884-1_6","volume-title":"CRYPTO 2018","author":"Y Dodis","year":"2018","unstructured":"Dodis, Y., Grubbs, P., Ristenpart, T., Woodage, J.: Fast message franking: from invisible salamanders to encryptment. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. Part I, volume 10991 of LNCS, pp. 155\u2013186. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_6"},{"key":"2_CR25","doi-asserted-by":"publisher","unstructured":"Dodis, Y., Magri, B., Stephens-Davidowitz, N., Tselekounis, Y.: Guarding the signal: secure messaging with reverse firewalls. In: Annual International Cryptology Conference, pp. 39\u201374. Springer (2025). https:\/\/doi.org\/10.1007\/978-3-032-01913-4_2","DOI":"10.1007\/978-3-032-01913-4_2"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Emura, K., et\u00a0al.: Group signatures with message-dependent opening: formal definitions and constructions. Secur. Commun. Networks (2019)","DOI":"10.1155\/2019\/4872403"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Fetzer, V., Kloo\u00df, M., M\u00fcller-Quade, J., Raiber, M., Rupp, A.: Universally composable auditable surveillance. Cryptology ePrint Archive (2023)","DOI":"10.1007\/978-981-99-8724-5_14"},{"key":"2_CR28","unstructured":"Green, M.: Thinking about \u201ctraceability\u201d (2021)"},{"key":"2_CR29","series-title":"Part III, volume 12698 of LNCS","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-030-77883-5_19","volume-title":"EUROCRYPT 2021","author":"M Green","year":"2021","unstructured":"Green, M., Kaptchuk, G., Laer, G.V.: Abuse resistant law enforcement access systems. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. Part III, volume 12698 of LNCS, pp. 553\u2013583. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_19"},{"key":"2_CR30","series-title":"Part III, volume 10403 of LNCS","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-319-63697-9_3","volume-title":"CRYPTO 2017","author":"P Grubbs","year":"2017","unstructured":"Grubbs, P., Lu, J., Ristenpart, T.: Message franking via committing authenticated encryption. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. Part III, volume 10403 of LNCS, pp. 66\u201397. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_3"},{"key":"2_CR31","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-3-642-20465-4_23","volume-title":"EUROCRYPT 2011","author":"Y Ishai","year":"2011","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Prabhakaran, M., Sahai, A.: Efficient non-interactive secure computation. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 406\u2013425. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_23"},{"key":"2_CR32","unstructured":"Issa, R., Alhaddad, N., Varia, M.: Hecate: abuse reporting in secure messengers with sealed sender. In: Butler, K.R.B., Thomas, K. (eds.) USENIX Security 2022, pp. 2335\u20132352. USENIX Association (2022)"},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"Kobeissi, N., Bhargavan, K., Blanchet, B.: Automated verification for secure messaging protocols and their implementations: a symbolic and computational approach. In 2017 IEEE European symposium on security and privacy (EuroS &P), pp. 435\u2013450. IEEE (2017)","DOI":"10.1109\/EuroSP.2017.38"},{"key":"2_CR34","series-title":"Part II, volume 14005 of LNCS","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1007\/978-3-031-30617-4_20","volume-title":"EUROCRYPT 2023","author":"M Kohlweiss","year":"2023","unstructured":"Kohlweiss, M., Lysyanskaya, A., Nguyen, A.: Privacy-preserving blueprints. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. Part II, volume 14005 of LNCS, pp. 594\u2013625. Springer, Heidelberg (2023)"},{"key":"2_CR35","unstructured":"Kulshrestha, A., Mayer, J.R.: Identifying harmful media in end-to-end encrypted communication: efficient private membership computation. In: Bailey, M., Greenstadt, R. (eds.) USENIX Security 2021, pp. 893\u2013910. USENIX Association (2021)"},{"key":"2_CR36","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-642-36334-4_18","volume-title":"CT-RSA 2014","author":"B Libert","year":"2014","unstructured":"Libert, B., Joye, M.: Group signatures with message-dependent opening in the standard model. In: Benaloh, J. (ed.) CT-RSA 2014. LNCS, vol. 8366, pp. 286\u2013306. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-36334-4_18"},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Liu, L., Roche, D.S., Theriault, A., Yerukhimovich, A.: Fighting fake news in encrypted messaging with the fuzzy anonymous complaint tally system (FACTS). Cryptology ePrint Archive, Report 2021\/1148 (2021). https:\/\/eprint.iacr.org\/2021\/1148","DOI":"10.14722\/ndss.2022.23109"},{"key":"2_CR38","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-540-24676-3_2","volume-title":"EUROCRYPT 2004","author":"B Lynn","year":"2004","unstructured":"Lynn, B., Prabhakaran, M., Sahai, A.: Positive results and techniques for obfuscation. In: Cachin, C., Camenisch, J. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 20\u201339. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_2"},{"key":"2_CR39","unstructured":"Ministerial, F.C.: Joint meeting of FCM and quintet of attorneys-general. Government of the United Kingdom, London (2019)"},{"key":"2_CR40","doi-asserted-by":"crossref","unstructured":"Namavari, A., et al.: Private hierarchical governance for encrypted messaging. In 2024 IEEE Symposium on Security and Privacy (SP), pp. 2610\u20132629. IEEE (2024)","DOI":"10.1109\/SP54263.2024.00235"},{"key":"2_CR41","unstructured":"Council of the European\u00a0Union. Council conclusions on combating the sexual abuse of children (2019)"},{"key":"2_CR42","unstructured":"Parliament\u00a0of\u00a0the United\u00a0Kingdom. Online safety bill (2021)"},{"key":"2_CR43","unstructured":"Office\u00a0of\u00a0the United Nations High Commissioner\u00a0for Human\u00a0Rights. The right to privacy in the digital age (2022)"},{"key":"2_CR44","unstructured":"Patel, P., Barr, W., Dutton, P., Little, A., Blair, B.: International statement: end-to-end encryption and public safety (2021)"},{"key":"2_CR45","doi-asserted-by":"crossref","unstructured":"Peale, C., Eskandarian, S., Boneh, D.: Secure complaint-enabled source-tracking for encrypted messaging. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 1484\u20131506. ACM Press (2021)","DOI":"10.1145\/3460120.3484539"},{"key":"2_CR46","doi-asserted-by":"crossref","unstructured":"Persiano, G., Phan, D.H., Yung, M.: Anamorphic encryption: private communication against a dictator. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 34\u201363. Springer (2022)","DOI":"10.1007\/978-3-031-07085-3_2"},{"key":"2_CR47","doi-asserted-by":"crossref","unstructured":"Scheffler, S., Kulshrestha, A., Mayer, J.: Public verification for private hash matching. Cryptology ePrint Archive (2023)","DOI":"10.1109\/SP46215.2023.10179349"},{"key":"2_CR48","doi-asserted-by":"publisher","first-page":"403","DOI":"10.56553\/popets-2023-0060","volume":"2","author":"S Scheffler","year":"2023","unstructured":"Scheffler, S., Mayer, J.: SoK: content moderation for end-to-end encryption. Proc. Priv. Enhancing Technol. 2, 403\u2013429 (2023)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"2_CR49","unstructured":"Open\u00a0Whisper Systems (OWS). The signal application (2023). https:\/\/github.com\/signalapp"},{"key":"2_CR50","series-title":"Part III, volume 11694 of LNCS","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-030-26954-8_8","volume-title":"CRYPTO 2019","author":"N Tyagi","year":"2019","unstructured":"Tyagi, N., Grubbs, P., Len, J., Miers, I., Ristenpart, T.: Asymmetric message franking: content moderation for metadata-private end-to-end encryption. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. Part III, volume 11694 of LNCS, pp. 222\u2013250. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_8"},{"key":"2_CR51","doi-asserted-by":"crossref","unstructured":"Tyagi, N., Miers, I., Ristenpart, T.: Traceback for end-to-end encrypted messaging. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019, pp. 413\u2013430. ACM Press (2019)","DOI":"10.1145\/3319535.3354243"},{"key":"2_CR52","unstructured":"Watt, N., Mason, R., Traynor, I.: David Cameron pledges anti-terror law for internet after Paris attacks. The Guardian, 12 (2015)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5096-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:24:28Z","timestamp":1765106668000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5096-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819550951","9789819550968"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5096-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,8]]},"assertion":[{"value":"8 December 2025","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":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}