Incentive Mechanism Design for Privacy-Preserving Decentralized Blockchain Relayers

• URL: http://arxiv.org/abs/2601.06699v2
• Date: Fri, 16 Jan 2026 15:02:53 GMT
• Title: Incentive Mechanism Design for Privacy-Preserving Decentralized Blockchain Relayers
• Authors: Boutaina Jebari, Khalil Ibrahimi, Hamidou Tembine, Mounir Ghogho,
• Abstract summary: This paper proposes a decentralized relayer architecture that enhances privacy and reliability through game-theoretic incentive design.<n>We show that even with high transaction costs, the system maintains reliability with an outage probability below 0.05.
• Score: 10.62693979845317
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Public blockchains, though renowned for their transparency and immutability, suffer from significant privacy concerns. Network-level analysis and long-term observation of publicly available transactions can often be used to infer user identities. To mitigate this, several blockchain applications rely on relayers, which serve as intermediary nodes between users and smart contracts deployed on the blockchain. However, dependence on a single relayer not only creates a single point of failure but also introduces exploitable vulnerabilities that weaken the system's privacy guarantees. This paper proposes a decentralized relayer architecture that enhances privacy and reliability through game-theoretic incentive design. We model the interaction among relayers as a non-cooperative game and design an incentive mechanism in which probabilistic uploading emerges as a unique mixed Nash equilibrium. Using evolutionary game analysis, we demonstrate the equilibrium's stability against perturbations and coordinated deviations. Through numerical evaluations, we analyze how equilibrium strategies and system behavior evolve with key parameters such as the number of relayers, upload costs, rewards, and penalties. In particular, we show that even with high transaction costs, the system maintains reliability with an outage probability below 0.05 . Furthermore, our results highlight a fundamental trade-off between privacy, reliability, robustness, and cost in decentralized relayer systems.

Related papers

• Private and Robust Contribution Evaluation in Federated Learning [44.1965210509968]
  Cross-silo federated learning allows multiple organizations to collaboratively train machine learning models without sharing raw data.<n>Secure aggregation protects privacy by hiding individual updates, yet it complicates contribution evaluation.<n>We introduce two marginal-difference contribution scores compatible with secure aggregation.
  arXiv  Detail & Related papers  (2026-02-25T09:27:40Z)
• 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)
• zScore: A Universal Decentralised Reputation System for the Blockchain Economy [0.8246494848934447]
  We provide a robust framework titled zScore, a core primitive for reputation derived from a wallet's onchain behaviour.<n>The initial results tested on retroactive data from lending protocols establish a strong correlation between a good zScore and healthy borrowing and repayment behaviour.<n>We present a list of possible applications of our system in Section 5, thereby establishing its utility in rewarding actual value creation.
  arXiv  Detail & Related papers  (2025-02-17T07:19:04Z)
• A Game-Theoretic Approach to the Study of Blockchain's Robustness [0.0]
  This thesis investigates the robustness of blockchain protocols, specifically focusing on Proof-of-Stake.<n>We define robustness in terms of two critical properties: Safety, which ensures that the blockchain will not have permanent conflicting blocks, and Liveness, which guarantees the continuous addition of new reliable blocks.<n>Our research addresses the gap between traditional distributed systems approaches, which classify agents as either honest or Byzantine (i.e. malicious or faulty), and game-theoretic models that consider rational agents driven by incentives.
  arXiv  Detail & Related papers  (2024-11-28T14:29:14Z)
• SPOQchain: Platform for Secure, Scalable, and Privacy-Preserving Supply Chain Tracing and Counterfeit Protection [46.68279506084277]
  This work proposes SPOQchain, a novel blockchain-based platform that provides comprehensive traceability and originality verification. It provides an analysis of privacy and security aspects, demonstrating the need and qualification of SPOQchain for the future of supply chain tracing.
  arXiv  Detail & Related papers  (2024-08-30T07:15:43Z)
• It Takes Two: A Peer-Prediction Solution for Blockchain Verifier's Dilemma [12.663727952216476]
  We develop a Byzantine-robust peer prediction framework towards the design of one-phase Bayesian truthful mechanisms for the decentralized verification games.<n>Our study provides a framework of incentive design for decentralized verification protocols that enhances the security and robustness of the blockchain, decentralized AI, and potentially other decentralized systems.
  arXiv  Detail & Related papers  (2024-06-03T21:21:17Z)
• 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)
• 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)
• Generative AI-enabled Blockchain Networks: Fundamentals, Applications, and Case Study [73.87110604150315]
  Generative Artificial Intelligence (GAI) has emerged as a promising solution to address challenges of blockchain technology. In this paper, we first introduce GAI techniques, outline their applications, and discuss existing solutions for integrating GAI into blockchains.
  arXiv  Detail & Related papers  (2024-01-28T10:46:17Z)
• 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)
• Defending Against Poisoning Attacks in Federated Learning with Blockchain [12.840821573271999]
  We propose a secure and reliable federated learning system based on blockchain and distributed ledger technology. Our system incorporates a peer-to-peer voting mechanism and a reward-and-slash mechanism, which are powered by on-chain smart contracts, to detect and deter malicious behaviors.
  arXiv  Detail & Related papers  (2023-07-02T11:23:33Z)
• Breaking the Communication-Privacy-Accuracy Tradeoff with $f$-Differential Privacy [51.11280118806893]
  We consider a federated data analytics problem in which a server coordinates the collaborative data analysis of multiple users with privacy concerns and limited communication capability. We study the local differential privacy guarantees of discrete-valued mechanisms with finite output space through the lens of $f$-differential privacy (DP) More specifically, we advance the existing literature by deriving tight $f$-DP guarantees for a variety of discrete-valued mechanisms.
  arXiv  Detail & Related papers  (2023-02-19T16:58:53Z)

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.