Sciweavers

11 search results - page 1 / 3
» On the security of non-forgeable robust hash functions
Sort
View
ICIP
2008
IEEE
13 years 11 months ago
On the security of non-forgeable robust hash functions
In many applications, it is often desirable to extract a consistent key from a multimedia object (e.g., an image), even when the object has gone through a noisy channel. For examp...
Qiming Li, Sujoy Roy
MMSEC
2005
ACM
113views Multimedia» more  MMSEC 2005»
13 years 10 months ago
A secure biometric authentication scheme based on robust hashing
In this paper, we propose a secure biometric based authentication scheme which fundamentally relies on the use of a robust hash function. The robust hash function is a one-way tra...
Yagiz Sutcu, Husrev T. Sencar, Nasir D. Memon
SECRYPT
2007
121views Business» more  SECRYPT 2007»
13 years 6 months ago
Using Steganography to Improve Hash Functions' Collision Resistance
Lately, hash function security has received increased attention. Especially after the recent attacks that were presented for SHA-1 and MD5, the need for a new and more robust hash...
Emmanouel Kellinis, Konstantinos Papapanagiotou
CTRSA
2010
Springer
169views Cryptology» more  CTRSA 2010»
13 years 11 months ago
Hash Function Combiners in TLS and SSL
Abstract. The TLS and SSL protocols are widely used to ensure secure communication over an untrusted network. Therein, a client and server first engage in the so-called handshake ...
Marc Fischlin, Anja Lehmann, Daniel Wagner
CRYPTO
2008
Springer
100views Cryptology» more  CRYPTO 2008»
13 years 6 months ago
Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
Abstract. This paper discusses key recovery and universal forgery attacks on several MAC algorithms based on universal hash functions. The attacks use a substantial number of verif...
Helena Handschuh, Bart Preneel