Name
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-17610-4_18 | Communications in Computer and Information Science |
Keywords | Field | DocType |
One Time Password,Lamport Hashing,Nested Hash Chains,Authentication's Factors | SHA-2,Hash tree,Rainbow table,Double hashing,Computer science,Parallel computing,Cryptographic hash function,Merkle tree,Hash function,Hash chain,Distributed computing | Conference |
Volume | ISSN | Citations |
122 | 1865-0929 | 3 |
PageRank | References | Authors |
0.43 | 12 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mohamed Hamdy Eldefrawy | 1 | 42 | 5.40 |
| Muhammad Khurram Khan | 2 | 3538 | 204.81 |
| Khaled Alghathbar | 3 | 498 | 32.54 |