Sciweavers

860 search results - page 153 / 172
» Uncovering Attacks on Security Protocols
Sort
View
IPL
2008
72views more  IPL 2008»
13 years 7 months ago
Reducing communication costs in robust peer-to-peer networks
Several recent research results describe how to design Distributed Hash Tables (DHTs) that are robust to adversarial attack via Byzantine faults. Unfortunately, all of these resul...
Jared Saia, Maxwell Young
ICDCS
2008
IEEE
14 years 1 months ago
Analysis of Maximum Executable Length for Detecting Text-Based Malware
The possibility of using purely text stream (keyboardenterable) as carrier of malware is under-researched and often underestimated. A text attack can happen at multiple levels, fr...
P. Kumar Manna, Sanjay Ranka, Shigang Chen
IWIA
2005
IEEE
14 years 27 days ago
A General Cooperative Intrusion Detection Architecture for MANETs
1 Intrusion detection in MANETs is challenging because these networks change their topologies dynamically; lack concentration points where aggregated traffic can be analyzed; utili...
Daniel F. Sterne, Poornima Balasubramanyam, David ...
SCN
2010
Springer
142views Communications» more  SCN 2010»
13 years 5 months ago
How to Pair with a Human
We introduce a protocol, that we call Human Key Agreement, that allows pairs of humans to establish a key in a (seemingly hopeless) case where no public-key infrastructure is avail...
Stefan Dziembowski
IACR
2011
73views more  IACR 2011»
12 years 7 months ago
Secure Authentication from a Weak Key, Without Leaking Information
We study the problem of authentication based on a weak key in the information-theoretic setting. A key is weak if its min-entropy is an arbitrary small fraction of its bit length. ...
Niek J. Bouman, Serge Fehr