International Journal of Information Technology & Computer Science ( IJITCS )
This paper analyzes the usage of fuzzy matching scheme, a fuzzy commitment scheme that allows input to be slightly different by value, not by bits, in two approaches, the one with the moduli are carefully selected to accommodate the secret value and the other one with the moduli are freely selected. The first approach is not subject to error in the reconstruction of the value using Chinese remainder theorem but the secret domain is reduced by the protocol while the second approach has a small chance in failing to reconstruct the secret value but does not suffer the reduction of the secret domain.
: fuzzy commitment; fuzzy matching; fuzzy authentication
- B. Schneier, Applied Cryptography, Wiley, 1996
- A. Juels and M. Wattenberg, “A Fuzzy Commitment Scheme,” in Proceedings of the 6th ACM Conference on Computer and Communications Security (ACM CCS ’99), pp. 28-36, November 1-4 1999, Singapore.
- A. Satienjarurat and N. Premasathian, “Fuzzy Matching of Objects using Fuzzy Commitment,” 2009 6th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications, and Information Technology (ECTI-CON 2009), pp. 622-625, May 6-9 2009, Chonburi, Thailand.
- A. A. Al-saggaf and H. S. Acharya, “A Fuzzy Commitment Scheme,” in Proc. of IEEE International conference on Advances in Computer Vision and Information Technology (ACVIT), November 28-30, 2007, Aurangabad, India.
- D. B. Ojha and A. Sharm, “A Fuzzy Commitment Scheme with McEliece's Cipher,” Surveys in Mathematics and its Applications Vol. 5, 2010, pp. 73–82
- T. Ignatenko and F. M. J. Willems, “Information Leakage in Fuzzy Commitment Schemes,” IEEE Transactions on Information Forensics and Security, Vol. 5, No. 2, June 2010, pp. 337-348.