Sciweavers

1278 search results - page 163 / 256
» Attack Graph Based Evaluation of Network Security
Sort
View
TCC
2009
Springer
169views Cryptology» more  TCC 2009»
16 years 4 months ago
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
James Cook, Omid Etesami, Rachel Miller, Luca Trev...
ICML
2007
IEEE
16 years 4 months ago
Graph clustering with network structure indices
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
Matthew J. Rattigan, Marc Maier, David Jensen
123
Voted
WPES
2003
ACM
15 years 8 months ago
Reusable anonymous return channels
Mix networks are used to deliver messages anonymously to recipients, but do not straightforwardly allow the recipient of an anonymous message to reply to its sender. Yet the abili...
Philippe Golle, Markus Jakobsson
COMPUTER
2004
80views more  COMPUTER 2004»
15 years 3 months ago
Radiation Detection with Distributed Sensor Networks
Given the heightened awareness and response to threats posed to national security, it is important to evaluate, and if possible, improve current measures being taken to ensure our...
Sean M. Brennan, Angela M. Mielke, David C. Torney...
146
Voted
WISTP
2010
Springer
15 years 10 months ago
A Probabilistic Diffusion Scheme for Anomaly Detection on Smartphones
Widespread use and general purpose computing capabilities of next generation smartphones make them the next big targets of malicious software (malware) and security attacks. Given ...
Tansu Alpcan, Christian Bauckhage, Aubrey-Derrick ...