Union: A Trust-minimized Bridge for Rootstock
- URL: http://arxiv.org/abs/2501.07435v2
- Date: Tue, 14 Jan 2025 17:04:40 GMT
- Title: Union: A Trust-minimized Bridge for Rootstock
- Authors: Ramon Amela, Shreemoy Mishra, Sergio Demian Lerner, Javier Álvarez Cid-Fuentes,
- Abstract summary: We present Union, a trust-minimized bridge protocol that enables secure transfer of BTC between Bitcoin and a secondary blockchain.<n>Union employs a multi-party variant of BitVMX, an optimistic proving system on Bitcoin, to create a bridge that operates securely under the assumption that at least one participant remains honest.
- Score: 0.3374875022248865
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We present Union, a trust-minimized bridge protocol that enables secure transfer of BTC between Bitcoin and a secondary blockchain. The growing ecosystem of blockchain systems built around Bitcoin has created a pressing need for secure and efficient bridges to transfer BTC between networks while preserving Bitcoin's security guarantees. Union employs a multi-party variant of BitVMX, an optimistic proving system on Bitcoin, to create a bridge that operates securely under the assumption that at least one participant remains honest. This 1-of-n honest approach is strikingly different from the conventional honest-majority assumption adopted by practically all federated systems. The protocol introduces several innovations: a packet-based architecture that allows security bonds to be reused for multiple bridge operations, improving capital efficiency; a system of enablers to manage functionaries participation and to enforce penalties; a flexible light client framework adaptable to various blockchain architectures; and an efficient stop watch mechanism to optimize time-lock management. Union is a practical and scalable solution for Bitcoin interoperability that maintains strong security guarantees and minimizes trust assumptions.
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) - PoVF: Empowering Decentralized Blockchain Systems with Verifiable Function Consensus [3.025170969569728]
This paper proposes a fair consensus mechanism called Proof of Verifiable Functions (PoVF)<n>PoVF provides a sufficiently fair mechanism, ensuring that all nodes in blockchain network have equal opportunity to participate in consensus.<n>According to our security analysis, PoVF is provably secure and has the ability to resist potential adversaries.
arXiv Detail & Related papers (2025-01-02T08:59:24Z) - 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) - Enhancing Trust and Privacy in Distributed Networks: A Comprehensive Survey on Blockchain-based Federated Learning [51.13534069758711]
Decentralized approaches like blockchain offer a compelling solution by implementing a consensus mechanism among multiple entities.
Federated Learning (FL) enables participants to collaboratively train models while safeguarding data privacy.
This paper investigates the synergy between blockchain's security features and FL's privacy-preserving model training capabilities.
arXiv Detail & Related papers (2024-03-28T07:08:26Z) - chainBoost: A Secure Performance Booster for Blockchain-based Resource Markets [0.6383640665055312]
We propose chainBoost, a secure performance booster for decentralized resource markets.
It expedites service related operations, reduces the blockchain size, and supports flexible service-payment exchange modalities at low overhead.
We implement a proof-of-concept prototype for a distributed file storage market as a use case.
arXiv Detail & Related papers (2024-02-25T14:19:41Z) - SoK: Security of Cross-chain Bridges: Attack Surfaces, Defenses, and Open Problems [43.80265187232706]
Cross-chain bridges are used to facilitate token and data exchanges across blockchains.
Although bridges are becoming increasingly popular, they are still in their infancy and have been attacked multiple times recently.
This paper analyzes the security landscape of cross-chain bridges in a holistic manner.
arXiv Detail & Related papers (2023-12-19T20:13:21Z) - Eden: An Provably Secure, Ultra-Fast, and Fully Decentralized Blockchain Interoperability Protocol [0.7618405693664531]
We introduce Eden, the parallel-verified messaging protocol powering SparkleX.
Eden is an elastic, decentralized envoy network built on a zero-knowledge MapReduce framework.
We explore Eden's design, its robust security model, and the innovative mechanisms that ensure its elasticity and resilience.
arXiv Detail & Related papers (2023-11-29T08:52:07Z) - Bitcoin-Enhanced Proof-of-Stake Security: Possibilities and Impossibilities [45.90740335615872]
Bitcoin is the most secure blockchain in the world, supported by the immense hash power of its Proof-of-Work miners.
Proof-of-Stake chains are energy-efficient, have fast finality but face several security issues.
We show that these security issues are inherent in any PoS chain without an external trusted source.
We propose a new protocol, Babylon, where an off-the-shelf PoS protocol checkpoints onto Bitcoin to resolve these issues.
arXiv Detail & Related papers (2022-07-18T06:01:25Z) - 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) - Regulation conform DLT-operable payment adapter based on trustless -
justified trust combined generalized state channels [77.34726150561087]
Economy of Things (EoT) will be based on software agents running on peer-to-peer trustless networks.
We give an overview of current solutions that differ in their fundamental values and technological possibilities.
We propose to combine the strengths of the crypto based, decentralized trustless elements with established and well regulated means of payment.
arXiv Detail & Related papers (2020-07-03T10:45:55Z)
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.