{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:00:28Z","timestamp":1777964428879,"version":"3.51.4"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031911309","type":"print"},{"value":"9783031911316","type":"electronic"}],"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-91131-6_5","type":"book-chapter","created":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T14:29:20Z","timestamp":1745764160000},"page":"126-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Snake-Eye Resistant PKE from\u00a0LWE for\u00a0Oblivious Message Retrieval and\u00a0Robust Encryption"],"prefix":"10.1007","author":[{"given":"Zeyu","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katerina","family":"Sotiraki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eran","family":"Tromer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunhao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,28]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Abdalla, M., et al.: Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions. J. Cryptol. (3) (2008)","DOI":"10.1007\/s00145-007-9006-6"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Abdalla, M., et al.: Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions. J. Cryptol. (3) (2008)","DOI":"10.1007\/s00145-007-9006-6"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-981-99-8733-7_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2023: 29th International Conference on the Theory and Application of Cryptology and Information Security, Guangzhou, China, December 4\u20138, 2023, Proceedings, Part V","author":"C Abou Haidar","year":"2023","unstructured":"Abou Haidar, C., Passel\u00e8gue, A., Stehl\u00e9, D.: Efficient updatable public-key encryption from\u00a0lattices. In: Guo, J., Steinfeld, R. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2023: 29th International Conference on the Theory and Application of Cryptology and Information Security, Guangzhou, China, December 4\u20138, 2023, Proceedings, Part V, pp. 342\u2013373. Springer Nature Singapore, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8733-7_11"},{"issue":"3","key":"5_CR4","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1515\/jmc-2015-0016","volume":"9","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of Learning with Errors. J. Math. Cryptol. 9(3), 169\u2013203 (2015). https:\/\/doi.org\/10.1515\/jmc-2015-0016","journal-title":"J. Math. Cryptol."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Alperin-Sheriff, J., Peikert, C.: Circular and KDM security for identity-based encryption. In: PKC\u00a02012. LNCS, Springer, Heidelberg, Germany (May\u00a021\u201323, 2012)","DOI":"10.1007\/978-3-642-30057-8_20"},{"key":"5_CR6","unstructured":"Badawi, A.A., et al.: OpenFHE: open-source fully homomorphic encryption library. Cryptology ePrint Archive, Paper 2022\/915 (2022). https:\/\/ia.cr\/.org\/2022\/915"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Beck, G., Len, J., Miers, I., Green, M.: Fuzzy message detection. ACM CCS (2021)","DOI":"10.1145\/3460120.3484545"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Ben\u00a0Sasson, E., et al.: Zerocash: Decentralized anonymous payments from bitcoin. In: 2014 IEEE S & P, pp. 459\u2013474 (2014)","DOI":"10.1109\/SP.2014.36"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Bethencourt, J., Song, D.X., Waters, B.: New techniques for private stream searching. ACM Trans. Inf. Syst. Secur. 12, 16:1\u201316:32 (2009)","DOI":"10.1145\/1455526.1455529"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Bittau, A., et al.: Prochlo: strong privacy for analytics in the crowd. In: SOSP (2017)","DOI":"10.1145\/3132747.3132769"},{"key":"5_CR11","unstructured":"Bi\u00e7er, O., Tschudin, C.: Oblivious homomorphic encryption. Cryptology ePrint Archive, Paper 2023\/1699 (2023). https:\/\/ia.cr\/.org\/2023\/1699"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Boemer, F., Kim, S., Seifu, G., de\u00a0Souza, F.D., Gopal, V., et\u00a0al.: Intel HEXL (release 1.2.5). https:\/\/github.com\/intel\/hexl (2022)","DOI":"10.1145\/3474366.3486926"},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Bos, J., et al.: CRYSTALS - Kyber: a CCA-secure module-lattice-based KEM. In: 2018 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 353\u2013367 (2018). https:\/\/doi.org\/10.1109\/EuroSP.2018.00032","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Bowe, S., Chiesa, A., Green, M., Miers, I., Mishra, P., Wu, H.: ZEXE: enabling decentralized private computation. In: 2020 IEEE S &P (SP), pp. 947\u2013964 (2020)","DOI":"10.1109\/SP40000.2020.00050"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/978-3-642-32009-5_50","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"Z Brakerski","year":"2012","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 868\u2013886. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-030-45724-2_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"Z Brakerski","year":"2020","unstructured":"Brakerski, Z., D\u00f6ttling, N.: Hardness of LWE on general entropic distributions. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 551\u2013575. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_19"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Langlois, A., Peikert, C., Regev, O., Stehl\u00e9, D.: Classical hardness of learning with errors. In: 45th ACM STOC (2013)","DOI":"10.1145\/2488608.2488680"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/978-3-030-90567-5_33","volume-title":"Information Security and Privacy","author":"JH Cheon","year":"2021","unstructured":"Cheon, J.H., Kim, D., Kim, D., Lee, J., Shin, J., Song, Y.: Lattice-based secure biometric authentication for hamming distance. In: Baek, J., Ruj, S. (eds.) ACISP 2021. LNCS, vol. 13083, pp. 653\u2013672. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90567-5_33"},{"key":"5_CR19","unstructured":"Chor, B., Gilboa, N., Naor, M.: Private information retrieval by keywords (1998). http:\/\/eprint.iacr.org\/1998\/003"},{"key":"5_CR20","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: 36th FOCS. IEEE Computer Society Press (1995)"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Corrigan-Gibbs, H., Boneh, D., Mazi\u00e8res, D.: Riposte: an anonymous messaging system handling millions of users. In: 2015 IEEE S &P, pp. 321\u2013338 (2015)","DOI":"10.1109\/SP.2015.27"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-540-77366-5_15","volume-title":"Financial Cryptography and Data Security: 11th International Conference, FC 2007, and 1st International Workshop on Usable Security, USEC 2007, Scarborough, Trinidad and Tobago, February 12-16, 2007. Revised Selected Papers","author":"G Danezis","year":"2007","unstructured":"Danezis, G., Diaz, C.: Space-efficient private search with applications to rateless codes. In: Dietrich, S., Dhamija, R. (eds.) Financial Cryptography and Data Security: 11th International Conference, FC 2007, and 1st International Workshop on Usable Security, USEC 2007, Scarborough, Trinidad and Tobago, February 12-16, 2007. Revised Selected Papers, pp. 148\u2013162. Springer, Berlin, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77366-5_15"},{"key":"5_CR23","unstructured":"Dodis, Y., Jost, D.: Perpetual encryption, preliminary version obtained via communication with the authors (2023)"},{"key":"5_CR24","unstructured":"DoS-PerfOMR implementation (2024). https:\/\/github.com\/ObliviousMessageRetrieval\/ObliviousMessageRetrieval\/tree\/dos_perfomr"},{"key":"5_CR25","unstructured":"Electric Coin Company: Zcash Rust crates. https:\/\/github.com\/zcash\/librustzcash, commit hash: 99d877e22d58610dc43021b831a28286ef353a89"},{"key":"5_CR26","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Report 2012\/144 (2012). https:\/\/ia.cr\/2012\/144"},{"key":"5_CR27","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-642-35999-6_24","volume-title":"Selected Areas in Cryptography: 19th International Conference, SAC 2012, Windsor, ON, Canada, August 15-16, 2012, Revised Selected Papers","author":"M Finiasz","year":"2013","unstructured":"Finiasz, M., Ramchandran, K.: Private stream search at almost the same communication cost as a regular search. In: Knudsen, L.R., Wu, H. (eds.) Selected Areas in Cryptography: 19th International Conference, SAC 2012, Windsor, ON, Canada, August 15-16, 2012, Revised Selected Papers, pp. 372\u2013389. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35999-6_24"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Fisch, B., Lazzaretti, A., Liu, Z., Papamanthou, C.: ThorPIR: single server PIR via homomorphic thorp shuffles. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, pp. 1448\u20131462. CCS \u201924, Association for Computing Machinery, New York, NY, USA (2024)","DOI":"10.1145\/3658644.3690326"},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-40041-4_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"C Gentry","year":"2013","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 75\u201392. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5"},{"key":"5_CR30","unstructured":"Goldwasser, S., Kalai, Y.T., Peikert, C., Vaikuntanathan, V.: Robustness of the learning with errors assumption. In: ICS 2010. Tsinghua University Press (2010)"},{"key":"5_CR31","doi-asserted-by":"publisher","unstructured":"Grubbs, P., Maram, V., Paterson, K.G.: Anonymous, robust post-quantum public key encryption. In: Dunkelman, O., Dziembowski, S. (eds) Advances in Cryptology \u2013 EUROCRYPT\u00a02022, Part\u00a0III. LNCS, Springer, Heidelberg, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_15","DOI":"10.1007\/978-3-031-07082-2_15"},{"key":"5_CR32","unstructured":"Jakkamsetti, S., Liu, Z., Madathil, V.: Scalable private signaling. Cryptology ePrint Archive, Paper 2023\/572 (2023). https:\/\/ia.cr\/.org\/2023\/572"},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Jia, Y., Madathil, V., Kate, A.: Homerun: high-efficiency oblivious message retrieval, unrestricted. Cryptology ePrint Archive, Paper 2024\/188 (2024). https:\/\/ia.cr\/.org\/2024\/188","DOI":"10.1145\/3658644.3670381"},{"key":"5_CR34","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-3-031-38554-4_18","volume-title":"Advances in Cryptology - CRYPTO 2023","author":"D Kim","year":"2023","unstructured":"Kim, D., Lee, D., Seo, J., Song, Y.: Toward practical lattice-based proof of knowledge from Hint-MLWE. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology - CRYPTO 2023, pp. 549\u2013580. Springer Nature Switzerland, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_18"},{"key":"5_CR35","unstructured":"Lee, J., Kim, D., Kim, D., Song, Y., Shin, J., Cheon, J.H.: Instant privacy-preserving biometric authentication for hamming distance. IACR Cryptol. ePrint Arch. 2018, 1214 (2018). https:\/\/api.semanticscholar.org\/CorpusID:57760611"},{"key":"5_CR36","unstructured":"Liu, Z., Sotiraki, K., Tromer, E., Wang, Y.: Snake-eye resistant PKE from LWE for oblivious message retrieval and robust encryption. Cryptology ePrint Archive, Paper 2024\/510 (2024). https:\/\/eprint.iacr.org\/2024\/510, full version of this paper. Version 2025\/02\/07"},{"key":"5_CR37","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1007\/978-3-031-15802-5_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2022: 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15\u201318, 2022, Proceedings, Part I","author":"Z Liu","year":"2022","unstructured":"Liu, Z., Tromer, E.: Oblivious message retrieval. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2022: 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15\u201318, 2022, Proceedings, Part I, pp. 753\u2013783. Springer Nature Switzerland, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_26"},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"Liu, Z., Tromer, E., Wang, Y.: Group oblivious message retrieval. S &P 2024 (2024)","DOI":"10.1109\/SP54263.2024.00115"},{"key":"5_CR39","doi-asserted-by":"crossref","unstructured":"Liu, Z., Tromer, E., Wang, Y.: PerfOMR: oblivious message retrieval with reduced communication and computation. Usenix Security (2024)","DOI":"10.1109\/SP54263.2024.00115"},{"key":"5_CR40","unstructured":"Lund, J.: Technology preview: sealed sender for signal. https:\/\/signal.org\/blog\/sealed-sender\/ (2018)"},{"key":"5_CR41","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":"5_CR42","unstructured":"Madathil, V., Scafuro, A., Seres, I.A., Shlomovits, O., Varlakov, D.: Private signaling. USENIX Security 2022 (2022)"},{"key":"5_CR43","unstructured":"Maram, V., Xagawa, K.: Post-quantum anonymity of kyber. Cryptology ePrint Archive, Report 2022\/1696 (2022). https:\/\/eprint.iacr.org\/2022\/1696"},{"key":"5_CR44","unstructured":"Microsoft SEAL. Microsoft Research, Redmond, WA (2020). https:\/\/github.com\/Microsoft\/SEAL"},{"key":"5_CR45","first-page":"1098","volume":"2015","author":"S Noether","year":"2015","unstructured":"Noether, S.: Ring signature confidential transactions for Monero. IACR Cryptol. ePrint Arch. 2015, 1098 (2015)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"5_CR46","unstructured":"Oblivious message retrieval implementation. https:\/\/github.com\/ZeyuThomasLiu\/ObliviousMessageRetrieval (2021)"},{"key":"5_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-642-22792-9_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"A O\u2019Neill","year":"2011","unstructured":"O\u2019Neill, A., Peikert, C., Waters, B.: Bi-deniable public-key encryption. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 525\u2013542. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_30"},{"key":"5_CR48","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Skeith, W.E.: Private searching on streaming data. In: CRYPTO (2005)","DOI":"10.1007\/11535218_14"},{"key":"5_CR49","unstructured":"PALISADE lattice cryptography library (release 11.2) (2021). https:\/\/palisade-crypto.org\/"},{"key":"5_CR50","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: CRYPTO\u00a02008 (2008)"},{"key":"5_CR51","doi-asserted-by":"crossref","unstructured":"Pu, S., Thyagarajan, S.A., D\u00f6ttling, N., Hanzlik, L.: Post quantum fuzzy stealth signatures and applications. CCS (2023). https:\/\/ia.cr\/.org\/2023\/1148","DOI":"10.1145\/3576915.3623148"},{"key":"5_CR52","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM (2009)","DOI":"10.1145\/1568318.1568324"},{"key":"5_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-540-46588-1_28","volume-title":"Public Key Cryptography","author":"K Sako","year":"2000","unstructured":"Sako, K.: An auction protocol which hides bids of losers. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1751, pp. 422\u2013432. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-540-46588-1_28"},{"key":"5_CR54","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-031-18283-9_7","volume-title":"Financial Cryptography and Data Security: 26th International Conference, FC 2022, Grenada, May 2\u20136, 2022, Revised Selected Papers","author":"IA Seres","year":"2022","unstructured":"Seres, I.A., Pej\u00f3, B., Burcsi, P.: The effect of\u00a0false positives: why fuzzy message detection leads to\u00a0fuzzy privacy guarantees? In: Eyal, I., Garay, J. (eds.) Financial Cryptography and Data Security: 26th International Conference, FC 2022, Grenada, May 2\u20136, 2022, Revised Selected Papers, pp. 123\u2013148. Springer International Publishing, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-18283-9_7"},{"issue":"3","key":"5_CR55","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s41635-018-0046-1","volume":"3","author":"J Szefer","year":"2019","unstructured":"Szefer, J.: Survey of microarchitectural side and covert channels, attacks, and defenses. J. Hardware Syst. Secur. 3(3), 219\u2013234 (2019). https:\/\/doi.org\/10.1007\/s41635-018-0046-1","journal-title":"J. Hardware Syst. Secur."},{"key":"5_CR56","unstructured":"Wang, R., et al.: Circuit bootstrapping: faster and smaller. Cryptology ePrint Archive, Paper 2024\/323 (2024), eurocrypt 2024"},{"key":"5_CR57","unstructured":"Wolinsky, D.I., Corrigan-Gibbs, H., Ford, B., Johnson, A.: Dissent in numbers: making strong anonymity scale. In: OSDI 12, pp. 179\u2013182. USENIX (2012)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91131-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T14:29:48Z","timestamp":1745764188000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91131-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031911309","9783031911316"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91131-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"28 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"4 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","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":"eurocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}