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

Journal of Information Security and Applications

Economical and secure: EcoSign — A post-quantum hash-based digital signature scheme

Swarna Panthi, Bubu Bhuyan

Published Oct 10, 2025• 0 citations
Publisher
DOI
10.1016/j.jisa.2025.104247

Related papers

Real-World Post-Quantum Digital Signatures

Denis Butin, Stefan-Lukas Gazdag, Johannes A Buchmann

Communications in computer and information science•Jan 1, 2015•9 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•9 citations

CRYPTOGRAPHIC PROTOCOL OF VERIFIABLY ENCRYPTED SIGNATURE WITH POSSIBILITY OF VERIFICATION AFTER A SPECIFIED TIME

Yerzhan N. Seitkulov, R. M. Ospanov, B. B. Yergaliyeva +2 more

One of the modern directions in the field of information security is post-quantum cryptography. Its purpose is to develop new quantum-resistant cryptographic algorithms. An important section of post-quantum cryptography is electronic digital signature algorithms. There are a number of different approaches to designing post-quantum signatures. One of the main approaches to designing post-quantum cryptographic digital signature algorithms is hash-based post-quantum digital signature schemes. Hash-based post-quantum digital signature schemes are one of the main types of post-quantum cryptographic digital signature algorithms. They are quite efficient and provably secure. Their reliable security has been established against both classical and quantum attacks. There are many types of digital signatures for solving various information security problems, such as group signatures, ring signatures, blind signatures, verifiably encrypted signatures, etc. This paper proposes a new cryptographic protocol of verifiably encrypted signature with possibility of verification after a specified time based on the post-quantum cryptographic algorithm of hash-based digital signature, TANBA-SPHINCS+. The protocol is an efficient combination of the postquantum digital signature algorithm TANBA-SPHINCS+, the cryptographic protocol providing data encryption for a specified time, ECTLC, and the verifiably encrypted signature scheme.

Herald of Kazakh-British technical university•Mar 29, 2026•0 citations

Quantum-Resistant Hash-Based Digital Signature Schemes: A Review

Swarna Panthi, Bubu Bhuyan

Lecture notes in networks and systems•Jan 1, 2024•3 citations

Post-Quantum Secure Group Signatures

Laurens Porzenheim

•Jan 1, 2019•0 citations

LPQ-HBSS: A Lightweight Post-Quantum Hash-Based Signature Scheme for Fog-Enabled Internet of Things Systems

Efat Fathalla, Raveendra Babu Ponnuru, Mohamed Azab

The emergence of quantum computing threatens the security assumptions underlying widely deployed public-key cryptographic systems across modern digital infrastructures. This challenge has accelerated the development of post-quantum cryptographic primitives capable of resisting quantum-capable adversaries. Among these, hash-based signature schemes are widely recognized as strong post-quantum candidates because their security relies solely on cryptographic hash functions. However, existing multi-time hash-based signature schemes, such as XMSS, rely on Merkle-tree structures to manage one-time signature keys, resulting in additional computational, communication, and verification overhead due to authentication-path construction and traversal.

IEEE Internet of Things Journal•Jan 1, 2026•0 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.
One of the modern directions in the field of information security is post-quantum cryptography. Its purpose is to develop new quantum-resistant cryptographic algorithms. An important section of post-quantum cryptography is electronic digital signature algorithms. There are a number of different approaches to designing post-quantum signatures. One of the main approaches to designing post-quantum cryptographic digital signature algorithms is hash-based post-quantum digital signature schemes. Hash-based post-quantum digital signature schemes are one of the main types of post-quantum cryptographic digital signature algorithms. They are quite efficient and provably secure. Their reliable security has been established against both classical and quantum attacks. There are many types of digital signatures for solving various information security problems, such as group signatures, ring signatures, blind signatures, verifiably encrypted signatures, etc. This paper proposes a new cryptographic protocol of verifiably encrypted signature with possibility of verification after a specified time based on the post-quantum cryptographic algorithm of hash-based digital signature, TANBA-SPHINCS+. The protocol is an efficient combination of the postquantum digital signature algorithm TANBA-SPHINCS+, the cryptographic protocol providing data encryption for a specified time, ECTLC, and the verifiably encrypted signature scheme.
The emergence of quantum computing threatens the security assumptions underlying widely deployed public-key cryptographic systems across modern digital infrastructures. This challenge has accelerated the development of post-quantum cryptographic primitives capable of resisting quantum-capable adversaries. Among these, hash-based signature schemes are widely recognized as strong post-quantum candidates because their security relies solely on cryptographic hash functions. However, existing multi-time hash-based signature schemes, such as XMSS, rely on Merkle-tree structures to manage one-time signature keys, resulting in additional computational, communication, and verification overhead due to authentication-path construction and traversal.