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

Collapseability of Tree Hashes

Aldo Gunsing, Bart Mennink

Published Jan 1, 2020• 0 citations
Publisher
DOI
10.1007/978-3-030-44223-1_28

Related papers

New Constructions of Collapsing Hashes

Mark Zhandry

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

Classical Proofs for the Quantum Collapsing Property of Classical Hash Functions

Serge Fehr

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

Efficient Quantum-Immune Keyless Signatures with Identity.

Ahto Buldas, Risto Laanoja, Ahto Truu

Abstract. We show how to extend hash-tree based data signatures to server-assisted personal digital signature schemes. The new signature scheme does not use trapdoor functions and is based solely on cryptographic hash functions and is thereby, considering the current state of knowledge, resistant to quantum computational attacks. In the new scheme, we combine hash-tree data signature (time-stamping) solutions with hash sequence authentication mechanisms. We show how to implement such a scheme in practice. 1

•Jan 1, 2014•12 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

Trapdoor Hash Functions and Their Applications

Nico Döttling, Sanjam Garg, Yuval Ishai +3 more

Lecture notes in computer science•Jan 1, 2019•114 citations

Verkle Tree-based Post-Quantum Digital Signature Scheme using Stateless Updatable Vector Commitment

Maksim Iavich, Tamari Kuchukhidze, Тетяна Охріменко

In recent years, work on quantum computers has made substantial progress. Many of the current public key cryptosystems can be broken if humans ever develop a powerful quantum computer. There are currently several commercial products that use these cryptosystems. Though we have developed defenses against quantum attacks, they are too risky and ineffective to be applied in daily life. The study analyzes hash-based digital signature methods. The evaluation of a digital signature using a Merkle tree. The paper investigates unique ideas using vector commitments and a Verkle tree. The authors of this study describe a novel, Verkle tree technology-based method for creating a digital signature system. This is accomplished using the Verkle tree, vector commitments, and vector commitments based on lattices for post-quantum aspects. This work also provides the theories behind post-quantum signature design using Verkle Tree.

Workshop on Cybersecurity Providing in Information and Telecommunication Systems (CPITS)•Nov 16, 2023•0 citations
Abstract. We show how to extend hash-tree based data signatures to server-assisted personal digital signature schemes. The new signature scheme does not use trapdoor functions and is based solely on cryptographic hash functions and is thereby, considering the current state of knowledge, resistant to quantum computational attacks. In the new scheme, we combine hash-tree data signature (time-stamping) solutions with hash sequence authentication mechanisms. We show how to implement such a scheme in practice. 1
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.
In recent years, work on quantum computers has made substantial progress. Many of the current public key cryptosystems can be broken if humans ever develop a powerful quantum computer. There are currently several commercial products that use these cryptosystems. Though we have developed defenses against quantum attacks, they are too risky and ineffective to be applied in daily life. The study analyzes hash-based digital signature methods. The evaluation of a digital signature using a Merkle tree. The paper investigates unique ideas using vector commitments and a Verkle tree. The authors of this study describe a novel, Verkle tree technology-based method for creating a digital signature system. This is accomplished using the Verkle tree, vector commitments, and vector commitments based on lattices for post-quantum aspects. This work also provides the theories behind post-quantum signature design using Verkle Tree.