Sciweavers

1528 search results - page 46 / 306
» On Signatures for Communication Graphs
Sort
View
SIGMETRICS
2009
ACM
122views Hardware» more  SIGMETRICS 2009»
14 years 2 months ago
Botnet spam campaigns can be long lasting: evidence, implications, and analysis
Accurately identifying spam campaigns launched by a large number of bots in a botnet allows for accurate spam campaign signature generation and hence is critical to defeating spam...
Abhinav Pathak, Feng Qian, Y. Charlie Hu, Zhuoqing...
INFOCOM
2007
IEEE
14 years 1 months ago
TriBiCa: Trie Bitmap Content Analyzer for High-Speed Network Intrusion Detection
Abstract—Deep packet inspection (DPI) is often used in network intrusion detection and prevention systems (NIDPS), where incoming packet payloads are compared against known attac...
N. Sertac Artan, H. Jonathan Chao
SCN
2008
Springer
128views Communications» more  SCN 2008»
13 years 7 months ago
On Linear Secret Sharing for Connectivity in Directed Graphs
In this work we study linear secret sharing schemes for s-t connectivity in directed graphs. In such schemes the parties are edges of a complete directed graph, and a set of partie...
Amos Beimel, Anat Paskin
INFOCOM
2011
IEEE
12 years 11 months ago
Approximate distance queries and compact routing in sparse graphs
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...
INFOCOM
2012
IEEE
11 years 10 months ago
Sampling directed graphs with random walks
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...
Bruno F. Ribeiro, Pinghui Wang, Fabricio Murai, Do...