Please use this identifier to cite or link to this item:
|dc.title||Improved chaff point generation for vault scheme in bio-cryptosystems|
|dc.identifier.citation||Nguyen, T.H., Wang, Y., Ha, Y., Li, R. (2013). Improved chaff point generation for vault scheme in bio-cryptosystems. IET Biometrics 2 (2) : 48-55. ScholarBank@NUS Repository. https://doi.org/10.1049/iet-bmt.2012.0060|
|dc.description.abstract||Fuzzy vault is the most practical scheme in bio-cryptosystems for the applications in protecting data in the real-world, error-prone environments. The biometric features were used to lock and unlock the secret key, which is encoded in the coefficients of a polynomial equation. The security of the fuzzy vault depends on the infeasibility of the polynomial reconstruction problem. The vault performance can be enhanced by adding more noise (chaff) points to the vault. The existing methods for generating chaff points were time consuming as producing more than 200 chaff points. This paper proposes a new chaff point generation technique for the fuzzy vault in bio-cryptosystems which is less time-consuming for producing more than 200 points. Complexity study shows that our algorithm has a complexity of O(n2), which is a significant improvement over the existing algorithm of the complexity of O(n3). Our experimental results show that the proposed algorithm achieves 14.84 and 41.86 times faster than Clancy's and Khalil-Hani's algorithms in the case of generating 240 chaff points. To generate the same numbers of valid chaff points, our proposed method needs less candidate points than the existing methods. Our proposed algorithm generates 11% more chaff points compared to the Khalil-Hani's algorithm. © The Institution of Engineering and Technology 2013.|
|dc.contributor.department||ELECTRICAL & COMPUTER ENGINEERING|
|Appears in Collections:||Staff Publications|
Show simple item record
Files in This Item:
There are no files associated with this item.
checked on May 17, 2019
WEB OF SCIENCETM
checked on May 8, 2019
checked on May 14, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.