{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T21:00:45Z","timestamp":1790456445839,"version":"4.1.0"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032362636","type":"print"},{"value":"9783032362643","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T00:00:00Z","timestamp":1790467200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T00:00:00Z","timestamp":1790467200000},"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":[[2027]]},"DOI":"10.1007\/978-3-032-36264-3_32","type":"book-chapter","created":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T20:32:58Z","timestamp":1790454778000},"page":"643-661","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Atlantis: Lattice-based Anonymous Tokens with\u00a0Private Metadata Bit"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3296-5336","authenticated-orcid":false,"given":"Foteini","family":"Baldimtsi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-8051-2156","authenticated-orcid":false,"given":"Aayush","family":"Yadav","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,9,27]]},"reference":[{"key":"32_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-030-75248-4_10","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"MR Albrecht","year":"2021","unstructured":"Albrecht, M.R., Davidson, A., Deo, A., Smart, N.P.: Round-optimal verifiable oblivious pseudorandom functions from ideal lattices. In: Garay, J.A. (ed.) PKC 2021. LNCS, vol. 12711, pp. 261\u2013289. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_10"},{"key":"32_CR2","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., G\u00fcr, K.D.: Verifiable oblivious pseudorandom functions from lattices: Practical-ish and thresholdisable. In: Chung, K.-M., Sasaki, Yu. (eds.) ASIACRYPT 2024, Part IV. LNCS, vol. 15487, pp. 205\u2013237. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0894-2_7","DOI":"10.1007\/978-981-96-0894-2_7"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-642-29011-4_29","volume-title":"Advances in Cryptology \u2013 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"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Kirshanova, E., Stehl\u00e9, D., Yadav, A.: Practical, round-optimal lattice-based blind signatures. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022, pp. 39\u201353. ACM Press (2022)","DOI":"10.1145\/3548606.3560650"},{"key":"32_CR5","unstructured":"Apple. iCloud private relay overview (2021). https:\/\/www.apple.com\/icloud\/docs\/iCloud_Private_Relay_Overview_Dec2021.pdf. Accessed: 2024-04-29"},{"key":"32_CR6","unstructured":"Amjad, G., Yeo, K., Yung, M.: RSA blind signatures with public metadata. Cryptology ePrint Archive, Report 2023\/1199 (2023)"},{"key":"32_CR7","unstructured":"Baldimtsi, F., Hanzlik, L., Nguyen, Q., Yadav, A.: Non-interactive anonymous tokens with private metadata bit. Cryptology ePrint Archive, Report 2025\/430 (2025)"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Beullens, W., Lyubashevsky, V., Nguyen, N.K., Seiler, G.: Lattice-based blind signatures: short, efficient, and round-optimal. In: Meng, W., Jensen, C.D., Cremers, C., Kirda, E. (eds.) ACM CCS 2023, pp. 16\u201329. ACM Press (2023)","DOI":"10.1145\/3576915.3616613"},{"key":"32_CR9","unstructured":"Benhamouda, F., Lepoint, T., Orr\u00f9, M., Raykova, M.: Publicly verifiable anonymous tokens with private metadata bit. Cryptology ePrint Archive, Report 2022\/004 (2022)"},{"key":"32_CR10","doi-asserted-by":"publisher","unstructured":"Benhamouda, F., Raykova, M., Seth, K.: Anonymous counting tokens. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023, Part II. LNCS, vol. 14439, pp. 245\u2013278. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8724-5_8","DOI":"10.1007\/978-981-99-8724-5_8"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Chase, M., Bet\u00fcl Durak, F., Vaudenay, S.: Anonymous tokens with stronger metadata bit hiding from algebraic MACs. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part II. LNCS, vol. 14082, pp. 418\u2013449. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-38545-2_14"},{"key":"32_CR12","unstructured":"Chaum, D.: Showing credentials without identification transferring signatures between unconditionally unlinkable pseudonyms. In: Seberry, J., Pieprzyk, J. (eds.) AUSCRYPT 1990. LNCS, vol. 453, pp. 246\u2013264. Springer, Heidelberg (1990)"},{"key":"32_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/3-540-44647-8_23","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"J Camenisch","year":"2001","unstructured":"Camenisch, J., Lysyanskaya, A.: An identity escrow scheme with appointed verifiers. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 388\u2013407. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_23"},{"issue":"3","key":"32_CR14","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1515\/popets-2018-0026","volume":"2018","author":"A Davidson","year":"2018","unstructured":"Davidson, A., Goldberg, I., Sullivan, N., Tankersley, G., Valsorda, F.: Privacy pass: Bypassing internet challenges anonymously. PoPETs 2018(3), 164\u2013180 (2018)","journal-title":"PoPETs"},{"issue":"1","key":"32_CR15","doi-asserted-by":"publisher","first-page":"238","DOI":"10.46586\/tches.v2018.i1.238-268","volume":"2018","author":"L Ducas","year":"2018","unstructured":"Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schwabe, P., Seiler, G., Stehl\u00e9, D.: CRYSTALS-Dilithium: a lattice-based digital signature scheme. IACR TCHES 2018(1), 238\u2013268 (2018)","journal-title":"IACR TCHES"},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Bet\u00fcl Durak, F., Marco, L., Talayhan, A., Vaudenay, S.: Non-transferable anonymous tokens by secret binding. In: Luo, B., Liao, X., Xu, J., Kirda, E., Lie, D. (eds.) ACM CCS 2024, pp. 2460\u20132474. ACM Press (2024)","DOI":"10.1145\/3658644.3670338"},{"issue":"2","key":"32_CR17","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/s00145-018-9281-4","volume":"32","author":"G Fuchsbauer","year":"2019","unstructured":"Fuchsbauer, G., Hanser, C., Slamanig, D.: Structure-preserving signatures on equivalence classes and constant-size anonymous credentials. J. Cryptol. 32(2), 498\u2013546 (2019)","journal-title":"J. Cryptol."},{"key":"32_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/11818175_4","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"M Fischlin","year":"2006","unstructured":"Fischlin, M.: Round-optimal composable blind signatures in the common reference string model. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 60\u201377. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_4"},{"key":"32_CR19","unstructured":"Google. Private state tokens (2024). https:\/\/developers.google.com\/privacy-sandbox\/protections\/private-state-tokens. Accessed 29 Apr 2024"},{"key":"32_CR20","unstructured":"IETF. Privacy pass (privacypass) (2024). https:\/\/datatracker.ietf.org\/wg\/privacypass\/about\/. Accessed 29 Apr 2024"},{"key":"32_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-030-56784-2_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"B Kreuter","year":"2020","unstructured":"Kreuter, B., Lepoint, T., Orr\u00f9, M., Raykova, M.: Anonymous tokens with private metadata bit. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12170, pp. 308\u2013336. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_11"},{"key":"32_CR22","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Nguyen, N.K., Plan\u00e7on, M.: Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part II. LNCS, vol. 13508, pp. 71\u2013101. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_3","DOI":"10.1007\/978-3-031-15979-4_3"},{"key":"32_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-642-11799-2_23","volume-title":"Theory of Cryptography","author":"V Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Palacio, A., Segev, G.: Public-key cryptographic primitives provably as secure as subset sum. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 382\u2013400. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_23"},{"key":"32_CR24","unstructured":"Meunier, T., Rubin, C.D., Faz-Hern\u00e1ndez, A.: Privacy pass: upgrading to the latest protocol version (2024). https:\/\/blog.cloudflare.com\/privacy-pass-standard. Accessed 29 Apr 2024"},{"key":"32_CR25","unstructured":"NIST. Transition to post-quantum cryptography standards (2024). https:\/\/nvlpubs.nist.gov\/nistpubs\/ir\/2024\/NIST.IR.8547.ipd.pdf. Accessed 12 May 2025"},{"key":"32_CR26","doi-asserted-by":"publisher","unstructured":"Orr\u00f9, M., Tessaro, S., Zaverucha, G., Zhu, C.: Oblivious issuance of proofs. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part IX. LNCS, vol. 14928, pp. 254\u2013287. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68400-5_8","DOI":"10.1007\/978-3-031-68400-5_8"},{"key":"32_CR27","unstructured":"Prest, T., et al.: FALCON. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"32_CR28","unstructured":"Policharla, G.-V., Westerbaan, B., Faz-Hern\u00e1ndez, A., Wood, C.A.: Post-quantum privacy pass via post-quantum anonymous credentials. Cryptology ePrint Archive, Report 2023\/414 (2023)"},{"key":"32_CR29","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow, H.N., Fagin, R. (eds.) 37th ACM STOC, pp. 84\u201393. ACM Press (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"32_CR30","doi-asserted-by":"crossref","unstructured":"Silde, T., Strand, M.: Anonymous tokens with public metadata and applications to private contact tracing. In: Eyal, I., Garay, J.A. (eds.) FC 2022. LNCS, vol. 13411, pp. 179\u2013199. Springer, Cham (May2022)","DOI":"10.1007\/978-3-031-18283-9_9"},{"key":"32_CR31","unstructured":"Wilander, J.: Introducing private click measurement, PCM (2021). https:\/\/webkit.org\/blog\/11529\/introducing-private-click-measurement-pcm\/. Accessed 29 Apr 2024"},{"key":"32_CR32","doi-asserted-by":"publisher","unstructured":"Yan, Y., Chow, S.S.M., Ng, L.K.L., Wong, H.W.H., Zhao, Y., Wang, B.: Batch anonymous MAC tokens from lattices. In: Niederhagen, R., Saarinen, M.-J.O. (eds.) PQCrypto 2025, Part I. LNCS, vol. 15577, pp. 349\u2013384. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-86599-2_12","DOI":"10.1007\/978-3-031-86599-2_12"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-36264-3_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T20:33:02Z","timestamp":1790454782000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-36264-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9,27]]},"ISBN":["9783032362636","9783032362643"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-36264-3_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,9,27]]},"assertion":[{"value":"27 September 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SCN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security and Cryptography for Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amalfi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"scn2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/scn.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}