Information Theoretical Analysis of Biometric Generated Secret Key Sharing Model

Authors

  • Mariam E. Haroutunian Institute for Informatics and Automation Problems of NAS RA
  • Narek S. Pahlevanyan Gyumri State Pedagogical Institute

Abstract

We investigate the biometric generated secret key sharing system. We consider the generalization of the secret key rate, studied by Ignatenko and Willems [1]: the notion of E-achievable secret key rate is introduced. The lower and upper bounds for the largest E-achievable secret key rate are obtained. When E tends to zero, the limits of our bounds coincide and are equal to the largest achievable secret key rate stated in [1].

References

T. Ignatenko and F. M. Willems, “Biometric security from an information-theoretical perspective," Foundations and Trends in Communications and Information Theory, vol. 7, no. 2-3, pp. 135-316, 2012.

J. A. O'Sullivan and N. A. Schmid, “Large deviations performance analysis for biometrics recognition", Proc. 40th Annual Allerton Conf. on Communication, Control, and Computing, pp. 1-10, Oct. 2002.

F. Willems, T. Kalker, J. Goseling and J.-P. Linnartz, “On the capacity of a biometrical identification system," in Information Theory, 2003. Proceedings. IEEE International Symposium on Information Theory, Yokohama, Japan, 2003, p. 82.

E. Haroutunian, “On bounds for E-capacity of D MC,"IEEE Transactions on Information Theory, vol. 53, no. 11, pp. 4210-4220, 2007.

M. Haroutunian, A. Muradyan and L. Ter-Vardanyan, “Upper and lower bounds of biometric identification E-capacity, "Transactions of IIAP of NAS of RA, Mathematical Problems of Computer Science, vol. 36, pp. 1-10, 2012.

M. Haroutunian and L. Ter-Vardanyan, “Investigation of E-capacity for biometric identification protocol with random parameter," Transactions of IIAP of NAS of RA, Mathematical Problems of Computer Science, vol. 39, pp. 88-93, 2013.

U. Maurer, “Secret key agreement by public discussion from common information," IEEE Transactions on Information Theory, vol. 39, no. 3, pp. 733-742, May 1993.

R. Ahlswede and I. Csiszar, “Common randomness in information theory and cryptography. I secret sharing,"IEEE Transactions on Information Theory, vol. 39, no. 4, pp. 1121-1132, 1993.

Y. Chen and A. H. Vinck, “From password to biometrics: How far can we go,"P roceidings 7th Asia-Europe Workshop on Concepts in Information theory, Boppard, Germany, pp. 18, 2011.

E. A. Haroutunian, M. E. Haroutunian and A. N. Harutyunyan, “Reliability criteria in information theory and in statistical hypothesis testing, "Foundations and Trends in Communications and Information Theory, vol. 4, no. 2-3, pp. 97-263, 2008.

I. Csiszar, “The method of types,"IEEE Transactions on Information Theory, vol. 44, no. 6, pp. 2505-2523, 1998.

T. M. Cover and J. A. Thomas, Elements of Information Theory, 2nd Edition, New York, Wiley-Interscience, 2006.

Downloads

Published

2021-12-10

How to Cite

Haroutunian , M. E. ., & Pahlevanyan, . N. S. . (2021). Information Theoretical Analysis of Biometric Generated Secret Key Sharing Model. Mathematical Problems of Computer Science, 42, 17–27. Retrieved from http://mpcs.sci.am/index.php/mpcs/article/view/212

Most read articles by the same author(s)

1 2 > >>