A Moving Target DDoS Defense Approach in Consortium Blockchain

被引:0
作者
Gai, Keke [1 ]
Zhang, Guolei [2 ]
Jiang, Peng [1 ]
Zhu, Liehuang [1 ]
Choo, Kim-Kwang Raymond [3 ,4 ]
机构
[1] Beijing Inst Technol, Sch Cyberspace Sci & Technol, Beijing 100081, Peoples R China
[2] Beijing Inst Technol, Sch Comp Sci & Technol, Beijing 100081, Peoples R China
[3] Univ Texas San Antonio, Dept Informat Syst & Cyber Secur, San Antonio, TX 78249 USA
[4] Univ Texas San Antonio, Dept Elect & Comp Engn, San Antonio, TX 78249 USA
基金
中国国家自然科学基金;
关键词
Blockchains; Computer crime; Organizations; Denial-of-service attack; Peer-to-peer computing; Costs; Collaboration; Floods; Synchronization; Smart contracts; Consortium blockchain; DDoS; moving target defense; deep Q-network; FRAMEWORK;
D O I
10.1109/TDSC.2025.3546625
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Although consortium blockchain has an identification mechanism, the captured internal clients are potentially threatening internal blockchain nodes. Internal Distributed Denial-of-Service (DDoS) attacks threaten the specific nodes in consortium blockchain, e.g., the executor, consensus, and committer nodes. Typical attack methods may include SYN Flooding and ACK Flooding and deny normal transaction service by sending many invalid transactions and blocks. In this work, we have proposed an organization collaboration-based DDoS defense approach and a Deep Q-learning (DQN)-based Moving Target Defense (MTD) for changing attack surface of victims in consortium blockchain. On one hand, contracts are used to synchronize attack information obtained from organizations, e.g., bots' IP addresses and public keys. On the other hand, we have developed a DQN-based MTD defense mechanism for organizations to change the attack surface of victims in order to mitigate the malicious traffic, in the case of missing detections of bots. Our approach applies a multi-stage game to reflect interactions between attackers and defenders. The evaluation results have demonstrated that our approach could effectively mitigate DDoS attacks in consortium blockchain.
引用
收藏
页码:4362 / 4378
页数:17
相关论文
共 51 条
[1]  
Alcorn W., 2012, HULK (HTTP Unbearable Load King)
[2]   Prime: Byzantine Replication under Attack [J].
Amir, Yair ;
Coan, Brian ;
Kirsch, Jonathan ;
Lane, John .
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2011, 8 (04) :564-577
[3]   Hyperledger Fabric: A Distributed Operating System for Permissioned Blockchains [J].
Androulaki, Elli ;
Barger, Artem ;
Bortnikov, Vita ;
Cachin, Christian ;
Christidis, Konstantinos ;
De Caro, Angelo ;
Enyeart, David ;
Ferris, Christopher ;
Laventman, Gennady ;
Manevich, Yacov ;
Muralidharan, Srinivasan ;
Murthy, Chet ;
Binh Nguyen ;
Sethi, Manish ;
Singh, Gari ;
Smith, Keith ;
Sorniotti, Alessandro ;
Stathakopoulou, Chrysoula ;
Vukolic, Marko ;
Cocco, Sharon Weed ;
Yellick, Jason .
EUROSYS '18: PROCEEDINGS OF THE THIRTEENTH EUROSYS CONFERENCE, 2018,
[4]   A Rational Protocol Treatment of 51% Attacks [J].
Badertscher, Christian ;
Lu, Yun ;
Zikas, Vassals .
ADVANCES IN CRYPTOLOGY - CRYPTO 2021, PT III, 2021, 12827 :3-32
[5]   Stressing Out: Bitcoin "Stress Testing" [J].
Baqer, Khaled ;
Huang, Danny Yuxing ;
McCoy, Damon ;
Weaver, Nicholas .
FINANCIAL CRYPTOGRAPHY AND DATA SECURITY, FC 2016, 2016, 9604 :3-18
[6]  
Bonneau J., 2018, ser. Lecture Notes in Computer Science, V10958, P92
[7]   Why Buy When You Can Rent? Bribery Attacks on Bitcoin-Style Consensus [J].
Bonneau, Joseph .
FINANCIAL CRYPTOGRAPHY AND DATA SECURITY, FC 2016, 2016, 9604 :19-26
[8]  
Bremler-Barr Anat, 2017, IEEE INFOCOM
[9]   DDoS Defense for IoT: A Stackelberg Game Model-Enabled Collaborative Framework [J].
Chen, Xu ;
Xiao, Liang ;
Feng, Wei ;
Ge, Ning ;
Wang, Xianbin .
IEEE INTERNET OF THINGS JOURNAL, 2022, 9 (12) :9659-9674
[10]   Frequency-Minimal Utility-Maximal Moving Target Defense Against DDoS in SDN-Based Systems [J].
Debroy, Saptarshi ;
Calyam, Prasad ;
Minh Nguyen ;
Neupane, Roshan Lal ;
Mukherjee, Bidyut ;
Eeralla, Ajay Kumar ;
Salah, Khaled .
IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2020, 17 (02) :890-903