DSpace

King Saud University Repository >
King Saud University >
COLLEGES >
Science Colleges >
College of Computer and Information Sciences >
College of Computer and Information Sciences >

Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/15381

Title: One-Time Password System with Infinite Nested Hash Chains
Authors: Mohamed Hamdy Eldefrawy
Muhammad Khurram Khan
Khaled Alghathbar
Keywords: One Time Password
Lamport Hashing
Nested Hash Chains
Authentication’s Factors
Issue Date: 2010
Publisher: Springer Link
Abstract: Hash chains have been used as OTP generators. Lamport hashes have an intensive computation cost and a chain length restriction. A solution for signature chains addressed this by involving public key techniques, which increased the average computation cost. Although a later idea reduced the user computation by sharing it with the host, it couldn’t overcome the length limitation. The scheme proposed by Chefranov to eliminate the length restriction had a deficiency in the communication cost overhead. We here present an algorithm that overcomes all of these shortcomings by involving two different nested hash chains: one dedicated to seed updating and the other used for OTP production. Our algorithm provides forward and non-restricted OTP generation. We propose a random challenge–response operation mode. We analyze our proposal from the viewpoint of security and performance compared with the other algorithms.
URI: http://hdl.handle.net/123456789/15381
Appears in Collections:College of Computer and Information Sciences

Files in This Item:

File Description SizeFormat
Alghathbar_conf_6.docx12.68 kBMicrosoft Word XMLView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

DSpace Software Copyright © 2002-2007 MIT and Hewlett-Packard - Feedback