Secret Rate - Privacy Leakage in Biometric Systems

被引:5
作者
Ignatenko, Tanya [1 ]
Willems, Frans [1 ]
机构
[1] Eindhoven Univ Technol, Dept Elect Engn, NL-5600 MB Eindhoven, Netherlands
来源
2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4 | 2009年
关键词
COMMON RANDOMNESS; INFORMATION-THEORY; CRYPTOGRAPHY;
D O I
10.1109/ISIT.2009.5205878
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Ahlswede and Csiszar [1993] introduced the concept of secret sharing. In their source model two terminals observe two correlated sequences. It is the objective of the terminals to form a common secret by interchanging a public message (helper data) in such a way that the secrecy leakage is negligible. In a biometric setting, where the sequences correspond to the enrollment and authentication data, respectively, it is crucial that the public message leaks as little information as possible about the biometric data, since compromised biometric data cannot be replaced. We investigated the fundamental trade-offs for four biometric settings. The first one is the standard (Ahlswede-Csiszar) secret generation setting, for which we determined the secret-key vs. privacy-leakage rate region. Here leakage corresponds to the mutual information between helper data and biometric enrollment sequence. In the second setting the secret is not generated by the terminals but independently chosen, and transmitted using a public message. Again we determined the region of achievable rate-leakage pairs. In setting three and four we consider zero-leakage, i.e. the public message contains only a negligible amount of information about the secret and about the biometric enrollment sequence. To achieve this a private key is needed, which can be observed only by the terminals. We considered again both secret generation and secret transmission and determined for both cases the region of achievable secret-key vs. private-key rate pairs.
引用
收藏
页码:2251 / 2255
页数:5
相关论文
共 15 条
[1]   Common randomness in information theory and cryptography - Part II: CR capacity [J].
Ahlswede, R ;
Csiszar, I .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (01) :225-240
[2]   COMMON RANDOMNESS IN INFORMATION-THEORY AND CRYPTOGRAPHY .1. SECRET SHARING [J].
AHLSWEDE, R ;
CSISZAR, I .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (04) :1121-1132
[3]  
[Anonymous], P 46 ANN ALL C COMM
[4]  
[Anonymous], THESIS MIT
[5]   PROOF OF DATA COMPRESSION THEOREM OF SLEPIAN AND WOLF FOR ERGODIC SOURCES [J].
COVER, TM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (02) :226-228
[6]   Common randomness and secret key generation with a helper [J].
Csiszár, I ;
Narayan, P .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (02) :344-366
[7]  
GUNDUZ D, 2008, P IEEE ITW PORT PORT
[8]  
IGNATENKO T, 2006, P 27 S INF THEOR BEN, P197
[9]  
IGNATENKO T, 2008, P 46 ANN ALL C COMM
[10]  
IGNATENKO T, 2008, IEEE T IN UNPUB 0919