Your Trust, Your Terms: A General Paradigm for Near-Instant Cross-Chain Transfer
- URL: http://arxiv.org/abs/2403.15191v4
- Date: Thu, 04 Sep 2025 18:33:14 GMT
- Title: Your Trust, Your Terms: A General Paradigm for Near-Instant Cross-Chain Transfer
- Authors: Di Wu, Jingyu Liu, Xuechao Wang, Jian Liu, Yingjie Xue, Kui Ren, Chun Chen,
- Abstract summary: We introduce the Delegated Ownership Transfer (DOT) paradigm to enable secure, high-performance cross-chain payments.<n>DOT decouples key ownership from value ownership to enable secure, high-performance cross-chain payments.<n>Our prototype shows that cross-chain payments complete in under 16.70 ms and atomic swaps in under 33.09 ms, with costs fully decoupled from Layer-1 gas fees.
- Score: 26.61748905524824
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Cross-chain transactions today remain slow, costly, and fragmented. Existing custodial exchanges expose users to counterparty and centralization risks, while non-custodial liquidity bridges suffer from capital inefficiency and slow settlement; critically, neither approach guarantees users a unilateral path to recover assets if the infrastructure fails. We introduce the Delegated Ownership Transfer (DOT) paradigm, which decouples key ownership from value ownership to enable secure, high-performance cross-chain payments. In DOT, a user deposits funds into a sandboxed on-chain Temporary Account (TA) (value ownership) while delegating its private key (key ownership) to an abstract Trusted Entity (TE). Payments and swaps are thus reframed as near-instant, off-chain ownership handoffs. Security follows from dual guarantees: the TE's exclusive control prevents double-spending, while a pre-signed, unilateral recovery transaction ensures users retain ultimate authority over their assets. Building on this foundation, we design a novel off-chain atomic swap that executes optimistically in near real time and remains fair even if the TE fails. We formalize the security of DOT in the Universal Composability framework and present two concrete instantiations: a high-performance design based on Trusted Execution Environments (TEEs) and a cryptographically robust variant leveraging threshold cryptography. Our geo-distributed prototype shows that cross-chain payments complete in under 16.70 ms and atomic swaps in under 33.09 ms, with costs fully decoupled from Layer-1 gas fees. These results provide a practical blueprint for building secure, efficient, and interoperable cross-chain payment systems.
Related papers
- BlocksecRT-DETR: Decentralized Privacy-Preserving and Token-Efficient Federated Transformer Learning for Secure Real-Time Object Detection in ITS [0.0]
Federated real-time object detection using transformers in Intelligent Transportation Systems (ITS) faces three major challenges.<n>missing-class non-IID data from geographically diverse traffic environments, latency constraints on edge hardware for high-capacity transformer models, and privacy and security risks from untrusted client updates and centralized aggregation.<n>We propose BlockSecRT-DETR, a decentralized, token-efficient, and privacy-preserving federated training solution using RT-DETR transformer.
arXiv Detail & Related papers (2026-01-19T03:29:55Z) - Sedna: Sharding transactions in multiple concurrent proposer blockchains [42.71280924071485]
We present Sedna, a user-facing protocol that replaces naive transaction replication with verifiable, rateless coding.<n>We prove Sedna guarantees liveness and emphuntil-decode privacy, significantly reducing MEV exposure.
arXiv Detail & Related papers (2025-12-18T20:12:55Z) - Proof of Trusted Execution: A Consensus Paradigm for Deterministic Blockchain Finality [0.391985484065646]
We propose Proof of Trusted Execution (PoTE), a consensus paradigm where agreement emerges from verifiable execution rather than replicated re-execution.<n>Because the execution is deterministic and the proposer is uniquely derived from public randomness, PoTE avoids forks, eliminates slot.time bottlenecks, and commits blocks in a single round of verification.
arXiv Detail & Related papers (2025-12-10T08:04:38Z) - Efficient Blockchain-based Steganography via Backcalculating Generative Adversarial Network [105.47203971578871]
We propose a generic blockchain-based steganography framework (GBSF)<n>The sender generates the required fields such as amount and fees, where the additional covert data is embedded to enhance the channel capacity.<n>Based on GBSF, we design a reversible generative adversarial network (R-GAN)<n>We propose R-GAN with Counter-intuitive data preprocessing and Custom activation functions, namely CCR-GAN.
arXiv Detail & Related papers (2025-06-19T04:43:41Z) - Hybrid Stabilization Protocol for Cross-Chain Digital Assets Using Adaptor Signatures and AI-Driven Arbitrage [0.2621730497733947]
Stablecoins face an unresolved trilemma of balancing decentralization, stability, and regulatory compliance.<n>We present a hybrid cryptographic stabilization protocol that combines crypto-collateralized reserves, algorithmic futures contracts, and cross-chain pools.
arXiv Detail & Related papers (2025-06-06T03:14:05Z) - Trusted Compute Units: A Framework for Chained Verifiable Computations [41.94295877935867]
This paper introduces the Trusted Compute Unit (TCU), a unifying framework that enables composable and interoperable computations across heterogeneous technologies.<n>By enabling secure off-chain interactions without incurring on-chain confirmation delays or gas fees, TCUs significantly improve system performance and scalability.
arXiv Detail & Related papers (2025-04-22T09:01:55Z) - Enabling High-Frequency Trading with Near-Instant, Trustless Cross-Chain Transactions via Pre-Signing Adaptor Signatures [0.0]
This white paper will introduce a protocol for atomic swaps that eliminates the need for an intermediary currency or centralized trusted third party.<n>It will reduce transaction times between Bitcoin and swaps to approximately 15 seconds for a market maker.
arXiv Detail & Related papers (2025-03-17T01:15:33Z) - Pandora's Box: Cross-Chain Arbitrages in the Realm of Blockchain Interoperability [6.6477743808876895]
We study two non-atomic cross-chain arbitrage strategies: Sequence-Independent Arbitrage (SIA) and Sequence-Dependent Arbitrage (SDA)
We analyze the effectiveness of these strategies across nine blockchains over a one-year period from September 2023 to August 2024.
These arbitrages generated a lower-bound profit of 9,496,115.28 USD from a total traded volume of 465,797,487.98 USD.
arXiv Detail & Related papers (2025-01-28T23:04:50Z) - Zaptos: Towards Optimal Blockchain Latency [52.30047458198369]
We introduce Zaptos, a parallel pipelined architecture designed to minimize end-to-end latency.<n>Zaptos achieves a throughput of 20,000 transactions per second with sub-second latency.
arXiv Detail & Related papers (2025-01-18T00:22:22Z) - MAP the Blockchain World: A Trustless and Scalable Blockchain Interoperability Protocol for Cross-chain Applications [18.33587076597966]
interoperability protocols enable cross-chain asset transfers or data retrievals between isolated chains.
Existing protocols either face severe scalability issues due to high on-chain and off-chain costs, or suffer from trust concerns because of centralized designs.
We propose textttMAP, a trustless blockchain interoperability protocol that relays cross-chain transactions across heterogeneous chains with high scalability.
arXiv Detail & Related papers (2024-11-01T07:43:11Z) - Cross-Chain Options: A Bridgeless, Universal, and Efficient Approach [3.5562096606353215]
Despite the growing interest in options for blockchain-resident assets, such as cryptocurrencies, current option mechanisms face significant challenges.<n>Our protocol is the first to eliminate the need for holders to post collateral when establishing options in trustless service environments.<n>Its universality allows for cross-chain options involving nearly textitany assets on textitany two different blockchains.<n>Our evaluation demonstrates that the proposed scheme reduces option transfer latency to less than half of that in existing methods.
arXiv Detail & Related papers (2024-10-21T07:43:20Z) - MEV Ecosystem Evolution From Ethereum 1.0 [6.151915040556504]
In traditional finance, there are possibilities to create values, e.g., arbitrage offers to create value from market inefficiencies or front-running offers to extract value for the participants having privileged roles.
Such opportunities are readily available in DeFi ecosystems, where diverse participants engage in financial activities.
In this survey, first, we show how lucrative such opportunities can be. Then, we discuss how protocolfollowing participants trying to capture such opportunities threaten to sabotage blockchain's performance.
Finally, we review the current state of research trying to restore trustlessness and decentralization to provide all DeFi participants with a fair marketplace
arXiv Detail & Related papers (2024-06-19T14:22:26Z) - Fast and Secure Decentralized Optimistic Rollups Using Setchain [1.1534313664323634]
Layer 2 optimistic rollups (L2) are a faster alternative that offer the same interface in terms of smart contract development and user interaction.
We propose a decentralized L2 optimistic rollup based on Setchain, a decentralized Byzantine-tolerant implementation of sets.
arXiv Detail & Related papers (2024-06-04T13:45:12Z) - IT Strategic alignment in the decentralized finance (DeFi): CBDC and digital currencies [49.1574468325115]
Decentralized finance (DeFi) is a disruptive-based financial infrastructure.
This paper seeks to answer two main questions 1) What are the common IT elements in the DeFi?
And 2) How the elements to the IT strategic alignment in DeFi?
arXiv Detail & Related papers (2024-05-17T10:19:20Z) - 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) - Transaction Capacity, Security and Latency in Blockchains [45.776687601070705]
We analyze how secure a block is after the block becomes $k$-deep, i.e., security-latency, for Nakamoto consensus.<n>We connect the security-latency analysis to sustainable transaction rate of the queue system.
arXiv Detail & Related papers (2024-02-15T17:43:13Z) - Model Supply Chain Poisoning: Backdooring Pre-trained Models via Embedding Indistinguishability [61.549465258257115]
We propose a novel and severer backdoor attack, TransTroj, which enables the backdoors embedded in PTMs to efficiently transfer in the model supply chain.<n> Experimental results show that our method significantly outperforms SOTA task-agnostic backdoor attacks.
arXiv Detail & Related papers (2024-01-29T04:35:48Z) - A Scale-out Decentralized Blockchain Ledger System for Web3.0 [5.327844605578174]
This paper proposes EZchain -- a novel decentralized scale-out" ledger system designed for web3.0.
Without compromising security and decentralization, EZchain successfully accomplishes the following milestones.
arXiv Detail & Related papers (2023-12-01T01:34:48Z) - Sui Lutris: A Blockchain Combining Broadcast and Consensus [6.922934367879061]
Sui Lutris is the first smart-contract platform to achieve sub-second finality.
We develop a novel reconfiguration protocol, the first to provably show the safe reconfiguration of a consensusless blockchain.
arXiv Detail & Related papers (2023-10-27T10:40:11Z) - CroCoDai: A Stablecoin for Cross-Chain Commerce [3.5504432743253633]
Decentralized Finance (DeFi) has grown rapidly in value in recent years.
The global DeFi ecosystem is fragmented into multiple blockchains, fueling the demand for cross-chain commerce.
Existing approaches for cross-chain transactions, e.g., bridges and cross-chain deals, achieve atomicity by locking assets in escrow.
We present CroCoDai to address these challenges.
arXiv Detail & Related papers (2023-06-16T10:41:28Z) - Uniswap Liquidity Provision: An Online Learning Approach [49.145538162253594]
Decentralized Exchanges (DEXs) are new types of marketplaces leveraging technology.
One such DEX, Uniswap v3, allows liquidity providers to allocate funds more efficiently by specifying an active price interval for their funds.
This introduces the problem of finding an optimal strategy for choosing price intervals.
We formalize this problem as an online learning problem with non-stochastic rewards.
arXiv Detail & Related papers (2023-02-01T17:21:40Z) - Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback [46.30924494799245]
We develop Ditto, a Byzantine SMR protocol that enjoys the best of both worlds: optimal communication on and off the happy path and progress guarantee under asynchrony and DDoS attacks.
Specifically, we start from HotStuff, a state-of-the-art linear protocol, and gradually build Ditto. As a separate contribution and an intermediate step, we design a 2-chain version of HotStuff, Jolteon.
We implement and experimentally evaluate all our systems. Notably, Jolteon's commit latency outperforms HotStuff by 200-300ms with varying system size.
arXiv Detail & Related papers (2021-06-18T21:34:17Z) - ESCORT: Ethereum Smart COntRacTs Vulnerability Detection using Deep
Neural Network and Transfer Learning [80.85273827468063]
Existing machine learning-based vulnerability detection methods are limited and only inspect whether the smart contract is vulnerable.
We propose ESCORT, the first Deep Neural Network (DNN)-based vulnerability detection framework for smart contracts.
We show that ESCORT achieves an average F1-score of 95% on six vulnerability types and the detection time is 0.02 seconds per contract.
arXiv Detail & Related papers (2021-03-23T15:04:44Z) - 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.