Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Lattice-Based Sanitizable Signature Schemes: Chameleon Hash Functions and More

Sebastian Clermont, Samed Düzlü, Christian Janson, Laurens Porzenheim, Patrick Struck

Published Jan 1, 2025• 3 citations
Publisher
DOI
10.1007/978-3-031-86599-2_10

Related papers

Security Analysis and Algorithm Design of Chameleon Signature Scheme Based on Lattice Cryptography under Quantum Attacks

International journal for housing science and its applications.•Aug 15, 2025•0 citations

A Hash-Based Quantum-Resistant Chameleon Signature Scheme

P. Thanalakshmi, R. Anitha, Neelamegam Anbazhagan +3 more

As a standard digital signature may be verified by anybody, it is unsuitable for personal or economically sensitive applications. The chameleon signature system was presented by Krawczyk and Rabin as a solution to this problem. It is based on a hash then sign model. The chameleon hash function enables the trapdoor information holder to compute a message digest collision. The holder of a chameleon signature is the recipient of a chameleon signature. He could compute collision on the hash value using the trapdoor information. This keeps the recipient from disclosing his conviction to a third party and ensures the privacy of the signature. The majority of the extant chameleon signature methods are built on the computationally infeasible number theory problems, like integer factorization and discrete log. Unfortunately, the construction of quantum computers would be rendered insecure to those schemes. This creates a solid requirement for construct chameleon signatures for the quantum world. Hence, this paper proposes a novel quantum secure chameleon signature scheme based on hash functions. As a hash-based cryptosystem is an essential candidate of a post-quantum cryptosystem, the proposed hash-based chameleon signature scheme would be a promising alternative to the number of theoretic-based methods. Furthermore, the proposed method is key exposure-free and satisfies the security requirements such as semantic security, non-transferability, and unforgeability.

Sensors•Dec 16, 2021•8 citations

Shorter Hash-and-Sign Lattice-Based Signatures

Thomas Espitau, Mehdi Tibouchi, Alexandre Wallet +1 more

Lecture notes in computer science•Jan 1, 2022•39 citations

Identity-Based Chameleon Hashing from the SIS Assumption in a Central Authority Model

Wen‐Chung Kuo, Dai-Rui Lin, Shi-Xun Chen

Hash functions play a fundamental role in cryptography, offering one-way and collision-resistant properties essential for digital security. Chameleon hashing, an extension of traditional hash functions, allows controlled collision generation using a private trapdoor, enabling various cryptographic applications such as online/offline digital signatures and commitment schemes. However, existing identity-based chameleon hash (IBCH) functions largely rely on number-theoretic assumptions, which are vulnerable to quantum attacks. To address this issue, we propose a novel IBCH function built upon post-quantum lattice-based cryptography. Specifically, our construction leverages the Short Integer Solution (SIS) problem to achieve quantum-resistant security guarantees. The proposed scheme enables identitybased key management, allowing users to generate hash values using public identity information while preserving the trapdoorcontrolled collision property. We rigorously analyze the security of our scheme, demonstrating its resistance against quantum adversaries under standard lattice assumptions. Furthermore, we compare our construction with existing functions in terms of computational efficiency and security, showing that our approach provides a feasible and secure alternative for post-quantum applications.

IEEE Conference on Dependable and Secure Computing (DSC)•Oct 18, 2025•0 citations

Lattice-based undeniable signature scheme

Swati Rawal, Sahadeo Padhye, Debiao He

Annals of Telecommunications•Jan 10, 2022•6 citations

Improvement and Efficient Implementation of a Lattice-Based Signature Scheme

Rachid El Bansarkhani, Johannes A Buchmann

Lecture notes in computer science•Jan 1, 2014•60 citations
As a standard digital signature may be verified by anybody, it is unsuitable for personal or economically sensitive applications. The chameleon signature system was presented by Krawczyk and Rabin as a solution to this problem. It is based on a hash then sign model. The chameleon hash function enables the trapdoor information holder to compute a message digest collision. The holder of a chameleon signature is the recipient of a chameleon signature. He could compute collision on the hash value using the trapdoor information. This keeps the recipient from disclosing his conviction to a third party and ensures the privacy of the signature. The majority of the extant chameleon signature methods are built on the computationally infeasible number theory problems, like integer factorization and discrete log. Unfortunately, the construction of quantum computers would be rendered insecure to those schemes. This creates a solid requirement for construct chameleon signatures for the quantum world. Hence, this paper proposes a novel quantum secure chameleon signature scheme based on hash functions. As a hash-based cryptosystem is an essential candidate of a post-quantum cryptosystem, the proposed hash-based chameleon signature scheme would be a promising alternative to the number of theoretic-based methods. Furthermore, the proposed method is key exposure-free and satisfies the security requirements such as semantic security, non-transferability, and unforgeability.
Hash functions play a fundamental role in cryptography, offering one-way and collision-resistant properties essential for digital security. Chameleon hashing, an extension of traditional hash functions, allows controlled collision generation using a private trapdoor, enabling various cryptographic applications such as online/offline digital signatures and commitment schemes. However, existing identity-based chameleon hash (IBCH) functions largely rely on number-theoretic assumptions, which are vulnerable to quantum attacks. To address this issue, we propose a novel IBCH function built upon post-quantum lattice-based cryptography. Specifically, our construction leverages the Short Integer Solution (SIS) problem to achieve quantum-resistant security guarantees. The proposed scheme enables identitybased key management, allowing users to generate hash values using public identity information while preserving the trapdoorcontrolled collision property. We rigorously analyze the security of our scheme, demonstrating its resistance against quantum adversaries under standard lattice assumptions. Furthermore, we compare our construction with existing functions in terms of computational efficiency and security, showing that our approach provides a feasible and secure alternative for post-quantum applications.