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

Efficient Unconditionally Secure Signatures Using Universal Hashing

Ryan Amiri, Aysajan Abidin, Petros Wallden, Erika Andersson

Published Jan 1, 2018• 14 citations
Publisher
DOI
10.1007/978-3-319-93387-0_8

Related papers

Unconditionally-Secure Digital Signatures

David Chaum, Saw Sandra Roijakkers

Springer eBooks•Dec 3, 2007•74 citations

Practical unconditionally secure signature schemes and related protocols

Ryan Amiri

•Jan 1, 2018•0 citations

Secure Byzantine Fault Tolerance Mechanisms for Quantum Computing

Monika Anand, Pramod Kumar, Rakeshnag Dasari +3 more

Quantum computing in consumer applications strengthens blockchain consensus mechanisms against quantum threats. An innovative quantum-safe Byzantine Fault Tolerance (BFT) consensus technique strengthens consumer-oriented blockchain applications. This new method effortlessly integrates Quantum Key Distribution (QKD) networks to overcome public key digital signature weaknesses, boosting security. Using a unique blend of QKD and a multilinear hash function family, the suggested technique creates Multilinear Hash Unconditionally Secure Signature (MHUSS). Signatures generated by MHUSS are tamper-proof, irrefutable, and transferable. This powerful solution may be installed on existing consumer devices to add security. QSBFT addresses the consensus speed issues of older Byzantine Fault Tolerance approaches like PBFT. This approach benefits consumer apps that need fast, secure transactions. Adding a ‘rapid G standard’ dual consensus option and allowing nodes to vote on empty blocks reduces system communication frequency, simplifying consensus. Quantum-resistant framework improves security, system responsiveness, messaging, and consensus mechanism efficiency. This new framework provides higher throughput and latency, especially in consumer-centric scenarios, according to performance simulations and tests. This development in quantum-resistant blockchain technology for consumer application is considerable compared to the upgraded PBFT mechanism based on MHUSS. Security and efficiency are balanced, ensuring resilience as quantum computing capabilities evolve.

International Conference on Intelligent Control, Computing and Communications (IC3)•Feb 13, 2025•2 citations

Secure Byzantine Fault Tolerance Mechanisms for Quantum Computing

Monika Anand, Pramod Kumar, Rakeshnag Dasari +3 more

Quantum computing in consumer applications strengthens blockchain consensus mechanisms against quantum threats. An innovative quantum-safe Byzantine Fault Tolerance (BFT) consensus technique strengthens consumer-oriented blockchain applications. This new method effortlessly integrates Quantum Key Distribution (QKD) networks to overcome public key digital signature weaknesses, boosting security. Using a unique blend of QKD and a multilinear hash function family, the suggested technique creates Multilinear Hash Unconditionally Secure Signature (MHUSS). Signatures generated by MHUSS are tamper-proof, irrefutable, and transferable. This powerful solution may be installed on existing consumer devices to add security. QSBFT addresses the consensus speed issues of older Byzantine Fault Tolerance approaches like PBFT. This approach benefits consumer apps that need fast, secure transactions. Adding a 'rapid G standard' dual consensus option and allowing nodes to vote on empty blocks reduces system communication frequency, simplifying consensus. Quantum-resistant framework improves security, system responsiveness, messaging, and consensus mechanism efficiency. This new framework provides higher throughput and latency, especially in consumer-centric scenarios, according to performance simulations and tests. This development in quantum-resistant blockchain technology for consumer application is considerable compared to the upgraded PBFT mechanism based on MHUSS. Security and efficiency are balanced, ensuring resilience as quantum computing capabilities evolve.

OPJU International Technology Conference on Smart Computing for Innovation and Advancement in Industry (OTCON)•Apr 9, 2025•1 citation

Mitigating Multi-target Attacks in Hash-Based Signatures

Andreas Hülsing, Joost Rijneveld, Fang Song

Lecture notes in computer science•Jan 1, 2016•121 citations

Using Hash-Based Signatures to Bootstrap Quantum Key Distribution

Sébastien Kunz-Jacques, Paul Jouguet

Quantum Key Distribution is a secret distribution technique that requires an authenticated channel. This channel is usually created on top of an un-authenticated communication medium using unconditionally secure Message Authentication Codes (MAC) and an initial common secret. We examine the consequences of replacing this MAC algorithm by a cryptographic hash-based signature algorithm, like the Lamport algorithm. We show that provided one-way functions exist, the Lamport algorithm or its variants can be instantiated in a secure way in the Universally Composable sense, and can therefore be plugged into any QKD protocol with a composable security proof in a secure manner. This association, while relying on short-term computational hardness assumptions, results in an increase of the practical security of QKD and eases its deployment.

arXiv:1109.2844•Sep 13, 2011•5 citations
Quantum computing in consumer applications strengthens blockchain consensus mechanisms against quantum threats. An innovative quantum-safe Byzantine Fault Tolerance (BFT) consensus technique strengthens consumer-oriented blockchain applications. This new method effortlessly integrates Quantum Key Distribution (QKD) networks to overcome public key digital signature weaknesses, boosting security. Using a unique blend of QKD and a multilinear hash function family, the suggested technique creates Multilinear Hash Unconditionally Secure Signature (MHUSS). Signatures generated by MHUSS are tamper-proof, irrefutable, and transferable. This powerful solution may be installed on existing consumer devices to add security. QSBFT addresses the consensus speed issues of older Byzantine Fault Tolerance approaches like PBFT. This approach benefits consumer apps that need fast, secure transactions. Adding a ‘rapid G standard’ dual consensus option and allowing nodes to vote on empty blocks reduces system communication frequency, simplifying consensus. Quantum-resistant framework improves security, system responsiveness, messaging, and consensus mechanism efficiency. This new framework provides higher throughput and latency, especially in consumer-centric scenarios, according to performance simulations and tests. This development in quantum-resistant blockchain technology for consumer application is considerable compared to the upgraded PBFT mechanism based on MHUSS. Security and efficiency are balanced, ensuring resilience as quantum computing capabilities evolve.
Quantum computing in consumer applications strengthens blockchain consensus mechanisms against quantum threats. An innovative quantum-safe Byzantine Fault Tolerance (BFT) consensus technique strengthens consumer-oriented blockchain applications. This new method effortlessly integrates Quantum Key Distribution (QKD) networks to overcome public key digital signature weaknesses, boosting security. Using a unique blend of QKD and a multilinear hash function family, the suggested technique creates Multilinear Hash Unconditionally Secure Signature (MHUSS). Signatures generated by MHUSS are tamper-proof, irrefutable, and transferable. This powerful solution may be installed on existing consumer devices to add security. QSBFT addresses the consensus speed issues of older Byzantine Fault Tolerance approaches like PBFT. This approach benefits consumer apps that need fast, secure transactions. Adding a 'rapid G standard' dual consensus option and allowing nodes to vote on empty blocks reduces system communication frequency, simplifying consensus. Quantum-resistant framework improves security, system responsiveness, messaging, and consensus mechanism efficiency. This new framework provides higher throughput and latency, especially in consumer-centric scenarios, according to performance simulations and tests. This development in quantum-resistant blockchain technology for consumer application is considerable compared to the upgraded PBFT mechanism based on MHUSS. Security and efficiency are balanced, ensuring resilience as quantum computing capabilities evolve.
Quantum Key Distribution is a secret distribution technique that requires an authenticated channel. This channel is usually created on top of an un-authenticated communication medium using unconditionally secure Message Authentication Codes (MAC) and an initial common secret. We examine the consequences of replacing this MAC algorithm by a cryptographic hash-based signature algorithm, like the Lamport algorithm. We show that provided one-way functions exist, the Lamport algorithm or its variants can be instantiated in a secure way in the Universally Composable sense, and can therefore be plugged into any QKD protocol with a composable security proof in a secure manner. This association, while relying on short-term computational hardness assumptions, results in an increase of the practical security of QKD and eases its deployment.