The N/R one time password system
- Authors
- Goyal, V.; Abraham, A.; Sanyal, S.; Han, S.Y.
- Issue Date
- Apr-2005
- Citation
- International Conference on Information Technology: Coding and Computing, ITCC, v.1, pp 733 - 738
- Pages
- 6
- Journal Title
- International Conference on Information Technology: Coding and Computing, ITCC
- Volume
- 1
- Start Page
- 733
- End Page
- 738
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/65518
- ISSN
- 0000-0000
- Abstract
- A new one time password system is described which is secure against eavesdropping and server database compromise at the same time. Traditionally, these properties have proven to be difficult to satisfy at the same time and only one previous scheme i.e. Lamport Hashes also called S/KEY one time password system has claimed to achieve that. Lamport hashes however have a limitation that they are computationally intensive for the client and the number of times a client may login before the system should be re-initialized is small. We address these limitations to come up with a new scheme called the N/R one time password system. The basic idea is have the server aid the client computation by inserting 'breakpoints' in the hash chains. Client computational requirements are dramatically reduced without any increase in the server computational requirements and the number of times a client may login before the system has to be re-initialized is also increased significantly. The system is particularly suited for mobile and constrained devices having limited computational power. © 2005 IEEE.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Software > School of Computer Science and Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.