Quantum resistant multi-signature scheme with optimal communication round: A Blockchain-based approach
- URL: http://arxiv.org/abs/2404.17787v1
- Date: Sat, 27 Apr 2024 06:05:44 GMT
- Title: Quantum resistant multi-signature scheme with optimal communication round: A Blockchain-based approach
- Authors: Hamidreza Rahmati, Farhad Rahmati,
- Abstract summary: We present a new multi signature scheme based on lattices, known as Razhims, that has aggregate public key, necessitates solely a single round of communication, and is resistant to quantum computers.
In Razhims, the aggregate public key size and the final signature size are equal to validating the public key size and the final signature size of a standard signature respectively, and are independent of the number of signers.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: Blockchain is a decentralized network to increase trust, integrity, and transparency of transactions. With the exponential growth of transactions in the realm of Blockchain, especially in Bitcoin, Blockchain size increases as all transactions must be stored and verified. In Bitcoin, validating M of N transactions involves the necessity of M authentic signatures out of the total N transactions. This procedure is so time-consuming and needs a significant storage capacity. To address these issues, several multi signature schemes have been proposed, enabling users to interactively generate a common signature on a single message. Recently, some lattice based multi signature schemes have been presented to deal with the threats of quantum computers. However, none of them have met all desirable features of multi signature schemes like aggregate public key, low numbers of communication rounds, or resistant to quantum computers. Within this paper, we present a new multi signature scheme based on lattices, known as Razhims, that has aggregate public key, necessitates solely a single round of communication, and is resistant to quantum computers. In Razhims, the aggregate public key size and the final signature size are equal to the public key size and the final signature size of a standard signature respectively, and are independent of the number of signers.
Related papers
- The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols.
Existing approaches for threshold cryptosystems introduce a latency overhead of at least one message delay for running the threshold cryptographic protocol.
We propose a mechanism to eliminate this overhead for blockchain-native threshold cryptosystems with tight thresholds.
arXiv Detail & Related papers (2024-07-16T20:53:04Z) - A Multi-Party, Multi-Blockchain Atomic Swap Protocol with Universal Adaptor Secret [2.850220538113752]
This paper presents a novel multi-party atomic swap protocol that operates almost entirely off-chain.
By addressing key challenges such as collusion attacks and malicious dropouts, our protocol significantly enhances the security and efficiency of multi-party atomic swaps.
arXiv Detail & Related papers (2024-06-24T17:33:03Z) - Blockchains for Internet of Things: Fundamentals, Applications, and Challenges [38.29453164670072]
Not every blockchain system is suitable for specific IoT applications.
Public blockchains are not suitable for storing sensitive data.
We explore the blockchain's application in three pivotal IoT areas: edge AI, communications, and healthcare.
arXiv Detail & Related papers (2024-05-08T04:25:57Z) - Towards post-quantum blockchain: A review on blockchain cryptography
resistant to quantum computing attacks [0.0]
This article studies current state of the art on post-quantum cryptosystems and how they can be applied to blockchains and DLTs.
It provides comparisons on the characteristics and performance of the most promising post-quantum public-key encryption and digital signature schemes for blockchains.
arXiv Detail & Related papers (2024-02-01T17:29:07Z) - Dynamic Quantum Group Key Agreement via Tree Key Graphs [36.47236890715043]
We propose two dynamic Quantum Group Key Agreement protocols for a join or leave request in group communications.
The number of qubits required per join or leave only increases logarithmically with the group size.
arXiv Detail & Related papers (2023-12-07T07:45:59Z) - Scalable and Adaptively Secure Any-Trust Distributed Key Generation and All-hands Checkpointing [3.1771413727096154]
We propose a practical DKG for DLog-based cryptosystems, which achieves (quasi-)linear and communication per-node cost with the help of a common coin.
Our protocol is secure against adaptive adversaries, which can corrupt less than half of all nodes.
We present a generic transformer that enables us to efficiently deploy a conventional distributed protocol like our DKG, even when the participants have different weights.
arXiv Detail & Related papers (2023-11-16T06:05:01Z) - One-Time Universal Hashing Quantum Digital Signatures without Perfect
Keys [24.240914319917053]
We show that imperfect quantum keys with limited information leakage can be used for digital signatures and authentication without compromising security.
This study significantly reduces the delay for data postprocessing and is compatible with any quantum key generation protocols.
arXiv Detail & Related papers (2023-01-03T14:54:27Z) - Quantum-resistance in blockchain networks [46.63333997460008]
This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Quantum Computing (CQC), and Tecnologico de Monterrey to identify and eliminate quantum threats in blockchain networks.
The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms.
arXiv Detail & Related papers (2021-06-11T23:39:25Z) - Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's
Post-Quantum Security [67.06003361150228]
A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task.
In this work, we examine the hardness of finding such chain of PoWs against quantum strategies.
We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
arXiv Detail & Related papers (2020-12-30T18:03:56Z) - Experimental quantum conference key agreement [55.41644538483948]
Quantum networks will provide multi-node entanglement over long distances to enable secure communication on a global scale.
Here we demonstrate quantum conference key agreement, a quantum communication protocol that exploits multi-partite entanglement.
We distribute four-photon Greenberger-Horne-Zeilinger (GHZ) states generated by high-brightness, telecom photon-pair sources across up to 50 km of fibre.
arXiv Detail & Related papers (2020-02-04T19:00:31Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.