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

International Conference on Data Science, Advanced Algorithms and Intelligent Computing (DAI)

Research and Development of Post-Quantum Digital Signature

Qirui Luo

Published Jan 1, 2025• 0 citations
Publisher
DOI
10.5220/0014384900004861

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 survey on the additional proposals for post-quantum digital signature schemes

Jelle Sipkes

•Jul 1, 2025•0 citations

Feasibility of Post-Quantum Cryptography in Digital Signature Systems: From Theory to Proof of Concept

Nurul Syafiqah Norihsan

Asia-Pacific Journal of Information Technology and Multimedia•Jun 30, 2026•0 citations

A Post-Quantum Digital Signature Using Verkle Trees and Lattices

Maksim Iavich, Tamari Kuchukhidze, Răzvan Bocu

Research on quantum computers has advanced significantly in recent years. If humanity ever creates an effective quantum computer, many of the present public key cryptosystems can be compromised. These cryptosystems are currently found in many commercial products. We have devised solutions that seem to protect us from quantum attacks, but they are unsafe and inefficient for use in everyday life. In the paper, hash-based digital signature techniques are analyzed. A Merkle-tree-based digital signature is assessed. Using a Verkle tree and vector commitments, the paper explores novel ideas. The authors of this article present a unique technology for developing a post-quantum digital signature system using state-of-the-art Verkle tree technology. A Verkle tree, vector commitments, and vector commitments based on lattices for post-quantum features are used for this purpose. The concepts of post-quantum signature design utilizing a Verkle tree are also provided in the paper.

Symmetry•Dec 6, 2023•11 citations

A research on quantum digital signatures

Haoxuan Duan

This paper provides an overview of the basic principles, types, recent works, and applications of quantum digital signatures. The security of traditional digital signature schemes is compromised by the rise of quantum computing, leading to a need for post-quantum cryptography. Quantum digital signatures, which rely on the principles of quantum mechanics, offer a potential solution to this problem. This paper aims to provide a comprehensive overview of quantum digital signatures and post-quantum digital signatures. The paper introduces the basic principles of quantum mechanics, then explains key distribution in quantum digital signatures. The paper then provides a detailed description of both quantum and post-quantum digital signatures, including their differences and applications. Finally, the paper summarizes the main findings in the field, highlights potential future directions, and discusses challenges that humans must address. In addition, the paper examines the widespread applications of quantum digital signatures and post-quantum digital signatures in various fields such as Bitcoin, smart city blockchain, and finance. Finally, the paper summarizes the key findings in the field, highlighting potential future directions and discussing challenges that humans must address. Overall, this paper aims to provide readers with a comprehensive understanding of quantum digital signatures and post-quantum digital signatures and their applications in various domains.

Applied and Computational Engineering•Oct 23, 2023•7 citations

Comparative analysis of post-quantum digital signature protocols based on hash functions

Олексій Башук

In the era of active information technologies and device development, the emergence of portable and general-purpose quantum computers is only a matter of time. And although the benefit of their many times greater efficiency, compared to ordinary bit computers, will be obvious, at the same time, they will bring many vulnerabilities to modern algorithms of cryptography and cybersecurity. To prevent this from happening, society has already started researching post-quantum protocols to replace modern ones. Digital signature protocols were no exception. Thus, one of the approaches was constructing post-quantum digital signature protocols based on hash functions. The first representatives were schemes of one-time signatures based on hash functions, which were protected from the capabilities of quantum computers but had the obvious disadvantage of one-time use. The most famous is the so-called Lamport one-time signature. However, this disadvantage of one-time use has been solved by proposing different schemes of multi-time digital signatures based on the creation and use of many one-time signatures. Thus, chain-based and tree-based schemes of multi-time signatures were proposed. This work is devoted to the implementation and comparison of various multi-time signature schemes. During the research, theoretical estimates of memory usage and time required for the operations of various schemes were given. Further implementation of these schemes and final measurements showed the correspondence of theoretical estimates with empirical results and clearly demonstrated the advantages and disadvantages of different schemes. Thus, tree-based schemes showed the best performance, especially those where the tree is built sequentially. However, in certain cases, it makes sense to use a tree with full-depth construction. Due to the relative novelty and small amount of research in this field, multi-time digital signatures have much room for further research, for example, considering N-ary trees and comparing them with binary ones.

Bulletin of Taras Shevchenko National University of Kyiv Series Physics and Mathematics•Jun 5, 2026•0 citations
Research on quantum computers has advanced significantly in recent years. If humanity ever creates an effective quantum computer, many of the present public key cryptosystems can be compromised. These cryptosystems are currently found in many commercial products. We have devised solutions that seem to protect us from quantum attacks, but they are unsafe and inefficient for use in everyday life. In the paper, hash-based digital signature techniques are analyzed. A Merkle-tree-based digital signature is assessed. Using a Verkle tree and vector commitments, the paper explores novel ideas. The authors of this article present a unique technology for developing a post-quantum digital signature system using state-of-the-art Verkle tree technology. A Verkle tree, vector commitments, and vector commitments based on lattices for post-quantum features are used for this purpose. The concepts of post-quantum signature design utilizing a Verkle tree are also provided in the paper.
This paper provides an overview of the basic principles, types, recent works, and applications of quantum digital signatures. The security of traditional digital signature schemes is compromised by the rise of quantum computing, leading to a need for post-quantum cryptography. Quantum digital signatures, which rely on the principles of quantum mechanics, offer a potential solution to this problem. This paper aims to provide a comprehensive overview of quantum digital signatures and post-quantum digital signatures. The paper introduces the basic principles of quantum mechanics, then explains key distribution in quantum digital signatures. The paper then provides a detailed description of both quantum and post-quantum digital signatures, including their differences and applications. Finally, the paper summarizes the main findings in the field, highlights potential future directions, and discusses challenges that humans must address. In addition, the paper examines the widespread applications of quantum digital signatures and post-quantum digital signatures in various fields such as Bitcoin, smart city blockchain, and finance. Finally, the paper summarizes the key findings in the field, highlighting potential future directions and discussing challenges that humans must address. Overall, this paper aims to provide readers with a comprehensive understanding of quantum digital signatures and post-quantum digital signatures and their applications in various domains.
In the era of active information technologies and device development, the emergence of portable and general-purpose quantum computers is only a matter of time. And although the benefit of their many times greater efficiency, compared to ordinary bit computers, will be obvious, at the same time, they will bring many vulnerabilities to modern algorithms of cryptography and cybersecurity. To prevent this from happening, society has already started researching post-quantum protocols to replace modern ones. Digital signature protocols were no exception. Thus, one of the approaches was constructing post-quantum digital signature protocols based on hash functions. The first representatives were schemes of one-time signatures based on hash functions, which were protected from the capabilities of quantum computers but had the obvious disadvantage of one-time use. The most famous is the so-called Lamport one-time signature. However, this disadvantage of one-time use has been solved by proposing different schemes of multi-time digital signatures based on the creation and use of many one-time signatures. Thus, chain-based and tree-based schemes of multi-time signatures were proposed. This work is devoted to the implementation and comparison of various multi-time signature schemes. During the research, theoretical estimates of memory usage and time required for the operations of various schemes were given. Further implementation of these schemes and final measurements showed the correspondence of theoretical estimates with empirical results and clearly demonstrated the advantages and disadvantages of different schemes. Thus, tree-based schemes showed the best performance, especially those where the tree is built sequentially. However, in certain cases, it makes sense to use a tree with full-depth construction. Due to the relative novelty and small amount of research in this field, multi-time digital signatures have much room for further research, for example, considering N-ary trees and comparing them with binary ones.