Sciweavers

1262 search results - page 3 / 253
» Fast Robust Hashing
Sort
View
JOC
1998
135views more  JOC 1998»
13 years 5 months ago
Attacks on Fast Double Block Length Hash Functions
The security of hash functions based on a block cipher with a block length of m bits and a key length of k bits, where k ≤ m, is considered. New attacks are presented on a large ...
Lars R. Knudsen, Xuejia Lai, Bart Preneel
ICMCS
2006
IEEE
122views Multimedia» more  ICMCS 2006»
13 years 11 months ago
A Robust Entropy-Based Audio-Fingerprint
Audio Fingerprints (AFP’s) are compact, content-based representations of audio signals used to measure distances among them. An AFP has to be small, fast computed and robust to ...
Antonio Camarena-Ibarrola, Edgar Chávez
P2P
2006
IEEE
148views Communications» more  P2P 2006»
13 years 11 months ago
eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System
Peer-to-peer systems (p2p) are highly dynamic in nature. They may consist of millions of peers joining only for a limited period of time, resulting in hundreds of join and leave e...
Thomas Locher, Stefan Schmid, Roger Wattenhofer
ICIP
2004
IEEE
14 years 7 months ago
A framework for soft hashing and its application to robust image hashing
An increasing interest in the soft hashing problem has been witnessed in recent times. Techniques implementing soft hashing intend to mirror the behaviour of cryptographic hashing...
Elizabeth P. McCarthy, Félix Balado, Guenol...
ICIP
2008
IEEE
14 years 7 days 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