Sciweavers

405 search results - page 51 / 81
» Practice-Oriented Provable Security
Sort
View
FORTE
2008
13 years 9 months ago
Detecting Communication Protocol Security Flaws by Formal Fuzz Testing and Machine Learning
Network-based fuzz testing has become an effective mechanism to ensure the security and reliability of communication protocol systems. However, fuzz testing is still conducted in a...
Guoqiang Shu, Yating Hsu, David Lee
FSE
2009
Springer
125views Cryptology» more  FSE 2009»
14 years 8 months ago
On the Security of Tandem-DM
Abstract. We provide the first proof of security for Tandem-DM, one of the oldest and most wellknown constructions for turning a blockcipher with n-bit blocklength and 2n-bit keyle...
Ewan Fleischmann, Michael Gorski, Stefan Lucks
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 4 months ago
NLHB : A Non-Linear Hopper Blum Protocol
The Hopper-Blum (HB) protocol, which uses noised linear parities of a shared key for authentication, has been proposed for light-weight applications such as RFID. Recently, algorit...
Mukundan Madhavan, Andrew Thangaraj, Yogesh Sankar...
CCS
2009
ACM
14 years 8 months ago
An ID-based authenticated key exchange protocol based on bilinear Diffie-Hellman problem
In this paper, we present a new ID-based two-party authenticated key exchange (AKE) protocol, which makes use of a new technique called twin Diffie-Hellman problem proposed by Cas...
Hai Huang, Zhenfu Cao
CCS
2009
ACM
14 years 8 months ago
A generic construction of useful client puzzles
Denial of Service (DoS) attacks are serious threats for network societies. For dealing with DoS attacks, Jakobsson and Juels first proposed the notion of useful client puzzles (UC...
Rui Zhang 0002, Goichiro Hanaoka, Hideki Imai