A Multi-Party, Multi-Blockchain Atomic Swap Protocol with Universal Adaptor Secret

• URL: http://arxiv.org/abs/2406.16822v1
• Date: Mon, 24 Jun 2024 17:33:03 GMT
• Title: A Multi-Party, Multi-Blockchain Atomic Swap Protocol with Universal Adaptor Secret
• Authors: Shengewei You, Aditya Joshi, Andrey Kuehlkamp, Jarek Nabrzyski,
• Abstract summary: 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.
• Score: 2.850220538113752
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The increasing complexity of digital asset transactions across multiple blockchains necessitates a robust atomic swap protocol that can securely handle more than two participants. Traditional atomic swap protocols, including those based on adaptor signatures, are vulnerable to malicious dropout attacks, which break atomicity and compromise the security of the transaction. This paper presents a novel multi-party atomic swap protocol that operates almost entirely off-chain, requiring only a single on-chain transaction for finalization. Our protocol leverages Schnorr-like signature verification and a universal adaptor secret to ensure atomicity and scalability across any number of participants and blockchains without the need for smart contracts or trusted third parties. By addressing key challenges such as collusion attacks and malicious dropouts, our protocol significantly enhances the security and efficiency of multi-party atomic swaps. Our contributions include the first scalable, fully off-chain protocol for atomic swaps involving any number of participants, adding zero overhead to native blockchains, and providing a practical and cost-effective solution for decentralized asset exchanges.

Related papers

• Atomic Transfer Graphs: Secure-by-design Protocols for Heterogeneous Blockchain Ecosystems [7.312229214872541]
  We propose a framework for generating secure-by-design protocols that realize common security and functionality goals. The resulting protocols build upon Timelock Contracts (CTLCs), a novel minimal smart contract functionality. Our framework is the first to provide generic and provably secure protocols for all these use cases while matching or improving the performance of existing use-case-specific protocols.
  arXiv  Detail & Related papers  (2025-01-29T17:25:53Z)
• AsyncSC: An Asynchronous Sidechain for Multi-Domain Data Exchange in Internet of Things [38.94331838546716]
  Current state-of-the-art (SOTA) schemes for IoT multi-domain data exchange are constrained by the need for synchronous networks. In this paper, we propose AsyncSC, a novel asynchronous sidechain construction. Results show that AsyncSC outperforms SOTA schemes, improving throughput by an average of 1.21 to 3.96 times, reducing transaction latency by 59.76% to 83.61%, and maintaining comparable resource overhead.
  arXiv  Detail & Related papers  (2024-12-17T09:43:37Z)
• Quantum digital signature based on single-qubit without a trusted third-party [45.41082277680607]
  We propose a brand new quantum digital signature protocol without a trusted third party only with qubit technology to further improve the security. We prove that the protocol has information-theoretical unforgeability. Moreover, it satisfies other important secure properties, including asymmetry, undeniability, and expandability.
  arXiv  Detail & Related papers  (2024-10-17T09:49:29Z)
• 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)
• Quantum resistant multi-signature scheme with optimal communication round: A Blockchain-based approach [0.0]
  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.
  arXiv  Detail & Related papers  (2024-04-27T06:05:44Z)
• Atomicity and Abstraction for Cross-Blockchain Interactions [2.041399528183464]
  Current methods for multi-chain atomic transactions are limited in scope to cryptocurrency swaps. We first define a uniform, high-level interface for communication between chains. We then formulate a protocol that guarantees atomicity for general transactions whose operations may span several chains.
  arXiv  Detail & Related papers  (2024-03-12T02:13:29Z)
• Multichain Taprootized Atomic Swaps: Introducing Untraceability through Zero-Knowledge Proofs [14.379311972506791]
  Taprootized Atomic Swaps is an extension for Atomic Swaps that enables the untraceability of transactions in a particular swap. Based on Schnorr signatures, Taproot technology, and zero-knowledge proofs, the taprootized atomic swaps hide swap transactions between regular payments.
  arXiv  Detail & Related papers  (2024-02-26T16:57:29Z)
• 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)
• An Efficient and Multi-private Key Secure Aggregation for Federated Learning [41.29971745967693]
  We propose an efficient and multi-private key secure aggregation scheme for federated learning. Specifically, we skillfully modify the variant ElGamal encryption technique to achieve homomorphic addition operation. For the high dimensional deep model parameter, we introduce a super-increasing sequence to compress multi-dimensional data into 1-D.
  arXiv  Detail & Related papers  (2023-06-15T09:05:36Z)
• 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)
• 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.