Single-Component Privacy Guarantees in Helper Data Systems and Sparse Coding with Ambiguation

We investigate the privacy of two approaches to (biometric) template protection: Helper Data Systems and Sparse Ternary Coding with Ambiguation. In particular, we focus on a privacy property that is often overlooked, namely how much leakage exists about one specific binary property of one component of the feature vector. This property is e.g. the sign or an indicator that a threshold is exceeded.We provide evidence that both approaches are able to protect such sensitive binary variables, and discuss how system parameters need to be set.

[1]  Behrooz Razeghi,et al.  Reconstruction of Privacy-Sensitive Data from Protected Templates , 2019, 2019 IEEE International Conference on Image Processing (ICIP).

[2]  Boris Škorić,et al.  Optimized Quantization in Zero Leakage Helper Data Systems , 2017, IEEE Transactions on Information Forensics and Security.

[3]  Dimche Kostadinov,et al.  Privacy-Preserving Identification via Layered Sparse Code Design: Distributed Servers and Multiple Access Authorization , 2018, 2018 26th European Signal Processing Conference (EUSIPCO).

[4]  Dimche Kostadinov,et al.  Sparse ternary codes for similarity search have higher coding gain than dense binary codes , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[5]  Guy Gogniat,et al.  Recent Advances in Homomorphic Encryption: A Possible Future for Signal Processing in the Encrypted Domain , 2013, IEEE Signal Processing Magazine.

[6]  Jean-Paul M. G. Linnartz,et al.  New Shielding Functions to Enhance Privacy and Prevent Misuse of Biometric Templates , 2003, AVBPA.

[7]  Dimche Kostadinov,et al.  Privacy preserving identification using sparse approximation with ambiguization , 2017, 2017 IEEE Workshop on Information Forensics and Security (WIFS).

[8]  Martin Wattenberg,et al.  A fuzzy commitment scheme , 1999, CCS '99.

[9]  Behrooz Razeghi,et al.  Privacy-Preserving Outsourced Media Search Using Secure Sparse Ternary Codes , 2018, 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[10]  Mauro Barni,et al.  Encrypted signal processing for privacy protection: Conveying the utility of homomorphic encryption and multiparty computation , 2013, IEEE Signal Processing Magazine.

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

[12]  Boris Skoric,et al.  Key Extraction From General Nondiscrete Signals , 2010, IEEE Transactions on Information Forensics and Security.

[13]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[14]  Gilles Brassard,et al.  Practical Quantum Oblivious Transfer , 1991, CRYPTO.

[15]  Piotr Indyk,et al.  Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.

[16]  Nicole Immorlica,et al.  Locality-sensitive hashing scheme based on p-stable distributions , 2004, SCG '04.

[17]  Jean-Paul M. G. Linnartz,et al.  Quantization in zero leakage helper data schemes , 2016, EURASIP J. Adv. Signal Process..