{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T19:40:21Z","timestamp":1742845221486,"version":"3.40.2"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031865985","type":"print"},{"value":"9783031865992","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-86599-2_10","type":"book-chapter","created":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T19:18:30Z","timestamp":1742843910000},"page":"278-311","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lattice-Based Sanitizable Signature Schemes: Chameleon Hash Functions and\u00a0More"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Clermont","sequence":"first","affiliation":[]},{"given":"Samed","family":"D\u00fczl\u00fc","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Janson","sequence":"additional","affiliation":[]},{"given":"Laurens","family":"Porzenheim","sequence":"additional","affiliation":[]},{"given":"Patrick","family":"Struck","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,15]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: 28th ACM STOC, pp. 99\u2013108. ACM Press, May 1996. https:\/\/doi.org\/10.1145\/237814.237838","DOI":"10.1145\/237814.237838"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/11555827_10","volume-title":"Computer Security \u2013 ESORICS 2005","author":"G Ateniese","year":"2005","unstructured":"Ateniese, G., Chou, D.H., de Medeiros, B., Tsudik, G.: Sanitizable signatures. In: di Vimercati, S.C., Syverson, P., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol. 3679, pp. 159\u2013177. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11555827_10"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/978-3-642-29011-4_42","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Banerjee","year":"2012","unstructured":"Banerjee, A., Peikert, C., Rosen, A.: Pseudorandom functions and lattices. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 719\u2013737. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_42"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-319-98113-0_20","volume-title":"Security and Cryptography for Networks","author":"C Baum","year":"2018","unstructured":"Baum, C., Damg\u00e5rd, I., Lyubashevsky, V., Oechsner, S., Peikert, C.: More efficient commitments from structured lattice assumptions. In: Catalano, D., De Prisco, R. (eds.) SCN 2018. LNCS, vol. 11035, pp. 368\u2013385. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_20"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-319-60055-0_23","volume-title":"Information Security and Privacy","author":"MT Beck","year":"2017","unstructured":"Beck, M.T., et al.: Practical strongly invisible and strongly accountable sanitizable signatures. In: Pieprzyk, J., Suriadi, S. (eds.) ACISP 2017. LNCS, vol. 10342, pp. 437\u2013452. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-60055-0_23"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Bernhard, D., Fuchsbauer, G., Ghadafi, E., Smart, N.P., Warinschi, B.: Anonymous attestation with user-controlled linkability. Int. J. Inf. Sec. 12(3), 219\u2013249 (2013). https:\/\/doi.org\/10.1007\/S10207-013-0191-Z","DOI":"10.1007\/S10207-013-0191-Z"},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"Bl\u00f6mer, J., Bobolz, J., Porzenheim, L.: A generic construction of an anonymous reputation system and instantiations from lattices. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023. LNCS, vol. 14439, pp. 418\u2013452. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8724-5_13","DOI":"10.1007\/978-981-99-8724-5_13"},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Bootle, J., Lyubashevsky, V., Nguyen, N.K., Sorniotti, A.: A framework for practical anonymous credentials from lattices. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023. LNCS, vol. 14439, pp. 384\u2013417. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_13","DOI":"10.1007\/978-3-031-38545-2_13"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-642-00468-1_18","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"C Brzuska","year":"2009","unstructured":"Brzuska, C., et al.: Security of sanitizable signatures revisited. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 317\u2013336. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00468-1_18"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/978-3-642-13013-7_26","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"C Brzuska","year":"2010","unstructured":"Brzuska, C., Fischlin, M., Lehmann, A., Schr\u00f6der, D.: Unlinkability of sanitizable signatures. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 444\u2013461. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13013-7_26"},{"key":"10_CR11","unstructured":"Brzuska, C., Fischlin, M., Lehmann, A., Schr\u00f6der, D.: Sanitizable signatures: how to partially delegate control for authenticated data. In: BIOSIG 2009. Gesellschaft f\u00fcr Informatik e.V., Bonn, pp. 117\u2013128 (2009). ISBN 978-3-88579-249-1"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-40012-4_12","volume-title":"Public Key Infrastructures, Services and Applications","author":"C Brzuska","year":"2013","unstructured":"Brzuska, C., P\u00f6hls, H.C., Samelin, K.: Non-interactive public accountability for sanitizable signatures. In: De Capitani di Vimercati, S., Mitchell, C. (eds.) EuroPKI 2012. LNCS, vol. 7868, pp. 178\u2013193. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40012-4_12"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-030-17253-4_6","volume-title":"Public-Key Cryptography \u2013 PKC 2019","author":"X Bultel","year":"2019","unstructured":"Bultel, X., Lafourcade, P., Lai, R.W.F., Malavolta, G., Schr\u00f6der, D., Thyagarajan, S.A.K.: Efficient invisible and unlinkable sanitizable signatures. In: Lin, D., Sako, K. (eds.) PKC 2019. LNCS, vol. 11442, pp. 159\u2013189. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17253-4_6"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-662-54388-7_6","volume-title":"Public-Key Cryptography \u2013 PKC 2017","author":"J Camenisch","year":"2017","unstructured":"Camenisch, J., Derler, D., Krenn, S., P\u00f6hls, H.C., Samelin, K., Slamanig, D.: Chameleon-hashes with ephemeral trapdoors. In: Fehr, S. (ed.) PKC 2017. LNCS, vol. 10175, pp. 152\u2013182. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54388-7_6"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-642-11925-5_13","volume-title":"Topics in Cryptology - CT-RSA 2010","author":"S Canard","year":"2010","unstructured":"Canard, S., Jambert, A.: On extended sanitizable signature schemes. In: Pieprzyk, J. (ed.) CT-RSA 2010. LNCS, vol. 5985, pp. 179\u2013194. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11925-5_13"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-642-13190-5_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"D Cash","year":"2010","unstructured":"Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 523\u2013552. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_27"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-030-45374-9_16","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"D Derler","year":"2020","unstructured":"Derler, D., Samelin, K., Slamanig, D.: Bringing order to chaos: the case of collision-resistant Chameleon-Hashes. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12110, pp. 462\u2013492. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45374-9_16"},{"key":"10_CR18","doi-asserted-by":"publisher","unstructured":"Esgin, M.F., Steinfeld, R., Liu, D., Ruj, S.: Efficient hybrid exact\/relaxed lattice proofs and applications to rounding and VRFs. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14085, pp. 484\u2013517. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_16","DOI":"10.1007\/978-3-031-38554-4_16"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-319-93387-0_11","volume-title":"Applied Cryptography and Network Security","author":"M Fischlin","year":"2018","unstructured":"Fischlin, M., Harasser, P.: Invisible sanitizable signatures and public-key encryption are equivalent. In: Preneel, B., Vercauteren, F. (eds.) ACNS 2018. LNCS, vol. 10892, pp. 202\u2013220. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93387-0_11"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-662-49384-7_12","volume-title":"Public-Key Cryptography \u2013 PKC 2016","author":"N Fleischhacker","year":"2016","unstructured":"Fleischhacker, N., Krupp, J., Malavolta, G., Schneider, J., Schr\u00f6der, D., Simkin, M.: Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys. In: Cheng, C.-M., Chung, K.-M., Persiano, G., Yang, B.-Y. (eds.) PKC 2016. LNCS, vol. 9614, pp. 301\u2013330. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49384-7_12"},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Ladner, R.E., Dwork, C. (eds.) 40th ACM STOC, pp. 197\u2013206. ACM Press, May 2008. https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"key":"10_CR22","doi-asserted-by":"publisher","unstructured":"Janson, C., Struck, P.: Sponge-based authenticated encryption: security against quantum attackers. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14085, pp. 230\u2013259. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-17234-2_12","DOI":"10.1007\/978-3-031-17234-2_12"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/978-3-030-84245-1_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"S Katsumata","year":"2021","unstructured":"Katsumata, S.: A new simple technique to bootstrap various lattice zero-knowledge proofs to\u00a0QROM secure NIZKs. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 580\u2013610. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_20"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/11927587_28","volume-title":"Information Security and Cryptology \u2013 ICISC 2006","author":"M Klonowski","year":"2006","unstructured":"Klonowski, M., Lauks, A.: Extended sanitizable signatures. In: Rhee, M.S., Lee, B. (eds.) ICISC 2006. LNCS, vol. 4296, pp. 343\u2013355. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11927587_28"},{"key":"10_CR25","unstructured":"Krawczyk, H., Rabin, T.: Chameleon Signatures. In: NDSS\u00a02000. The Internet Society, February 2000"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-319-29883-2_7","volume-title":"Data Privacy Management, and Security Assurance","author":"S Krenn","year":"2016","unstructured":"Krenn, S., Samelin, K., Sommer, D.: Stronger security for sanitizable signatures. In: Garcia-Alfaro, J., Navarro-Arribas, G., Aldini, A., Martinelli, F., Suri, N. (eds.) DPM\/QASA -2015. LNCS, vol. 9481, pp. 100\u2013117. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29883-2_7"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-319-45744-4_18","volume-title":"Computer Security \u2013 ESORICS 2016","author":"RWF Lai","year":"2016","unstructured":"Lai, R.W.F., Zhang, T., Chow, S.S.M., Schr\u00f6der, D.: Efficient sanitizable signatures without random oracles. In: Askoxylakis, I., Ioannidis, S., Katsikas, S., Meadows, C. (eds.) ESORICS 2016. LNCS, vol. 9878, pp. 363\u2013380. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45744-4_18"},{"key":"10_CR28","doi-asserted-by":"publisher","unstructured":"Li, Y., Liu, S.: Tagged chameleon hash from lattices and application to redactable blockchain. In: Tang, Q., Teague, V. (eds.) PKC 2024. LNCS, vol. 14603, pp. 288\u2013320. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57725-3_10","DOI":"10.1007\/978-3-031-57725-3_10"},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-49896-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"B Libert","year":"2016","unstructured":"Libert, B., Ling, S., Nguyen, K., Wang, H.: Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 1\u201331. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_1"},{"key":"10_CR30","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Nguyen, N.K.: BLOOM: bimodal lattice one-out-of-many proofs and applications. In: Tang, Q., Teague, V. (eds.) PKC 2024. LNCS, vol. 14603, pp. 95\u2013125. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_4","DOI":"10.1007\/978-3-031-22972-5_4"},{"key":"10_CR31","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. LNCS, vol. 13508, pp. 71\u2013 101. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_3","DOI":"10.1007\/978-3-031-15979-4_3"},{"key":"10_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41"},{"key":"10_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-030-26954-8_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"S Park","year":"2019","unstructured":"Park, S., Sealfon, A.: It wasn\u2019t Me! In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 159\u2013190. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_6"},{"key":"10_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/3-540-44647-8_21","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"A Shamir","year":"2001","unstructured":"Shamir, A., Tauman, Y.: Improved online\/offline signature schemes. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 355\u2013367. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_21"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-86599-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T19:18:35Z","timestamp":1742843915000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-86599-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031865985","9783031865992"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-86599-2_10","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":"15 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PQCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Post-Quantum Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"9 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pqcrypto2025.iis.sinica.edu.tw\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}