143 search results - page 17 / 29 » Hash, Displace, and Compress |
ISW
2009
Springer
14 years 1 months ago
2009
Springer
In this paper, we present free-start collisions for the TIB3 hash function with a complexity of about 232 compression function evaluations. By using message modification technique...
ICIP
2009
IEEE
13 years 5 months ago
2009
IEEE
In this paper we describe a robust watermarking scheme for image tampering identification and localization. A compact representation of the image is first produced by assembling a...
USENIX
2007
13 years 9 months ago
2007
Content-based naming (CBN) enables content sharing across similar files by breaking files into positionindependent chunks and naming these chunks using hashes of their contents....
CRYPTO
2004
Springer
14 years 24 days ago
2004
Springer
Ordinarily, RSA and Rabin ciphertexts and signatures are log N bits, where N is a composite modulus; here, we describe how to “compress” Rabin ciphertexts and signatures (among...
ICIP
2004
IEEE
14 years 9 months ago
2004
IEEE
Perceptual image hashing maps an image to a fixed length binary string based on the image's appearance to the human eye, and has applications in image indexing, authenticatio...