Efficient Anonymous Biometric Matching in Privacy-Aware Environments

139 Pages·2017·1.17 MB·English

UUnniivveerrssiittyy ooff KKeennttuucckkyy
UUKKnnoowwlleeddggee
Theses and Dissertations--Electrical and
Electrical and Computer Engineering
Computer Engineering
2014
EEffifficciieenntt AAnnoonnyymmoouuss BBiioommeettrriicc MMaattcchhiinngg iinn PPrriivvaaccyy--AAwwaarree
EEnnvviirroonnmmeennttss
Ying Luo
University of Kentucky, [email protected]
RRiigghhtt cclliicckk ttoo ooppeenn aa ffeeeeddbbaacckk ffoorrmm iinn aa nneeww ttaabb ttoo lleett uuss kknnooww hhooww tthhiiss ddooccuummeenntt bbeenneefifittss yyoouu..
RReeccoommmmeennddeedd CCiittaattiioonn
Luo, Ying, "Efficient Anonymous Biometric Matching in Privacy-Aware Environments" (2014). Theses and
Dissertations--Electrical and Computer Engineering. 46.
https://uknowledge.uky.edu/ece_etds/46
This Doctoral Dissertation is brought to you for free and open access by the Electrical and Computer Engineering at
UKnowledge. It has been accepted for inclusion in Theses and Dissertations--Electrical and Computer Engineering
by an authorized administrator of UKnowledge. For more information, please contact [email protected].
SSTTUUDDEENNTT AAGGRREEEEMMEENNTT::
I represent that my thesis or dissertation and abstract are my original work. Proper attribution
has been given to all outside sources. I understand that I am solely responsible for obtaining
any needed copyright permissions. I have obtained needed written permission statement(s)
from the owner(s) of each third-party copyrighted matter to be included in my work, allowing
electronic distribution (if such use is not permitted by the fair use doctrine) which will be
submitted to UKnowledge as Additional File.
I hereby grant to The University of Kentucky and its agents the irrevocable, non-exclusive, and
royalty-free license to archive and make accessible my work in whole or in part in all forms of
media, now or hereafter known. I agree that the document mentioned above may be made
available immediately for worldwide access unless an embargo applies.
I retain all other ownership rights to the copyright of my work. I also retain the right to use in
future works (such as articles or books) all or part of my work. I understand that I am free to
register the copyright to my work.
RREEVVIIEEWW,, AAPPPPRROOVVAALL AANNDD AACCCCEEPPTTAANNCCEE
The document mentioned above has been reviewed and accepted by the student’s advisor, on
behalf of the advisory committee, and by the Director of Graduate Studies (DGS), on behalf of
the program; we verify that this is the final, approved version of the student’s thesis including all
changes required by the advisory committee. The undersigned agree to abide by the statements
above.
Ying Luo, Student
Dr. Sen-Ching S. Cheung, Major Professor
Dr. Caicheng Lu, Director of Graduate Studies
EFFICIENT ANONYMOUS BIOMETRIC MATCHING IN PRIVACY-AWARE
ENVIRONMENTS
DISSERTATION
A dissertation submitted in partial fulfillment of the
requirements for the degree of Doctor of Philosophy
in the College of Engineering
at the University of Kentucky
By
Ying Luo
Lexington, Kentucky
Director: Dr. Sen-Ching S. Cheung, Professor of Electrical and Computer
Engineering
Lexington, Kentucky
2014
Copyright(cid:13)c Ying Luo 2014
ABSTRACT OF DISSERTATION
EFFICIENT ANONYMOUS BIOMETRIC MATCHING IN PRIVACY-AWARE
ENVIRONMENTS
Video surveillance is an important tool used in security and environmental monitor-
ing, however, the widespread deployment of surveillance cameras has raised serious
privacy concerns. Many privacy-enhancing schemes have been recently proposed to
automatically redact images of selected individuals in the surveillance video for pro-
tection. To identify these individuals for protection, the most reliable 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 dissertation, an Anonymous Biometric Access Control (ABAC) procedure
is proposed based on biometric signals for privacy-aware video surveillance. The
ABAC procedure uses Secure Multi-party Computational (SMC) based protocols to
verify membership of an incoming individual without knowing his/her true identi-
ty. To make SMC-based protocols scalable to large biometric databases, I introduce
the k-Anonymous Quantization (kAQ) framework to provide an effective and secure
tradeoff of privacy and complexity. kAQ limits systems knowledge of the incoming
individual to k maximally dissimilar candidates in the database, where k is a design
parameter that controls the amount of complexity-privacy tradeoff. The relationship
between biometric similarity and privacy is experimentally validated using a twin iris
database. The effectiveness of the entire system is demonstrated based on a public
iris biometric database.
To provide the protected subjects with full access to their privacy information in
video surveillance system, I develop a novel privacy information management system
that allows subjects to access their information via the same biometric signals used
for ABAC. The system is composed of two encrypted-domain protocols: the priva-
cy information encryption protocol encrypts the original video records using the iris
pattern acquired during ABAC procedure; the privacy information retrieval proto-
col allows the video records to be anonymously retrieved through a GC-based iris
pattern matching process. Experimental results on a public iris biometric database
demonstrate the validity of my framework.
KEYWORDS: BiometricMatching, Privacy,Authentication, Anonymity, AccessCon-
trol
Author’s signature: Ying Luo
Date: July 3, 2014
EFFICIENT ANONYMOUS BIOMETRIC MATCHING IN PRIVACY-AWARE
ENVIRONMENTS
By
Ying Luo
Director of Dissertation: Sen-Ching S. Cheung
Director of Graduate Studies: Caicheng Lu
Date: July 3, 2014
For my family
ACKNOWLEDGMENTS
I would never have been able to finish my dissertation without the guidance of my
committee members, help from friends, and support from my family.
I am heartily thankful to my supervisor, Dr. Sen-Ching Samson Cheung, whose
encouragement, guidance and support from the initial to the final level enabled me
to develop an understanding of the subject. I also want to give many thanks to
my committee members and outside examiner: Dr. Kevin Donohue , Dr. Laurence
Hassebrook, Dr. Jun Zhang and Dr. William Murphy, for the time they spent on my
dissertation review. I appreciate all of the suggestions and comments.
I want to thank Dr. Mauro Barni and his Visual Information Processing and
Protection (VIPP) group at the Department of Information Engineering of the U-
niversity of Siena in Italy. He not only introduced garble circuits to improve the
efficiency of my proposed system, but also infected me with his passion and altitude
towards research.
In addition, special thanks for the financial support from the National Science
Foundation under Grant No. 1018241 & No. 1237134, and Dr. Bruce Walcott’s
project sponsored by Lockheed Martin.
Last but not least, my deepest gratitude goes to the people who have had such a
significant impact on my life. My parents and elder brother encouraged me to enter
a Ph.D. program in the United States. They have always given me unconditional
support and love.
iii
Table of Contents
Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iii
Table of Contents . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iv
List of Figures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vii
List of Tables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . viii
Chapter 1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.1 Problem Statement . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
1.2 Contributions of Dissertation . . . . . . . . . . . . . . . . . . . . . . 6
1.3 Overview of My Solution . . . . . . . . . . . . . . . . . . . . . . . . . 9
1.4 Dissertation Organization . . . . . . . . . . . . . . . . . . . . . . . . 13
Chapter 2 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
2.1 Anonymous Biometric Access Control (ABAC) . . . . . . . . . . . . . 14
2.1.1 Biometric Signal Space and Distance Function . . . . . . . . . 15
2.1.2 User Anonymity & Biometric Access Control . . . . . . . . . . 17
2.1.3 Security Model on Adversarial Behaviors . . . . . . . . . . . . 19
2.2 Computationally-Secure SMC (CS-SMC) . . . . . . . . . . . . . . . . 20
2.2.1 Homomorphic Encryption (HE) . . . . . . . . . . . . . . . . . 21
2.2.2 Parallel Oblivious Transfer (OT) . . . . . . . . . . . . . . . . 22
2.2.3 Garbled Circuit (GC) . . . . . . . . . . . . . . . . . . . . . . . 23
2.3 Information Theoretic SMC (IT-SMC) . . . . . . . . . . . . . . . . . 26
2.3.1 Shamir’s Secret Share (SSS) . . . . . . . . . . . . . . . . . . . 27
Chapter 3 Related work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
3.1 Biometric and Privacy . . . . . . . . . . . . . . . . . . . . . . . . . . 31
3.2 Complexity Reduction in SMC . . . . . . . . . . . . . . . . . . . . . 33
iv
3.3 Privacy Information Management (PIM) in Video Surveillance Network 36
Chapter 4 SMC-based Anonymous Biometric Matching . . . . . . . . . . . . 39
4.1 Homomorphic Encryption based ABAC . . . . . . . . . . . . . . . . . 39
4.1.1 Hamming Distance . . . . . . . . . . . . . . . . . . . . . . . . 40
4.1.2 Bit Extraction . . . . . . . . . . . . . . . . . . . . . . . . . . . 41
4.1.3 Threshold Comparison . . . . . . . . . . . . . . . . . . . . . . 43
4.1.4 Overall Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . 43
4.2 Garbled Circuits based ABAC . . . . . . . . . . . . . . . . . . . . . . 45
4.2.1 GC-based Iriscode Matching . . . . . . . . . . . . . . . . . . . 46
4.2.2 Simplification of Iris Masks . . . . . . . . . . . . . . . . . . . 49
4.2.3 Common Mask for All Irises . . . . . . . . . . . . . . . . . . . 50
4.3 Secure Multi-party Computation (# of parties ≥ 3) . . . . . . . . . . 51
4.3.1 Convolution . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52
4.3.2 Threshold comparison . . . . . . . . . . . . . . . . . . . . . . 52
4.3.3 Sign Function . . . . . . . . . . . . . . . . . . . . . . . . . . . 58
4.3.4 Quantization . . . . . . . . . . . . . . . . . . . . . . . . . . . 59
4.4 Experiments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60
4.4.1 Homomorphic Encryption Processing . . . . . . . . . . . . . . 60
4.4.2 Privacy and Similarity among Iris Masks . . . . . . . . . . . . 62
4.4.3 Common Mask . . . . . . . . . . . . . . . . . . . . . . . . . . 64
4.4.4 Garbled Circuits Processing . . . . . . . . . . . . . . . . . . . 65
4.4.5 Comparison of Complexity and Communication Costs on HE, GC, and SSS 67
Chapter 5 Privacy-complexity Tradeoff in CS-SMC . . . . . . . . . . . . . . 69
5.1 k-Anonymous Quantization (kAQ) . . . . . . . . . . . . . . . . . . . 69
5.1.1 Basic Formulation and Assumptions . . . . . . . . . . . . . . . 71
5.1.2 Neighborhoods . . . . . . . . . . . . . . . . . . . . . . . . . . 73
5.1.3 Greedy kAQ . . . . . . . . . . . . . . . . . . . . . . . . . . . . 76
5.1.4 Secure Index Selection . . . . . . . . . . . . . . . . . . . . . . 77
5.2 Experiments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 84
v