2.50
Hdl Handle:
http://hdl.handle.net/10547/279413
Title:
Infinite alphabet passwords: a unified model for a class of authentication systems
Authors:
Gibson, Marcia; Conrad, Marc; Maple, Carsten
Abstract:
In the paper we propose a formal model for class of authentication systems termed, “Infinite Alphabet Password Systems” (IAPs). We define such systems as those that use a character set for the construction of the authentication token that is theoretically infinite, only bound by practical implementation restrictions. We find that the IAP architecture can feasibly be adapted for use in many real world situations, and may be implemented using a number of system architectures and cryptographic protocols. A security analysis is conducted on an implementation of the model that utilizes images for its underlying alphabet. As a result of the analysis we find that IAPs can offer security benefits over traditional alphanumeric password schemes. In particular some of the significant problems concerning phishing, pharming, replay, dictionary and offline brute force attacks are mitigated.
Citation:
Gibson, M.; Conrad, M. and Maple, C., (2010) 'Infinite alphabet passwords: A unified model for a class of authentication systems, Security and Cryptography (SECRYPT), Proceedings of the 2010 International Conference on, pp. 1-6
Publisher:
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date:
2010
URI:
http://hdl.handle.net/10547/279413
Additional Links:
http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=5741682&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D5741682
Type:
Conference papers, meetings and proceedings
Language:
en
Appears in Collections:
Centre for Research in Distributed Technologies (CREDIT)

Full metadata record

DC FieldValue Language
dc.contributor.authorGibson, Marciaen_GB
dc.contributor.authorConrad, Marcen_GB
dc.contributor.authorMaple, Carstenen_GB
dc.date.accessioned2013-04-08T21:32:08Z-
dc.date.available2013-04-08T21:32:08Z-
dc.date.issued2010-
dc.identifier.citationGibson, M.; Conrad, M. and Maple, C., (2010) 'Infinite alphabet passwords: A unified model for a class of authentication systems, Security and Cryptography (SECRYPT), Proceedings of the 2010 International Conference on, pp. 1-6en_GB
dc.identifier.urihttp://hdl.handle.net/10547/279413-
dc.description.abstractIn the paper we propose a formal model for class of authentication systems termed, “Infinite Alphabet Password Systems” (IAPs). We define such systems as those that use a character set for the construction of the authentication token that is theoretically infinite, only bound by practical implementation restrictions. We find that the IAP architecture can feasibly be adapted for use in many real world situations, and may be implemented using a number of system architectures and cryptographic protocols. A security analysis is conducted on an implementation of the model that utilizes images for its underlying alphabet. As a result of the analysis we find that IAPs can offer security benefits over traditional alphanumeric password schemes. In particular some of the significant problems concerning phishing, pharming, replay, dictionary and offline brute force attacks are mitigated.en_GB
dc.language.isoenen
dc.publisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INCen_GB
dc.relation.urlhttp://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=5741682&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D5741682en_GB
dc.subjectauthenticationen_GB
dc.subjectdictionariesen_GB
dc.subjectsemanticsen_GB
dc.titleInfinite alphabet passwords: a unified model for a class of authentication systemsen
dc.typeConference papers, meetings and proceedingsen
All Items in UOBREP are protected by copyright, with all rights reserved, unless otherwise indicated.