Sciweavers

1342 search results - page 145 / 269
» Attacks are Protocols Too
Sort
View
ACSC
2005
IEEE
16 years 2 days ago
Dependable Dynamic Source Routing without a Trusted Third Party
Ad-hoc networks are frequently used to establish communication in improvised environments without requiring any fixed infrastructure. These networks are formed with the help of t...
Asad Amir Pirzada, Chris McDonald, Amitava Datta
SACRYPT
2004
Springer
125views Cryptology» more  SACRYPT 2004»
15 years 11 months ago
Password Based Key Exchange with Mutual Authentication
A reasonably efficient password based key exchange (KE) protocol with provable security without random oracle was recently proposed by Katz, et al. [18] and later by Gennaro and Li...
Shaoquan Jiang, Guang Gong
IWFM
2003
15 years 7 months ago
Using Admissible Interference to Detect Denial of Service Vulnerabilities
Meadows recently proposed a formal cost-based framework for analysis of denial of service. It was showed how some principles that have already been used to make cryptographic prot...
Stéphane Lafrance, John Mullins
ICICS
2010
Springer
15 years 4 months ago
Proving Coercion-Resistance of Scantegrity II
By now, many voting protocols have been proposed that, among others, are designed to achieve coercion-resistance, i.e., resistance to vote buying and voter coercion. Scantegrity II...
Ralf Küsters, Tomasz Truderung, Andreas Vogt
CCS
2008
ACM
15 years 8 months ago
Securing group key exchange against strong corruptions
When users run a group key exchange (GKE) protocol, they usually extract the key from some auxiliary (ephemeral) secret information generated during the execution. Strong corrupti...
Emmanuel Bresson, Mark Manulis