Sciweavers

5476 search results - page 1052 / 1096
» Resettably Secure Computation
Sort
View
131
Voted
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
15 years 10 months ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim
148
Voted
VIZSEC
2007
Springer
15 years 10 months ago
An Interactive Attack Graph Cascade and Reachability Display
Abstract Attack graphs for large enterprise networks improve security by revealing critical paths used by adversaries to capture network assets. Even with simplification, current a...
Leevar Williams, Richard Lippmann, Kyle Ingols
161
Voted
BROADNETS
2006
IEEE
15 years 9 months ago
SeeMote: In-Situ Visualization and Logging Device for Wireless Sensor Networks
In this paper we address three challenges that are present when building and analyzing wireless sensor networks (WSN) as part of ubiquitous computing environment: the need for an ...
Leo Selavo, Gang Zhou, John A. Stankovic
137
Voted
ICNP
2006
IEEE
15 years 9 months ago
High Speed Pattern Matching for Network IDS/IPS
— The phenomenal growth of the Internet in the last decade and society’s increasing dependence on it has brought along, a flood of security attacks on the networking and compu...
Mansoor Alicherry, Muthusrinivasan Muthuprasanna, ...
130
Voted
IPPS
2006
IEEE
15 years 9 months ago
k-anycast routing schemes for mobile ad hoc networks
— Anycast is a communication paradigm that was first introduced to the suit of routing protocols in IPv6 networks. In anycast, a packet is intended to be delivered to one of the...
Bing Wu, Jie Wu
« Prev « First page 1052 / 1096 Last » Next »