Sciweavers

92 search results - page 16 / 19
» Detecting Unknown Worms Using Randomness Check
Sort
View
ALMOB
2006
155views more  ALMOB 2006»
13 years 7 months ago
Refining motifs by improving information content scores using neighborhood profile search
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
Chandan K. Reddy, Yao-Chung Weng, Hsiao-Dong Chian...
INFOCOM
2009
IEEE
14 years 2 months ago
Null Keys: Limiting Malicious Attacks Via Null Space Properties of Network Coding
—The performance of randomized network coding can suffer significantly when malicious nodes corrupt the content of the exchanged blocks. Previous work have introduced error corr...
Elias Kehdi, Baochun Li
ICCCN
2007
IEEE
14 years 1 months ago
A Proactive Test Based Differentiation Technique to Mitigate Low Rate DoS Attacks
— Low rate DoS attacks are emerging threats to the TCP traffic, and the VoIP traffic in the Internet. They are hard to detect as they intelligently send attack traffic inside the...
Amey Shevtekar, Nirwan Ansari
ACMSE
2006
ACM
14 years 1 months ago
Static analysis of anomalies and security vulnerabilities in executable files
Software researchers have already developed static code security checkers to parse through and scan source code files, looking for security vulnerabilities [8, 9]. What about exec...
Jay-Evan J. Tevis, John A. Hamilton Jr.
CCS
2006
ACM
13 years 11 months ago
EXE: automatically generating inputs of death
This paper presents EXE, an effective bug-finding tool that automatically generates inputs that crash real code. Instead of running code on manually or randomly constructed input,...
Cristian Cadar, Vijay Ganesh, Peter M. Pawlowski, ...