A study on worms using search engine to spread (情報通信システムセキュリティ)
スポンサーリンク
概要
- 論文の詳細を見る
Since many web applications leak sensitive pages that can expose their vulnerabilities, worms like Santy locate their targets by searching these pages in search engine with well crafted keywords. We call them search worms. In this paper, we focus on the modeling and containment of these search worms targeting web applications. We first introduce several propagation models to study two unique effect factors on their propagation : eigenpage distribution and page ranking. And then, we propose a containment system for search worms based on honey-page insertion: a small number of fake pages which will induce visitors to pre-established honeypots are randomly inserted into search results, and then infected hosts can be detected and reported to search engines when their malicious scans hit honeypots. We use our propagation models to study the relation between the containment effectiveness and the honey-page insert rate and find this mechanism is extremely effective.
- 2010-03-19
著者
-
HUA Jingyu
Graduate School of Information Science and Electrical Engineering, Kyushu University
-
SAKURAI Kouichi
Graduate School of Information Science and Electrical Engineering, Kyushu University
-
Sakurai Kouichi
Kyushu Univ. Fukuoka Jpn
-
Hua Jingyu
Graduate School Of Information Science And Electrical Engineering Kyushu University
-
Sakurai Kouichi
Graduate School Of Information Science And Electrical Engineering Kyushu University
-
Sakurai Kouichi
Graduate School Of Information And Electrical Engineering Kyushu University
関連論文
- A study on worms using search engine to spread (情報通信システムセキュリティ)
- On Distributed Cryptographic Protocols for Threshold RSA Signing and Decrypting with No Dealer (Special Section on Discrete Mathematics and Its Applications)
- L-032 Integrity for the In-flight Web Page Using Fragile Watermarking
- Toward a Scalable Visualization System for Network Traffic Monitoring
- FOREWORD
- FOREWORD
- Special Section on Cryptography and Information Security
- 1-out-of-L E-voting System with Efficient Computational Complexity Based on r-th Residue Encryption
- A Practical Off-Line Digital Money System with Partially Blind Signatures Based on the Discrete Logarithm Problem(Special Section on Cryptography and Information Security)
- Trends and Security Issues for Contactless Smart Cards
- A Behavior-based Method for Detecting Distributed Scan Attacks in Darknets
- Optimization of Group Key Management Structure with a Client Join-Leave Mechanism
- Fast Implementation of KCipher-2 for Software and Hardware
- Optimization of Group Key Management Structure with a Client Join-Leave Mechanism