English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 96218/96218 (100%)
造訪人次 : 93571524      線上人數 : 183
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: https://ir.lib.ncu.edu.tw/handle/987654321/110771


    題名: CoBRA: Consensus-Embedded Byzantine-Robust Aggregation for Poisoning-Resilient Multi-Agent Reinforcement Learning in IoT;CoBRA: Consensus-Embedded Byzantine-Robust Aggregation for Poisoning-Resilient Multi-Agent Reinforcement Learning in IoT
    作者: 余昀蓁;CHEN, YU YUN
    貢獻者: 通訊工程學系
    關鍵詞: 區塊鏈;多智能體強化學習;物聯網;投毒攻擊;Byzantine-robust 聚合;共識機制;proof of stake;Blockchain;multi-agent reinforcement learning;Internet of Things;poisoning attack;Byzantine-robust aggregation;consensus mechanism;proof of stake
    日期: 2026-08-17
    上傳時間: 2026-10-20 16:25:01 (UTC+8)
    出版者: 國立中央大學
    摘要: 多智能體強化學習(MARL)正日益廣泛地部署於物聯網(IoT)系統中,而擺脫集中式訓練在可擴展性與隱私上的限制,已推動該領域朝向去中心化的訓練流程發展,在此流程中智能體交換的是模型更新而非原始數據。移除中心節點的同時,也移除了唯一能夠稽核更新的位置,這使得聚合步驟暴露於模型投毒攻擊之下。MARL 讓這個暴露面格外難以封閉,因為非平穩的探索過程本身就會產生變異程度極高的誠實更新,而校準於靜態聯邦學習情境的傳統 Byzantine-robust 規則,會將這種變異誤判為惡意行為。

    我們提出 CoBRA,一個共識內嵌、具 MARL 感知能力的防禦機制,它依據方向與密度而非幅度來篩選更新,並將此篩選機制內嵌為 Practical Byzantine Fault Tolerance(PBFT)區塊提交的前提條件,同時搭配 Verifiable Random Function(VRF)委員會複驗與 stake 自淨化迴圈。CoBRA 並非針對單一攻擊而設計,而是在幅度可容許的共謀對手這一類別上進行分析——這個類別是由任何攻擊者若要躲過距離篩選、同時仍能使聚合結果產生偏誤所必須具備的條件所定義,而非由我們自行建構。我們證明在此類別內,可達成的偏誤程度是單一量——惡意擾動的相干性——的單調函數,而 CoBRA 篩選的正是這個量,因此對手不是因為協同一致而被偵測,就是因為失去相干性而被稀釋。

    為了在此保證的最緊繃處進行壓力測試,我們同時提出 Adaptive Normalized Attack(ANA),即該類別中的極值實例,在此攻擊中每個惡意智能體各自獨立地將自身的偵測邊界飽和,因而消除了先前共用步長攻擊所具有的短板瓶頸。在以 QMIX 建構的合作型 Predator-Prey 基準測試中,CoBRA 在惡意比例為 25 百分比時保留約 87 百分比的無攻擊 return,在 50 百分比時保留約 86 百分比,在 25 百分比時分別勝過 BlockDFL 20.1 個百分比、勝過 Biscotti 18.1 個百分比,並且在取自投毒攻擊文獻的八個額外攻擊組成的一系列測試中,維持接近無攻擊基準的表現,其中包含兩個分析事先預測它不需要攔截的攻擊。值得注意的是,一旦惡意比例達到 25 百分比,兩個區塊鏈 baseline 都會低於無防禦系統,因為它們固定的門檻會丟棄誠實的探索行為。;Multi-agent reinforcement learning (MARL) is increasingly deployed across Internet of Things (IoT) systems, and escaping the scalability and privacy limits of centralized training has pushed the field toward decentralized pipelines in which agents exchange model updates rather than raw data.
    Removing the central node also removes the only point at which an update could be audited, which exposes the aggregation step to model poisoning.
    MARL makes this exposure uniquely hard to close, because non-stationary exploration produces honest updates with inherently high variance, and classical Byzantine-robust rules calibrated to static federated learning misclassify that variance as malicious.
    We propose CoBRA, a consensus-embedded, MARL-aware defense that screens updates by direction and density rather than magnitude, and that embeds this screening as a precondition for Practical Byzantine Fault Tolerance (PBFT) block commitment with Verifiable Random Function (VRF) committee re-verification and a stake self-purification loop.
    Rather than targeting one attack, CoBRA is analyzed over the class of magnitude-admissible collusive adversaries, a class defined by what any attacker must do to evade a distance screen and still bias the aggregate rather than by any construction of ours.
    We show that within this class the attainable bias is monotone in a single quantity, the coherence of the malicious perturbations, and that CoBRA screens on exactly this quantity, so an adversary either coordinates and is detected or decoheres and is diluted.
    To stress the guarantee at its tight end we also introduce the Adaptive Normalized Attack (ANA), the extremal member of the class, in which each malicious agent independently saturates its own detection boundary and thereby removes the weakest-link bottleneck of prior shared-step attacks.
    On a cooperative Predator-Prey benchmark with QMIX, CoBRA retains about 87 percent of the attack-free return at a 25 percent malicious ratio and about 86 percent at 50 percent, outperforming BlockDFL by 20.1 percent and Biscotti by 18.1 percent at 25 percent, and it retains near-baseline performance across a battery of eight further attacks drawn from the poisoning literature, including two that the analysis predicts in advance it will not need to intercept.
    Notably, both blockchain baselines fall below an undefended system once the malicious ratio reaches 25 percent, because their fixed thresholds discard honest exploration.
    顯示於類別:[通訊工程研究所] 博碩士論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML3檢視/開啟


    在NCUIR中所有的資料項目都受到原著作權保護.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明