Sciweavers

1342 search results - page 32 / 269
» Attacks are Protocols Too
Sort
View
ESAS
2006
Springer
15 years 3 months ago
So Near and Yet So Far: Distance-Bounding Attacks in Wireless Networks
Distance-bounding protocols aim to prevent an adversary from pretending that two parties are physically closer than they really are. We show that proposed distance-bounding protoco...
Jolyon Clulow, Gerhard P. Hancke, Markus G. Kuhn, ...
IFIP
2009
Springer
14 years 9 months ago
Attack, Solution and Verification for Shared Authorisation Data in TCG TPM
The Trusted Platform Module (TPM) is a hardware chip designed to enable computers achieve greater security. Proof of possession of authorisation values known as authdata is require...
Liqun Chen, Mark Ryan
IJACT
2008
86views more  IJACT 2008»
14 years 11 months ago
Securing group key exchange against strong corruptions and key registration attacks
: In Group Key Exchange (GKE) protocols, users usually extract the group key using some auxiliary (ephemeral) secret information generated during the execution. Strong corruptions ...
Emmanuel Bresson, Mark Manulis
WDAG
2005
Springer
101views Algorithms» more  WDAG 2005»
15 years 5 months ago
Keeping Denial-of-Service Attackers in the Dark
Abstract. We consider the problem of overcoming (Distributed) Denial of Service (DoS) attacks by realistic adversaries that can eavesdrop on messages, or parts thereof, but with so...
Gal Badishi, Amir Herzberg, Idit Keidar
SRDS
1993
IEEE
15 years 3 months ago
Some Remarks on Protecting Weak Keys and Poorly-Chosen Secrets from Guessing Attacks
Authentication and key distribution protocols that utilize weak secrets (such as passwords and PINs) are traditionally susceptible to guessing attacks whereby an adversary iterate...
Gene Tsudik, Els Van Herreweghen