Sciweavers

49 search results - page 6 / 10
» Lower Bounds on Signatures From Symmetric Primitives
Sort
View
ICNS
2009
IEEE
14 years 1 months ago
Counter-Flooding: DoS Protection for Public Key Handshakes in LANs
—The majority of security protocols employ public key cryptography for authentication at least in the connection setup phase. However, verifying digital signatures is an expensiv...
Yves Igor Jerschow, Björn Scheuermann, Martin...
AVBPA
2001
Springer
119views Biometrics» more  AVBPA 2001»
13 years 11 months ago
Extended Model-Based Automatic Gait Recognition of Walking and Running
Gait is an emerging biometric. Current systems are either holistic or feature based and have been demonstrated to be able to recognise people by the way they walk. This paper descr...
Chew-Yean Yam, Mark S. Nixon, John N. Carter
NDSS
2008
IEEE
14 years 1 months ago
Limits of Learning-based Signature Generation with Adversaries
Automatic signature generation is necessary because there may often be little time between the discovery of a vulnerability, and exploits developed to target the vulnerability. Mu...
Shobha Venkataraman, Avrim Blum, Dawn Song
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
14 years 1 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret
EUROCRYPT
2003
Springer
14 years 6 days ago
New Bounds in Secret-Key Agreement: The Gap between Formation and Secrecy Extraction
Perfectly secret message transmission can be realized with only partially secret and weakly correlated information shared by the parties as soon as this information allows for the ...
Renato Renner, Stefan Wolf