RouTEE: A Secure Payment Network Routing Hub using Trusted Execution Environments

• URL: http://arxiv.org/abs/2012.04254v2
• Date: Mon, 24 Mar 2025 05:45:36 GMT
• Title: RouTEE: A Secure Payment Network Routing Hub using Trusted Execution Environments
• Authors: Junmo Lee, Seongjun Kim, Sanghyeon Park, Soo-Mook Moon,
• Abstract summary: RouTEE is a secure payment routing hub that is fully feasible without the hub's deposit.<n>Unlike existing payment networks, RouTEE provides high balance liquidity.<n>Details about payments are concealed from hosts by leveraging trusted execution environments.
• Score: 2.302414737400893
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Cryptocurrencies such as Bitcoin and Ethereum have made payment transactions possible without a trusted third party, but they have a scalability issue due to their consensus mechanisms. Payment networks have emerged to overcome this limitation by executing transactions outside of the blockchain, which is why these are referred to as off-chain transactions. In order to establish a payment channel between two users, the users lock their deposits in the blockchain, and then they can pay each other through the channel. Furthermore, payment networks support multi-hop payments that allow users to transfer their balances to other users who are connected to them via multiple channels. However, multi-hop payments are hard to be accomplished, as they are heavily dependent on routing users on a payment path from a sender to a receiver. Although routing hubs can make multi-hop payments more practical and efficient, they need a lot of collateral locked for a long period and have privacy issues in terms of payment history. We propose RouTEE, a secure payment routing hub that is fully feasible without the hub's deposit. Unlike existing payment networks, RouTEE provides high balance liquidity, and details about payments are concealed from hosts by leveraging trusted execution environments (TEEs). RouTEE is designed to make rational hosts behave honestly, by introducing a new routing fee scheme and a secure settlement method. Moreover, users do not need to monitor the blockchain in real-time or run full nodes. They can participate in RouTEE by simply verifying block headers through light clients; furthermore, having only one channel with RouTEE is sufficient to interact with other users. Our implementation demonstrates that RouTEE is highly efficient and outperforms Lightning Network that is the state-of-the-art payment network.

Related papers

• Time Tells All: Deanonymization of Blockchain RPC Users with Zero Transaction Fee (Extended Version) [29.846192259039455]
  We propose a novel deanonymization attack that can link an IP address of a RPC user to this user's blockchain pseudonym.<n>By monitoring network traffic and analyzing public ledgers, the attacker can link the IP address of the TCP packet to the pseudonym of the transaction initiator.<n>Our attack achieves a high success rate of over 95% against normal RPC users on various blockchain networks.
  arXiv  Detail & Related papers  (2025-08-29T09:08:16Z)
• Trusted Routing for Blockchain-Empowered UAV Networks via Multi-Agent Deep Reinforcement Learning [29.81764349753088]
  In UAV networks, routing is vulnerable to malicious damage due to distributed topologies and high dynamics.<n>We formulate the routing problem to minimize the total delay, which is an integer linear programming and intractable to solve.<n>To tackle the network security issue, a blockchain-based trust management mechanism (BTMM) is designed to dynamically evaluate trust values and identify low-trust UAVs.
  arXiv  Detail & Related papers  (2025-07-31T13:00:10Z)
• Epass: Efficient and Privacy-Preserving Asynchronous Payment on Blockchain [39.093148638790346]
  Buy Now Pay Later (BNPL) is a rapidly proliferating e-commerce model, offering consumers to get the product immediately and defer payments.<n>Emerging blockchain technologies endow BNPL platforms with digital currency transactions, allowing BNPL platforms to integrate with digital wallets.<n>However, the transparency of transactions causes critical privacy concerns because malicious participants may derive consumers' financial statuses from on-chain asynchronous payments.
  arXiv  Detail & Related papers  (2025-06-11T04:32:54Z)
• Depermissioning Web3: a Permissionless Accountable RPC Protocol for Blockchain Networks [0.05524804393257919]
  In blockchain networks, so-called "full nodes" serve data to and relay transactions from clients through an RPC interface.<n>This serving layer enables integration of "Web3" data, stored on blockchains, with "Web2" mobile or web applications that cannot directly participate as peers in a blockchain network.<n>We propose a Permissionless Accountable RPC Protocol (PARP) to address privacy, integrity, and availability of data access concerns.
  arXiv  Detail & Related papers  (2025-06-04T13:31:32Z)
• Taming Double-Spending in Offline Payments with Reputation-Weighted Loan Networks [0.6749750044497732]
  Overdraft is a novel offline payment system that shifts the reliance from hardware to users themselves. Overdraft allows potential payment receivers to assess the likelihood of being paid, allowing them to accept transactions with confidence. Users commit their transactions to the blockchain with any conflicts being resolved deterministically.
  arXiv  Detail & Related papers  (2025-04-07T14:48:19Z)
• BrokerChain: A Blockchain Sharding Protocol by Exploiting Broker Accounts [30.62752646978089]
  We propose BrokerChain, a cross-shard protocol dedicated to account-based state sharding.<n>We show that BrokerChain outperforms other baselines in terms of transaction throughput, transaction confirmation latency, the queue size of the transaction pool, and workload balance.
  arXiv  Detail & Related papers  (2024-12-10T05:41:59Z)
• BlockFound: Customized blockchain foundation model for anomaly detection [47.04595143348698]
  BlockFound is a customized foundation model for anomaly blockchain transaction detection. We introduce a series of customized designs to model the unique data structure of blockchain transactions. BlockFound is the only method that successfully detects anomalous transactions on Solana with high accuracy.
  arXiv  Detail & Related papers  (2024-10-05T05:11:34Z)
• CONNECTOR: Enhancing the Traceability of Decentralized Bridge Applications via Automatic Cross-chain Transaction Association [23.89344998976908]
  Cross-chain transaction association identifies and matches unique transactions executed by bridge DApps.<n>We present CONNECTOR, an automated cross-chain transaction association analysis method based on bridge smart contracts.<n>We conduct real-world experiments on different types of bridges to demonstrate the effectiveness of CONNECTOR.
  arXiv  Detail & Related papers  (2024-09-08T00:52:06Z)
• Flashback: Enhancing Proposer-Builder Design with Future-Block Auctions in Proof-of-Stake Ethereum [27.386337024680245]
  Auction mechanisms used between searchers, builders and proposers are crucial to the overall health of the blockchain. In this paper, we consider PBS design in as a game between searchers, builders and proposers. A key novelty in our design is the inclusion of future block proposers, as all proposers of an epoch are decided ahead of time in proof-of-stake (PoS) Our analysis shows the existence of alternative auction mechanisms that result in a better equilibrium to players compared to state-of-the-art.
  arXiv  Detail & Related papers  (2024-05-15T15:58:21Z)
• VORTEX: Real-Time Off-Chain Payments and Cross-Chain Swaps for Cryptocurrencies [14.203351200435575]
  We present VERTEX, a TEE-based layer-2 solution that tackles two crucial challenges in the realm of cryptocurrencies. It allows a payer to make direct payments to anyone without requiring any on-chain relationship or intermediary channels. It is the first known solution that enables real-time cross-chain swaps without relying on a central server.
  arXiv  Detail & Related papers  (2024-03-22T13:21:09Z)
• Graph Attention Network-based Block Propagation with Optimal AoI and Reputation in Web 3.0 [59.94605620983965]
  We design a Graph Attention Network (GAT)-based reliable block propagation optimization framework for blockchain-enabled Web 3.0. To achieve the reliability of block propagation, we introduce a reputation mechanism based on the subjective logic model. Considering that the GAT possesses the excellent ability to process graph-structured data, we utilize the GAT with reinforcement learning to obtain the optimal block propagation trajectory.
  arXiv  Detail & Related papers  (2024-03-20T01:58:38Z)
• Transaction Capacity, Security and Latency in Blockchains [35.16231062731263]
  We analyze how secure a block is after the block becomes k-deep, i.e., security-latency, for Nakamoto consensus. We compare our results for Nakamoto consensus under bounded network delay models and obtain analogous bounds for safety violation threshold.
  arXiv  Detail & Related papers  (2024-02-15T17:43:13Z)
• Optimizing Closed Payment Networks on the Lightning Network: Dual Central Node Approach [0.0]
  The Lightning Network, known for its millisecond settlement speeds and low transaction fees, offers a compelling alternative to traditional payment processors. This is particularly significant for the unbanked population, which lacks access to standard financial services. Our research targets businesses looking to shift their client to client payment processes, such as B2B invoicing, remittances, and cross-border transactions, to the Lightning Network.
  arXiv  Detail & Related papers  (2023-12-06T21:35:19Z)
• RACED: Routing in Payment Channel Networks Using Distributed Hash Tables [0.9558392439655012]
  Off-chain financial mechanisms such as payment channel networks (PCNs) help users process transactions of varying amounts, including micro-payment transactions, without writing each transaction to the blockchain. We propose RACED, a routing protocol that leverages the idea of Distributed Hash Tables (DHTs) to route transactions in PCNs in a fast and secure way. Our experiments on real-world transaction datasets show that RACED gives an average transaction success ratio of 98.74%, an average pathfinding time of 31.242 seconds, which is $1.65*103$, $1.8*103$, and $4
  arXiv  Detail & Related papers  (2023-11-29T14:31:15Z)
• A Novel Approach for Invoice Management using Blockchain [0.0]
  Using a blockchain-based invoicing system will enable smooth payments from a customer's digital wallet to a business's digital wallet. Transactions are simple to track and monitor, and the blockchain may be used to retrieve an exchange's full history. Technology can revolutionize the invoicing and payment process by providing a secure, transparent and tamper-proof system.
  arXiv  Detail & Related papers  (2023-09-06T18:26:40Z)
• Optimizing Virtual Payment Channel Establishment in the Face of On-Path Adversaries [26.409701991849506]
  We present an integer linear program (ILP) to compute the globally optimal VC setup strategy in terms of transaction costs, security, and privacy. Our results confirm on real-world data that our greedy strategy minimizes costs while protecting against security and privacy threats of on-path adversaries.
  arXiv  Detail & Related papers  (2020-11-29T11:24:02Z)
• 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.