TY - GEN
T1 - Anonymous subject identification in privacy-aware video surveillance
AU - Luo, Ying
AU - Ye, Shuiming
AU - Cheung, Sen Ching S.
PY - 2010
Y1 - 2010
N2 - The widespread deployment of surveillance cameras has raised serious privacy concerns. Many privacy-enhancing schemes have been recently proposed to identify selected individuals and redact their images in the surveillance video. To identify individuals, the best known approach is to use biometric signals as they are immutable and highly discriminative. If misused, these characteristics of biometrics can seriously defeat the goal of privacy protection. In this paper, we propose an anonymous subject identification system based on homomorphic encryption (HE). It matches the biometric signals in encrypted domain to provide anonymity to users. To make the HE-based protocols computationally scalable, we propose a complexity-privacy tradeoff called k-Anonymous Quantization (kAQ) which narrows the plaintext search to a small cell before running the intensive encrypted-domain processing within the cell. We validate a key assumption in kAQ that privacy is better preserved by grouping biometric patterns far apart into the same cell. We also improve the matching success rate by replacing the original bounding boxes with ε-balls as basic units for grouping. Experimental results on a public iris biometric database demonstrate the validity of our framework.
AB - The widespread deployment of surveillance cameras has raised serious privacy concerns. Many privacy-enhancing schemes have been recently proposed to identify selected individuals and redact their images in the surveillance video. To identify individuals, the best known approach is to use biometric signals as they are immutable and highly discriminative. If misused, these characteristics of biometrics can seriously defeat the goal of privacy protection. In this paper, we propose an anonymous subject identification system based on homomorphic encryption (HE). It matches the biometric signals in encrypted domain to provide anonymity to users. To make the HE-based protocols computationally scalable, we propose a complexity-privacy tradeoff called k-Anonymous Quantization (kAQ) which narrows the plaintext search to a small cell before running the intensive encrypted-domain processing within the cell. We validate a key assumption in kAQ that privacy is better preserved by grouping biometric patterns far apart into the same cell. We also improve the matching success rate by replacing the original bounding boxes with ε-balls as basic units for grouping. Experimental results on a public iris biometric database demonstrate the validity of our framework.
KW - Anonymous subject identification
KW - K-anonymous quantization
KW - Privacy protection
KW - Video surveillance
UR - http://www.scopus.com/inward/record.url?scp=78349249352&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78349249352&partnerID=8YFLogxK
U2 - 10.1109/ICME.2010.5583561
DO - 10.1109/ICME.2010.5583561
M3 - Conference contribution
AN - SCOPUS:78349249352
SN - 9781424474912
T3 - 2010 IEEE International Conference on Multimedia and Expo, ICME 2010
SP - 83
EP - 88
BT - 2010 IEEE International Conference on Multimedia and Expo, ICME 2010
T2 - 2010 IEEE International Conference on Multimedia and Expo, ICME 2010
Y2 - 19 July 2010 through 23 July 2010
ER -