Sciweavers

1028 search results - page 42 / 103
» Using Attack Graphs to Design Systems
Sort
View
147 views 133 votes 14 years 11 months ago  IJIPT 2010»
: The Address Resolution Protocol (ARP) has proven to work well under regular circumstances, but it was not designed to cope with malicious hosts. By performing ARP spoofing attack...
124 views 140 votes 16 years 2 months ago  SIGSOFT 2003»
Writes via unchecked pointer dereferences rank high among vulnerabilities most often exploited by malicious code. The most common attacks use an unchecked string copy to cause a b...
246 views 197 votes 14 years 4 months ago  ICITS 2011»
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements...
198 views 79 votes 15 years 5 months ago  IV 1999»
Java3D is an application-centred approach to building 3D worlds. We use Java3D and VRML to design a prototype WWW-based 3D Hotel Browsing system. A Java3D scene graph viewer was i...
192 views 103 votes 16 years 2 months ago  WWW 2008»
We propose a hybridization of collaborative filtering and content based recommendation system. Attributes used for content based recommendations are assigned weights depending on ...
201 views 122 votes 14 years 11 months ago  USS 2010»
Idle port scanning uses side-channel attacks to bounce scans off of a "zombie" host to stealthily scan a victim IP address and determine if a port is open or closed, or ...
171 views 103 votes 15 years 5 months ago  FC 2010»
A key way in which banks mitigate the effects of phishing is to remove fraudulent websites or suspend abusive domain names. This ‘take-down’ is often subcontracted to special...
151 views 113 votes 15 years 7 months ago  WETICE 2007»
Intrusion Prevention Systems (IPSs) have long been proposed as a defense against attacks that propagate too fast for any manual response to be useful. In an important class of IPS...
113 views 97 votes 15 years 2 months ago  GG 2008»
Abstract Synchronising Graphs is a system of parallel graph transformation designed for modeling process interaction in a network environment. We propose a theory of context-free s...
152 views 123 votes 15 years 3 months ago  CCS 2008»
Harvard architecture CPU design is common in the embedded world. Examples of Harvard-based architecture devices are the Mica family of wireless sensors. Mica motes have limited me...