Sciweavers

1028 search results - page 56 / 206
» Using Attack Graphs to Design Systems
Sort
View
IPPS
1998
IEEE
14 years 2 months ago
Measuring the Vulnerability of Interconnection Networks in Embedded Systems
Studies of the fault-tolerance of graphs have tended to largely concentrate on classical graph connectivity. This measure is very basic, and conveys very little information for des...
Vijay Lakamraju, Zahava Koren, Israel Koren, C. Ma...
SENSYS
2005
ACM
14 years 3 months ago
TSAR: a two tier sensor storage architecture using interval skip graphs
Archival storage of sensor data is necessary for applications that query, mine, and analyze such data for interesting features and trends. We argue that existing storage systems a...
Peter Desnoyers, Deepak Ganesan, Prashant J. Sheno...
SP
2003
IEEE
155views Security Privacy» more  SP 2003»
14 years 3 months ago
Mixminion: Design of a Type III Anonymous Remailer Protocol
We present Mixminion, a message-based anonymous remailer protocol with secure single-use reply blocks. Mix nodes cannot distinguish Mixminion forward messages from reply messages,...
George Danezis, Roger Dingledine, Nick Mathewson
ICC
2007
IEEE
116views Communications» more  ICC 2007»
14 years 4 months ago
Skip Tree Graph: a Distributed and Balanced Search Tree for Peer-to-Peer Networks
Abstract—Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It...
Alejandra González Beltrán, Paul Sag...
ICCAD
1999
IEEE
99views Hardware» more  ICCAD 1999»
14 years 2 months ago
FunState - an internal design representation for codesign
In this paper, an internal design model called FunState (functions driven by state machines) is presented that enables the representation of different types of system components a...
Lothar Thiele, Karsten Strehl, Dirk Ziegenbein, Ro...