首页 | 本学科首页   官方微博 | 高级检索  
     

一种抵御拒绝服务攻击的自适应客户端难题
引用本文:陈瑞川,郭文嘉,唐礼勇,陈钟.一种抵御拒绝服务攻击的自适应客户端难题[J].软件学报,2009,20(9):2558-2573.
作者姓名:陈瑞川  郭文嘉  唐礼勇  陈钟
作者单位:北京大学,信息科学技术学院,软件研究所,北京,100871;高可信软件技术教育部重点实验室,北京大学,北京,100871
摘    要:研究传统的客户端难题方案,之后提出一种自适应客户端难题方案.该方案采用一种轻量级的协议交互方式来获取客户端和服务器双方的实时状态信息,并据此自适应地调整客户端难题的难度.为了评估该方案的适用性,结合传统和自适应两种客户端难题方案,在对等(P2P)网络中提出了一种抵御DoS攻击的自适应安全框架.理论分析和实验结果表明,甚至在高度恶意的网络环境中,自适应客户端难题方案都可以在不明显影响合法客户端性能的前提下有效地抵御各种DoS攻击.

关 键 词:拒绝服务攻击  客户端难题  对等网络
收稿时间:2008/2/20 0:00:00
修稿时间:2008/12/10 0:00:00

Adaptive Client Puzzle Scheme Against Denial-of-Service Attacks
CHEN Rui-Chuan,GUO Wen-Ji,TANG Li-Yong and CHEN Zhong.Adaptive Client Puzzle Scheme Against Denial-of-Service Attacks[J].Journal of Software,2009,20(9):2558-2573.
Authors:CHEN Rui-Chuan  GUO Wen-Ji  TANG Li-Yong and CHEN Zhong
Abstract:This paper studies the traditional client puzzle scheme and proposes an adaptive scheme which performs a lightweight client-server interaction to flexibly adjust the puzzle difficulty according to the real-time statuses of both client and server. To evaluate the applicability, the authors combine the two schemes and develop an adaptive DoS-resistant security framework for Peer-to-Peer networks. The theoretical analyses and experimental results show that the adaptive client puzzle scheme can effectively defend against various DoS attacks without significantly influencing legitimate clients' experiences even in a highly malicious environment.
Keywords:denial-of-service attack  client puzzle  peer-to-peer network
本文献已被 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号