Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/1316
Title: | SECURING RETINAL TEMPLATE USING QUASIGROUPS |
Authors: | Radha N Rubya T Karthikeyan S |
Keywords: | Special Issue of Security Issues and Solutions for Information Computer and Networks Journal of Advances in Information Technology (JAIT) |
Issue Date: | May-2011 |
Publisher: | Special Issue of Security Issues and Solutions for Information, Computer and Networks, Journal of Advances in Information Technology (JAIT) |
Abstract: | Biometric plays important role in person recognition and identification. It is more secure than the traditional systems like password and token-based systems. The traditional systems can be stolen, misplaced or destroyed. But the biometric systems are based on the physiological or behavioral traits of the individual human being. It cannot be altered or misused by the unauthorized persons. It is more reliable than the traditional systems. Although it is powerful, immutable to vulnerable attacks So it is necessary to secure the biometric template using more efficient techniques. Cryptography is the most powerful technique to avoid vulnerable attacks. Recently it was found that the non-associative property of quasigroup helps achieving better security by having a randomly generated key for encr1yption. The operations involved in Quasigroup are computationally simple and can be efficiently used for protection of voluminous media like images, audio, video and different forms of multimedia in this paper the Quasigroup technique is used to provide better security to Retina Template |
URI: | http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.348.5502&rep=rep1&type=pdf http://localhost:8080/xmlui/handle/123456789/1316 |
ISSN: | 1798-2340 |
Appears in Collections: | International Journals |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
SECURING RETINAL TEMPLATE USING QUASIGROUPS.docx | 10.48 kB | Microsoft Word XML | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.