arXiv:2509.11294cs.GTcs.ET2025-09

提出新激励机制防止多个假身份操纵数据源决策

An Incentive-Compatible Reward Sharing Mechanism for Mitigating Mirroring Attacks in Decentralized Data-Feed Systems

  • 设计可防伪身份攻击的奖励分配方法
  • 证明用户最优策略是只运行一个预言机
  • 适合区块链数据提供系统开发者参考

去中心化数据喂送系统通过多个预言机聚合链外信息,以多数投票等聚合函数生成决策,并根据结果向预言机分配共享奖励。然而,现有激励机制易受镜像攻击影响——单个用户操控多个预言机,扭曲聚合结果并最大化收益。本文分析此类攻击对多数投票系统的可靠性影响,证明现有机制会无意激励理性用户实施攻击。为此,提出一种新型激励机制,可确保在纳什均衡下每个用户仅运营一个预言机。文章还讨论了实际部署方案,并通过数值实验验证其有效性。

原文摘要 · Abstract (English)

Decentralized data-feed systems enable blockchain-based smart contracts to access off-chain information by aggregating values from multiple oracles. To improve accuracy, these systems typically use an aggregation function, such as majority voting, to consolidate the inputs they receive from oracles and make a decision. Depending on the final decision and the values reported by the oracles, the participating oracles are compensated through shared rewards. However, such incentive mechanisms are vulnerable to mirroring attacks, where a single user controls multiple oracles to bias the decision of the aggregation function and maximize rewards. This paper analyzes the impact of mirroring attacks on the reliability and dependability of majority voting-based data-feed systems. We demonstrate how existing incentive mechanisms can unintentionally encourage rational users to implement such attacks. To address this, we propose a new incentive mechanism that discourages Sybil behavior. We prove that the proposed mechanism leads to a Nash Equilibrium in which each user operates only one oracle. Finally, we discuss the practical implementation of the proposed incentive mechanism and provide numerical examples to demonstrate its effectiveness.

区块链激励机制预言机安全

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。