|
Applied Theory of Coding, Automata and Graphs
On codes used in biometrical cryptosystems
A. A. Belousovaa, V. I. Nobelevaa, N. N. Tokarevaba a Novosibirsk State University, Novosibirsk
b Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
Abstract:
Problems of using error-correcting codes in biometric cryptosystems are studied. Several constructions of codes with parameters better than parameters of the code from the original biometric cryptosystem of F. Hao, R. Anderson, and J. Daugman (2006) are proposed. A new upper bound for the size of a binary code based on its possibility to correct not more than $t$ errors with probability $1$ and $t+1$ errors with a probability $p$ is proposed. For the cases $t=0,1,2$ we study, it is possible to reach this bound.
Keywords:
biometric cryptosystem, linear code, upper bound.
Citation:
A. A. Belousova, V. I. Nobeleva, N. N. Tokareva, “On codes used in biometrical cryptosystems”, Prikl. Diskr. Mat. Suppl., 2018, no. 11, 105–106
Linking options:
https://www.mathnet.ru/eng/pdma414 https://www.mathnet.ru/eng/pdma/y2018/i11/p105
|
Statistics & downloads: |
Abstract page: | 200 | Full-text PDF : | 45 | References: | 25 |
|