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

Mitigating Multi-target Attacks in Hash-Based Signatures

Andreas Hülsing, Joost Rijneveld, Fang Song

Published Jan 1, 2016• 121 citations
Publisher
DOI
10.1007/978-3-662-49384-7_15

Related papers

Efficient Unconditionally Secure Signatures Using Universal Hashing

Ryan Amiri, Aysajan Abidin, Petros Wallden +1 more

Lecture notes in computer science•Jan 1, 2018•14 citations

K2SN-MSS

Sabyasachi Karati, Reihaneh Safavi–Naini

With the rapid development of quantum technologies, quantum-safe cryptography has found significant attention. Hash-based signature schemes have been in particular of interest because of (i) the importance of digital signature as the main source of trust on the Internet, (ii) the fact that the security of these signatures relies on existence of one-way functions, which is the minimal assumption for signature schemes, and (iii) they can be efficiently implemented. Basic hash-based signatures are for a single message, but have been extended for signing multiple messages. In this paper we design a Multi-message Signature Scheme (MSS) based on an existing One-Time Signature (OTS) that we refer to as KSN-OTS. KSN uses SWIFFT, an additive homomorphic lattice-based hash function family with provable one-wayness property, as the one-way-function and achieves a short signature. We prove security of our proposed signature scheme in a new strengthened security model (multi-target multi-function) of MSS, determine the system parameters for 512 bit classical (256 bit quantum) security, and compare parameter sizes of our scheme against XMSS, a widely studied hash based MSS that has been a candidate for NIST standardization of post-quantum signature scheme. We give an efficient implementation of our scheme using Intel SIMD (Single Instruction Multiple Data) instruction set. For this, we first implement SWIFFT computation using a SIMD parallelization of Number Theoretic Transform (NTT) of elements of the ring Zp[X]/(Xn+1), that can support different levels of parallelization. We compare efficiency of this implementation with a comparable (security level) implementation of XMSS and show its superior performance on a number of efficiency parameters.

ACM Asia Conference on Computer and Communications Security (ASIA CCS)•Jul 2, 2019•7 citations

Multi-party verifiable arbitrated quantum signature scheme with information hiding function

Qin Gao, Dianjun Lu, Dongqin Wen +2 more

Abstract With the progress of science and technology, more and more researchers have begun to pay attention to quantum digital signature schemes. Arbitrated quantum signatures have attracted much attention due to their many advantages. This paper presents a multi-verifiable arbitrated quantum signature scheme with information hiding function. In this scheme, the original information and the shared key are hidden in the Bell state, so that any attacker cannot obtain the original information through quantum measurement. In this scheme, multi-verifiers connect end to end to form a ring, and the feasibility of the scheme can be verified if and only if all verifiers participate. Ring verifiers select one of them as the representative. The representative uses the one-way hash function for authentication and indicates the identity to the arbitrator. Therefore the arbitrator does not need to verify the identities of all the verifiers and improves the authentication efficiency. The security analysis shows that the scheme is undeniability, unforgeability and can resistant to intercept-resend attacks, combined attacks and cheating attacks.

Laser Physics Letters•Jul 30, 2025•3 citations

Quantum-Access Security of Hash-Based Signature Schemes

Quan Yuan, Mehdi Tibouchi, Masayuki Abe

Lecture notes in computer science•Jan 1, 2023•8 citations

Tightly Secure Identity-Based Signature from Cryptographic Group Actions

Xuan Thanh Khuc, Willy Susilo, Dung Hoang Duong +3 more

Lecture notes in computer science•Jan 1, 2025•0 citations

Syrga2: Post-Quantum Hash-Based Signature Scheme

Kunbolat T. Algazy, Kairat Sakan, Saule Nyssanbayeva +1 more

This paper proposes a new post-quantum signature scheme, Syrga2, based on hash functions. As known, existing post-quantum algorithms are classified based on their structures. The proposed Syrga2 scheme belongs to the class of multi-use signatures with state retention. A distinctive feature of state-retaining signatures is achieving a compromise between performance and signature size. This scheme enables the creation of a secure signature for r messages using a single pair of secret and public keys. The strength of signature algorithms based on hash functions depends on the properties of the hash function used in their structure. Additionally, for such algorithms, it is possible to specify the security level precisely. In the proposed scheme, the HBC-256 algorithm developed at the Institute of Information and Computational Technologies (IICT) is used as the hash function. The security of the HBC-256 algorithm has been thoroughly studied in other works by the authors. In contrast to the Syrga1 scheme presented in previous works by the authors, the Syrga2 scheme provides for the definition of different security levels determined by the parameter τ. This paper experimentally demonstrates the impossibility of breaking the proposed scheme using a chosen-plaintext attack. Additionally, the scheme’s performance is evaluated for signature creation, signing, and message verification.

Computation•Jun 15, 2024•6 citations
With the rapid development of quantum technologies, quantum-safe cryptography has found significant attention. Hash-based signature schemes have been in particular of interest because of (i) the importance of digital signature as the main source of trust on the Internet, (ii) the fact that the security of these signatures relies on existence of one-way functions, which is the minimal assumption for signature schemes, and (iii) they can be efficiently implemented. Basic hash-based signatures are for a single message, but have been extended for signing multiple messages. In this paper we design a Multi-message Signature Scheme (MSS) based on an existing One-Time Signature (OTS) that we refer to as KSN-OTS. KSN uses SWIFFT, an additive homomorphic lattice-based hash function family with provable one-wayness property, as the one-way-function and achieves a short signature. We prove security of our proposed signature scheme in a new strengthened security model (multi-target multi-function) of MSS, determine the system parameters for 512 bit classical (256 bit quantum) security, and compare parameter sizes of our scheme against XMSS, a widely studied hash based MSS that has been a candidate for NIST standardization of post-quantum signature scheme. We give an efficient implementation of our scheme using Intel SIMD (Single Instruction Multiple Data) instruction set. For this, we first implement SWIFFT computation using a SIMD parallelization of Number Theoretic Transform (NTT) of elements of the ring Zp[X]/(Xn+1), that can support different levels of parallelization. We compare efficiency of this implementation with a comparable (security level) implementation of XMSS and show its superior performance on a number of efficiency parameters.
Abstract With the progress of science and technology, more and more researchers have begun to pay attention to quantum digital signature schemes. Arbitrated quantum signatures have attracted much attention due to their many advantages. This paper presents a multi-verifiable arbitrated quantum signature scheme with information hiding function. In this scheme, the original information and the shared key are hidden in the Bell state, so that any attacker cannot obtain the original information through quantum measurement. In this scheme, multi-verifiers connect end to end to form a ring, and the feasibility of the scheme can be verified if and only if all verifiers participate. Ring verifiers select one of them as the representative. The representative uses the one-way hash function for authentication and indicates the identity to the arbitrator. Therefore the arbitrator does not need to verify the identities of all the verifiers and improves the authentication efficiency. The security analysis shows that the scheme is undeniability, unforgeability and can resistant to intercept-resend attacks, combined attacks and cheating attacks.
This paper proposes a new post-quantum signature scheme, Syrga2, based on hash functions. As known, existing post-quantum algorithms are classified based on their structures. The proposed Syrga2 scheme belongs to the class of multi-use signatures with state retention. A distinctive feature of state-retaining signatures is achieving a compromise between performance and signature size. This scheme enables the creation of a secure signature for r messages using a single pair of secret and public keys. The strength of signature algorithms based on hash functions depends on the properties of the hash function used in their structure. Additionally, for such algorithms, it is possible to specify the security level precisely. In the proposed scheme, the HBC-256 algorithm developed at the Institute of Information and Computational Technologies (IICT) is used as the hash function. The security of the HBC-256 algorithm has been thoroughly studied in other works by the authors. In contrast to the Syrga1 scheme presented in previous works by the authors, the Syrga2 scheme provides for the definition of different security levels determined by the parameter τ. This paper experimentally demonstrates the impossibility of breaking the proposed scheme using a chosen-plaintext attack. Additionally, the scheme’s performance is evaluated for signature creation, signing, and message verification.