Publikation: Lattice-Based Sanitizable Signature Schemes : Chameleon Hash Functions and More
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
DOI (zitierfähiger Link)
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
Sanitizable Signature Schemes (SSS) enable a designated party, the sanitizer, to modify predefined parts of a signed message without invalidating the signature, making them useful for applications like pseudonymization and redaction. Since their introduction by Ateniese et al. (ESORICS’05), several classical SSS constructions have been proposed, but none have been instantiated from quantum-resistant assumptions. In this work, we develop the first quantum-secure sanitizable signature schemes based on lattice assumptions. Our primary focus is on SSS constructions that rely on chameleon hash functions (CHFs), a key component for enabling the controlled modification of messages. While lattice-based CHFs exist, they do not meet the required security guarantees for SSS, becoming insecure under adversarial access to an adapt oracle. To address this, we construct a novel lattice-based CHF that achieves collision resistance even in such settings, called full collision resistance. However, our CHF lacks the uniqueness property, a limitation we show to be inherent in lattice-based CHFs. As a result, our SSS constructions initially fall short of achieving the critical security property of accountability. To overcome this, we apply a transformation based on verifiable ring signatures (VRS), for which we present the first lattice-based instantiation. Additionally, we provide a comprehensive analysis of existing classical SSS constructions, explore their potential for post-quantum instantiations, and present new attacks on previously assumed secure SSS schemes. Our work closes the gap in constructing quantum-secure SSS and lays the groundwork for further research into advanced cryptographic primitives based on lattice assumptions.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
CLERMONT, Sebastian, Samed DÜZLÜ, Christian JANSON, Laurens PORZENHEIM, Patrick STRUCK, 2025. Lattice-Based Sanitizable Signature Schemes : Chameleon Hash Functions and More. PQCrypto 2025 : International Conference on Post-Quantum Cryptography. Taipei, Taiwan, 9. Apr. 2025 - 11. Apr. 2025. In: NIEDERHAGEN, Ruben, Hrsg., Markku-Juhani O. SAARINEN, Hrsg.. Post-Quantum Cryptography 16th International Workshop, PQCrypto 2025, Proceedings, Part I. Cham: Springer, 2025, S. 278-311. Lecture Notes in Computer Science (LNCS). 15577. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-031-86598-5. Verfügbar unter: doi: 10.1007/978-3-031-86599-2_10BibTex
@inproceedings{Clermont2025Latti-73925,
title={Lattice-Based Sanitizable Signature Schemes : Chameleon Hash Functions and More},
year={2025},
doi={10.1007/978-3-031-86599-2_10},
number={15577},
isbn={978-3-031-86598-5},
issn={0302-9743},
address={Cham},
publisher={Springer},
series={Lecture Notes in Computer Science (LNCS)},
booktitle={Post-Quantum Cryptography 16th International Workshop, PQCrypto 2025, Proceedings, Part I},
pages={278--311},
editor={Niederhagen, Ruben and Saarinen, Markku-Juhani O.},
author={Clermont, Sebastian and Düzlü, Samed and Janson, Christian and Porzenheim, Laurens and Struck, Patrick}
}RDF
<rdf:RDF
xmlns:dcterms="http://purl.org/dc/terms/"
xmlns:dc="http://purl.org/dc/elements/1.1/"
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:bibo="http://purl.org/ontology/bibo/"
xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
xmlns:foaf="http://xmlns.com/foaf/0.1/"
xmlns:void="http://rdfs.org/ns/void#"
xmlns:xsd="http://www.w3.org/2001/XMLSchema#" >
<rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/73925">
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2025-07-11T11:11:19Z</dc:date>
<dcterms:issued>2025</dcterms:issued>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/73925"/>
<dc:language>eng</dc:language>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dc:contributor>Düzlü, Samed</dc:contributor>
<dc:creator>Struck, Patrick</dc:creator>
<dc:contributor>Clermont, Sebastian</dc:contributor>
<dc:creator>Porzenheim, Laurens</dc:creator>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dcterms:abstract>Sanitizable Signature Schemes (SSS) enable a designated party, the sanitizer, to modify predefined parts of a signed message without invalidating the signature, making them useful for applications like pseudonymization and redaction. Since their introduction by Ateniese et al. (ESORICS’05), several classical SSS constructions have been proposed, but none have been instantiated from quantum-resistant assumptions. In this work, we develop the first quantum-secure sanitizable signature schemes based on lattice assumptions. Our primary focus is on SSS constructions that rely on chameleon hash functions (CHFs), a key component for enabling the controlled modification of messages. While lattice-based CHFs exist, they do not meet the required security guarantees for SSS, becoming insecure under adversarial access to an adapt oracle. To address this, we construct a novel lattice-based CHF that achieves collision resistance even in such settings, called full collision resistance. However, our CHF lacks the uniqueness property, a limitation we show to be inherent in lattice-based CHFs. As a result, our SSS constructions initially fall short of achieving the critical security property of accountability. To overcome this, we apply a transformation based on verifiable ring signatures (VRS), for which we present the first lattice-based instantiation. Additionally, we provide a comprehensive analysis of existing classical SSS constructions, explore their potential for post-quantum instantiations, and present new attacks on previously assumed secure SSS schemes. Our work closes the gap in constructing quantum-secure SSS and lays the groundwork for further research into advanced cryptographic primitives based on lattice assumptions.</dcterms:abstract>
<dc:contributor>Janson, Christian</dc:contributor>
<dc:creator>Clermont, Sebastian</dc:creator>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dc:creator>Janson, Christian</dc:creator>
<dc:contributor>Porzenheim, Laurens</dc:contributor>
<dcterms:title>Lattice-Based Sanitizable Signature Schemes : Chameleon Hash Functions and More</dcterms:title>
<dc:contributor>Struck, Patrick</dc:contributor>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2025-07-11T11:11:19Z</dcterms:available>
<dc:creator>Düzlü, Samed</dc:creator>
</rdf:Description>
</rdf:RDF>