Taming Double-Spending in Offline Payments with Reputation-Weighted Loan Networks

• URL: http://arxiv.org/abs/2504.05143v1
• Date: Mon, 07 Apr 2025 14:48:19 GMT
• Title: Taming Double-Spending in Offline Payments with Reputation-Weighted Loan Networks
• Authors: Nektarios Evangelou, Rowdy Chotkan, Bulat Nasrulin, Jérémie Decouchant,
• Abstract summary: Overdraft is a novel offline payment system that shifts the reliance from hardware to users themselves.<n>Overdraft allows potential payment receivers to assess the likelihood of being paid, allowing them to accept transactions with confidence.<n>Users commit their transactions to the blockchain with any conflicts being resolved deterministically.
• Score: 0.6749750044497732
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Blockchain solutions typically assume a synchronous network to ensure consistency and achieve consensus. In contrast, offline transaction systems aim to enable users to agree on and execute transactions without assuming bounded communication delays when interacting with the blockchain. Most existing offline payment schemes depend on trusted hardware wallets that are assumed to be secure and tamper-proof. While this work introduces Overdraft, 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 or deny them. Overdraft achieves this by maintaining a loan network that is weighted by online reputation. This loan network contains time-limited agreements where users pledge to cover another user's payment if necessary. For example, when a payer lacks sufficient funds at the moment of commitment. Offline users rely on the last known view of the loan network -- which they had access to when last online -- to determine whether to participate in an offline transaction. This view is used to estimate the probability of eventual payment, possibly using multiple loans. Once online again, users commit their transactions to the blockchain with any conflicts being resolved deterministically. Overdraft incorporates incentives for users and is designed to be resilient against Sybil attacks. As a proof of concept, we implemented Overdraft as an Ethereum Solidity smart contract and deployed it on the Sepolia testnet to evaluate its performance.

Related papers

• 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)
• Auditable Ledger Snapshot for Non-Repudiable Cross-Blockchain Communication [3.8828296134289544]
  This paper introduces InterSnap, a novel blockchain snapshot archival methodology.<n>InterSnap enables auditability of crossblockchain transactions, enforcing non-repudiation.<n>We establish that InterSnap can recover from malicious attacks while preserving crosschain transaction receipts.
  arXiv  Detail & Related papers  (2025-11-20T17:13:06Z)
• SoK: Preconfirmations [0.4893345190925178]
  This article presents a Systematization of Knowledge (SoK) on preconfirmations.<n>We present the core terms and definitions needed to understand preconfirmations, outline a general framework for preconfirmation protocols, and explore the economics and risks of preconfirmations.
  arXiv  Detail & Related papers  (2025-10-03T12:41:41Z)
• 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)
• 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)
• SoK: Concurrency in Blockchain -- A Systematic Literature Review and the Unveiling of a Misconception [3.462869032423588]
  Concurrency and parallelism are a double-edged sword.<n>While they improve throughput, they also introduce risks like race conditions, non-determinism, and vulnerabilities such as deadlock and livelock.<n>This paper presents the first survey of smart contracts, offering a systematic literature review organized into key dimensions.
  arXiv  Detail & Related papers  (2025-06-02T17:13:03Z)
• 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. 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)
• Zaptos: Towards Optimal Blockchain Latency [52.30047458198369]
  We introduce Zaptos, a parallel pipelined architecture designed to minimize end-to-end latency. Zaptos achieves a throughput of 20,000 transactions per second with sub-second latency.
  arXiv  Detail & Related papers  (2025-01-18T00:22:22Z)
• 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)
• Real-time Cyberattack Detection with Collaborative Learning for Blockchain Networks [29.481124078876032]
  We propose an efficient collaborative cyberattack detection model to protect blockchain networks. Our proposed detection model can detect attacks in the blockchain network with an accuracy of up to 97%.
  arXiv  Detail & Related papers  (2024-07-04T15:39:49Z)
• Offline Digital Euro: a Minimum Viable CBDC using Groth-Sahai proofs [0.0]
  Current digital payment solutions are fragile and offer less privacy than traditional cash. No transaction can be executed during server malfunctions or power outages. This thesis proposes a design and a first implementation for an offline-first digital euro.
  arXiv  Detail & Related papers  (2024-07-01T09:55:14Z)
• Transaction Fee Estimation in the Bitcoin System [11.065598886291735]
  In the Bitcoin system, transaction fees serve as an incentive for blockchain confirmations. In this work, we focus on estimating the transaction fee for a new transaction to help with its confirmation within a given expected time. We propose a framework FENN, which aims to integrate the knowledge from a wide range of sources, including the transaction itself, into a neural network model in order to estimate a proper transaction fee.
  arXiv  Detail & Related papers  (2024-05-24T07:27:00Z)
• 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)
• 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)
• Heuristics for Detecting CoinJoin Transactions on the Bitcoin Blockchain [23.23031523964561]
  This research delves into the intricacies of Bitcoin, a decentralized peer-to-peer network, and its associated blockchain. To address this concern, users have adopted CoinJoin, a method that amalgamates multiple transaction intents into a single, larger transaction. Our exhaustive analysis covers up to block 760,000, offering a comprehensive insight into CoinJoin transactions.
  arXiv  Detail & Related papers  (2023-11-21T10:05:32Z)
• PTTS: Zero-Knowledge Proof-based Private Token Transfer System on Ethereum Blockchain and its Network Flow Based Balance Range Privacy Attack Analysis [0.0]
  We propose a Private Token Transfer System (PTTS) for the public blockchain. For the proposed framework, zero-knowledge based protocol has been designed using Zokrates and integrated into our private token smart contract. In the second part of the paper, we provide security and privacy analysis including the replay attack and the balance range privacy attack.
  arXiv  Detail & Related papers  (2023-08-29T09:13:31Z)
• ACon$^2$: Adaptive Conformal Consensus for Provable Blockchain Oracles [31.439376852065713]
  Power of smart contracts is enabled by interacting with off-chain data, which in turn opens the possibility to undermine the block state consistency. We propose an adaptive conformal consensus (ACon$2$) algorithm, which derives consensus from multiple oracle contracts. In particular, the proposed algorithm returns a consensus set, which quantifies the uncertainty of data and achieves a desired correctness guarantee.
  arXiv  Detail & Related papers  (2022-11-17T04:37:24Z)
• RouTEE: A Secure Payment Network Routing Hub using Trusted Execution Environments [2.302414737400893]
  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.
  arXiv  Detail & Related papers  (2020-12-08T07:34:39Z)
• 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.