Sciweavers

111 search results - page 16 / 23
» Minimum-cost network hardening using attack graphs
Sort
View
INFOCOM
2006
IEEE
14 years 1 months ago
Eclipse Attacks on Overlay Networks: Threats and Defenses
Abstract— Overlay networks are widely used to deploy functionality at edge nodes without changing network routers. Each node in an overlay network maintains connections with a nu...
Atul Singh, Tsuen-Wan Ngan, Peter Druschel, Dan S....
DCOSS
2010
Springer
13 years 11 months ago
Wormholes No More? Localized Wormhole Detection and Prevention in Wireless Networks
A number of protocols have been proposed to date to defend against wormhole attacks in wireless networks by adopting synchronized clocks, positioning devices, or directional antenn...
Tassos Dimitriou, Thanassis Giannetsos
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
14 years 8 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
COMSNETS
2012
222views more  COMSNETS 2012»
12 years 3 months ago
Exploring the design space of social network-based Sybil defenses
—Recently, there has been significant research interest in leveraging social networks to defend against Sybil attacks. While much of this work may appear similar at first glanc...
Bimal Viswanath, Mainack Mondal, Allen Clement, Pe...
TRUST
2009
Springer
14 years 2 months ago
Secure VPNs for Trusted Computing Environments
Abstract. Virtual Private Networks are a popular mechanism for building complex network infrastructures. Such infrastructures are usually accompanied by strict administrative restr...
Steffen Schulz, Ahmad-Reza Sadeghi