Multichain Taprootized Atomic Swaps: Introducing Untraceability through Zero-Knowledge Proofs
- URL: http://arxiv.org/abs/2402.16735v1
- Date: Mon, 26 Feb 2024 16:57:29 GMT
- Title: Multichain Taprootized Atomic Swaps: Introducing Untraceability through Zero-Knowledge Proofs
- Authors: Oleksandr Kurbatov, Dmytro Zakharov, Anton Levochko, Kyrylo Riabov, Bohdan Skriabin,
- Abstract summary: 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.
- Score: 14.379311972506791
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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. We propose several implementation options: single-transaction protocol, multiple-transaction protocol that splits the receiving amount in an untraceable way, and multichain swap protocol. Our proposed approach works with any smart-contract-compatible chain and multiple Taproot-compatible chains. We describe the concrete implementation of the protocol and release the source code publically.
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) - SmartAxe: Detecting Cross-Chain Vulnerabilities in Bridge Smart Contracts via Fine-Grained Static Analysis [28.420618636956924]
Cross-chain bridge is a decentralized application for asset exchange across different blockchain platforms.
There are a number of recent security incidents with heavy financial losses caused by vulnerabilities in bridge smart contracts.
We propose SmartAxe, a new framework to identify vulnerabilities in cross-chain bridge smart contracts.
arXiv Detail & Related papers (2024-06-23T03:25:27Z) - Scalable UTXO Smart Contracts via Fine-Grained Distributed State [0.8192907805418581]
Current UTXO-based smart contracts face an efficiency bottleneck, requiring any transaction sent to a contract to specify the entire updated contract state.
We propose a technique to efficiently execute smart contracts on an extended UTXO blockchain, which allows the contract state to be distributed across multiple UTXOs.
arXiv Detail & Related papers (2024-06-11T20:28:27Z) - Sequencer Level Security [2.756899615600916]
We introduce the Sequencer Level Security (SLS) protocol, an enhancement to sequencing protocols of rollups.
We describe the mechanics of the protocol for both the transactions submitted to the rollup mempool, as well as transactions originating from Layer one.
We implement a prototype of the SLS protocol, Zircuit, which is built on top of Geth and the OP stack.
arXiv Detail & Related papers (2024-05-03T02:47:40Z) - 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) - Securing Blockchain Systems: A Novel Collaborative Learning Framework to Detect Attacks in Transactions and Smart Contracts [26.85360925398753]
This paper presents a novel collaborative learning framework designed to detect attacks in blockchain transactions and smart contracts.
Our framework exhibits the capability to classify various types of blockchain attacks, including intricate attacks at the machine code level.
Our framework achieves a detection accuracy of approximately 94% through extensive simulations and real-time experiments with a throughput of over 2,150 transactions per second.
arXiv Detail & Related papers (2023-08-30T07:17:20Z) - Masquerade: Simple and Lightweight Transaction Reordering Mitigation in Blockchains [5.690884793952696]
We propose an MEV aware protocol design called Masquerade to increase user satisfaction and confidence in the system.
We introduce the notion of a "token" to mitigate the actions taken by an adversary in an attack scenario.
arXiv Detail & Related papers (2023-08-29T14:42:43Z) - Blockchain Large Language Models [65.7726590159576]
This paper presents a dynamic, real-time approach to detecting anomalous blockchain transactions.
The proposed tool, BlockGPT, generates tracing representations of blockchain activity and trains from scratch a large language model to act as a real-time Intrusion Detection System.
arXiv Detail & Related papers (2023-04-25T11:56:18Z) - TxAllo: Dynamic Transaction Allocation in Sharded Blockchain Systems [37.22526235663589]
This paper focuses on the transaction allocation problem to reduce the number of cross-shard transactions.
A deterministic and fast allocation scheme TxAllo is proposed to dynamically infer the allocation of accounts.
For a blockchain with 60 shards, TxAllo reduces the cross-shard transaction ratio from 98% to about 12%.
arXiv Detail & Related papers (2022-12-22T10:22:31Z) - 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)
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.