Privacy-preserving architecture for forensic image recognition

Forensic image recognition is an important tool in many areas of law enforcement where an agency wants to prosecute possessors of illegal images. The recognition of illegal images that might have undergone human imperceptible changes (e.g., a JPEG-recompression) is commonly done by computing a perceptual image hash function of a given image and then matching this hash with perceptual hash values in a database of previously collected illegal images. To prevent privacy violation, agencies should only learn about images that have been reliably detected as illegal and nothing else. In this work, we argue that the prevalent presence of separate departments in such agencies can be used to enforce the need-to-know principle by separating duties among them. This enables us to construct the first practically efficient architecture to perform forensic image recognition in a privacy-preserving manner. By deriving unique cryptographic keys directly from the images, we can encrypt all sensitive data and ensure that only illegal images can be recovered by the law enforcement agency while all other information remains protected.

[1]  Shih-Fu Chang,et al.  A robust image authentication method distinguishing JPEG compression from malicious manipulation , 2001, IEEE Trans. Circuits Syst. Video Technol..

[2]  Ramarathnam Venkatesan,et al.  New Iterative Geometric Methods for Robust Perceptual Image Hashing , 2001, Digital Rights Management Workshop.

[3]  Andreas Uhl,et al.  Robustness and security of a wavelet-based CBIR hashing algorithm , 2006, MM&Sec '06.

[4]  Jiri Fridrich,et al.  Robust bit extraction from images , 1999, Proceedings IEEE International Conference on Multimedia Computing and Systems.

[5]  Vishal Monga,et al.  Perceptually based methods for robust image hashing , 2005 .

[6]  Rafail Ostrovsky,et al.  Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data , 2004, SIAM J. Comput..

[7]  Jiri Fridrich,et al.  Robust hash functions for digital watermarking , 2000, Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540).

[8]  Mihir Bellare,et al.  Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.

[9]  Andreas Uhl,et al.  A survey on biometric cryptosystems and cancelable biometrics , 2011, EURASIP J. Inf. Secur..

[10]  Martin Steinebach,et al.  ForBild: efficient robust image hashing , 2012, Other Conferences.

[11]  Sushil K. Bhattacharjee,et al.  Compression tolerant image authentication , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

[12]  Anil K. Jain,et al.  Biometric Template Security , 2008, EURASIP J. Adv. Signal Process..

[13]  Nasir D. Memon,et al.  Protecting Biometric Templates With Sketch: Theory and Practice , 2007, IEEE Transactions on Information Forensics and Security.

[14]  Yair Frankel,et al.  On the Relation of Error Correction and Cryptography to an Off Line Biometric Based Identification S , 1999 .

[15]  Ee-Chien Chang,et al.  Robust, short and sensitive authentication tags using secure sketch , 2006, MM&Sec '06.

[16]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[17]  Bian Yang,et al.  Block Mean Value Based Image Perceptual Hashing , 2006, 2006 International Conference on Intelligent Information Hiding and Multimedia.

[18]  Yair Frankel,et al.  On enabling secure applications through off-line biometric identification , 1998, Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186).

[19]  Christoph Zauner,et al.  Implementation and Benchmarking of Perceptual Image Hash Functions , 2010 .

[20]  Ee-Chien Chang,et al.  Fuzzy extractors for asymmetric biometric representations , 2008, 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops.