Methods of reducing bio-cryptographic algorithms computational complexity

被引:0
|
作者
Velciu, Marius-Alexandru [1 ,2 ]
Patriciu, Victor-Valeriu [1 ]
机构
[1] Mil Tech Acad, Dept Comp Sci, Bucharest, Romania
[2] Adv Technol Inst, Bucharest, Romania
关键词
bio-cryptographic algorithms; biometric encryption; Fuzzy Vault scheme; Reed-Solomon error correcting codes; Lagrange Interpolation; shared biocryptograms; FUZZY VAULT;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Traditional biometric systems have always been regarded with skepticism, due to the uniqueness and universality features of human biometrics once stolen or compromised, they cannot be safely replaced. For this reason, common efforts of Cryptography and biometric systems researchers gave birth to Bio-cryptography, a domain which proposes to overcome the main security issues associated with biometrics usage, by generating or securing existing cryptographic keys, using biometric data. The main advantages brought by Bio-cryptography are represented by eliminating the need for storing biometric templates and the flexibility of resulted bio-cryptograms. On the other hand, one major drawback concerning bio-cryptographic algorithms is their high consumption of computational resources, caused by the various mathematical processing and large amounts of data used. This paper proposes two methods of reducing bio-cryptographic algorithms computational complexity: the usage of error-correcting codes in the secret key recovery stage and the shared biocryptograms approach for the entire biometric encryption process.
引用
收藏
页码:153 / 158
页数:6
相关论文
共 50 条
  • [31] COMPUTATIONAL COMPLEXITY OF PARTITIONED LIST ALGORITHMS
    MORREALE, E
    IEEE TRANSACTIONS ON COMPUTERS, 1970, C 19 (05) : 421 - &
  • [32] On the computational complexity of the LBG and PNN algorithms
    Shanbehzadeh, J
    Ogunbona, PO
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 1997, 6 (04) : 614 - 616
  • [33] The Computational Complexity of Extrapolation Methods
    Ilie, Silvana
    Corless, Robert M.
    Essex, Chris
    MATHEMATICS IN COMPUTER SCIENCE, 2009, 2 (04) : 557 - 566
  • [34] A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems
    Véronique Cortier
    Steve Kremer
    Bogdan Warinschi
    Journal of Automated Reasoning, 2011, 46 : 225 - 259
  • [35] A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems
    Cortier, Veronique
    Kremer, Steve
    Warinschi, Bogdan
    JOURNAL OF AUTOMATED REASONING, 2011, 46 (3-4) : 225 - 259
  • [36] Reducing the computational complexity for whole word models
    Soltau, Hagen
    Liao, Hank
    Sak, Hasim
    2017 IEEE AUTOMATIC SPEECH RECOGNITION AND UNDERSTANDING WORKSHOP (ASRU), 2017, : 63 - 68
  • [37] REDUCING MULTIPLICATIVE COMPLEXITY OF POLYNOMIAL ALGEBRA ALGORITHMS
    STASINSKI, R
    IFIP TRANSACTIONS A-COMPUTER SCIENCE AND TECHNOLOGY, 1992, 12 : 268 - 274
  • [38] Another motivation for reducing the randomness complexity of algorithms
    Goldreich O.
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011, 6650 LNCS : 555 - 560
  • [39] Computational Complexity Analysis of Decision Tree Algorithms
    Sani, Habiba Muhammad
    Lei, Ci
    Neagu, Daniel
    ARTIFICIAL INTELLIGENCE XXXV (AI 2018), 2018, 11311 : 191 - 197
  • [40] A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem
    Zachariadis, Emmanouil E.
    Kiranoudis, Chris T.
    COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (12) : 2089 - 2105