Share Email Print

Proceedings Paper

On security threats for robust perceptual hashing
Author(s): O. Koval; S. Voloshynovskiy; P. Bas; F. Cayre
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Perceptual hashing has to deal with the constraints of robustness, accuracy and security. After modeling the process of hash extraction and the properties involved in this process, two different security threats are studied, namely the disclosure of the secret feature space and the tampering of the hash. Two different approaches for performing robust hashing are presented: Random-Based Hash (RBH) where the security is achieved using a random projection matrix and Content-Based Hash (CBH) were the security relies on the difficulty to tamper the hash. As for digital watermarking, different security setups are also devised: the Batch Hash Attack, the Group Hash Attack, the Unique Hash Attack and the Sensitivity Attack. A theoretical analysis of the information leakage in the context of Random-Based Hash is proposed. Finally, practical attacks are presented: (1) Minor Component Analysis is used to estimate the secret projection of Random-Based Hashes and (2) Salient point tampering is used to tamper the hash of Content-Based Hashes systems.

Paper Details

Date Published: 4 February 2009
PDF: 13 pages
Proc. SPIE 7254, Media Forensics and Security, 72540H (4 February 2009); doi: 10.1117/12.807487
Show Author Affiliations
O. Koval, Univ. of Geneva (Switzerland)
S. Voloshynovskiy, Univ. of Geneva (Switzerland)
P. Bas, Gipsa-Lab., INPG, CNRS (France)
F. Cayre, Gipsa-Lab., INPG, CNRS (France)

Published in SPIE Proceedings Vol. 7254:
Media Forensics and Security
Edward J. Delp III; Jana Dittmann; Nasir D. Memon; Ping Wah Wong, Editor(s)

© SPIE. Terms of Use
Back to Top