Browse > Article
http://dx.doi.org/10.6109/JKIICE.2009.13.1.81

The Password base System for the safe and Efficient Identification  

Park, Jong-Min (조선이공대학 U-사이버보안과)
Park, Byung-Jun (조선대학교)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.13, no.1, 2009 , pp. 81-86 More about this Journal
Abstract
Almost all network systems provide an authentication mechanism based on user ID and password. In such system, it is easy to obtain the user password using a sniffer program with illegal eavesdropping. The one-time password and challenge-response method are useful authentication schemes that protect the user passwords against eavesdropping. In client/server environments, the one-time password scheme using time is especially useful because it solves the synchronization problem. In this paper, we propose a new identification scheme One Pass Identification. The security of Password base System is based on the square root problem, and Password base System is secure against the well known attacks including pre-play attack, off-line dictionary attack and server comprise. A number of pass of Password base System is one, and Password base System processes the password and does not need the key. We think that Password base System is excellent for the consuming time to verify the prover.
Keywords
Identification; password base; Challenge-Response; square root problem;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Andreoni, J. and H. Varian, "Pre-play Contracting in the Prisoners' Dilemma", mimeo, University of Wisconsin, 1999
2 Bensaid, B. and R.J. Gary-Bobo, 'An Exact Formula for the Lion's Share: A Model of Pre-Play Negotiation,' Games and Economic Behavior, 14, pp 44~89, 1996   DOI   ScienceOn
3 Neil Haller. The s/key(tm) one-time password system. In Proceedings of the 1994 Symposium on Network and Distributed System Security, pp 151~157, 1994
4 Neil Haller. The s/key(tm) one-time password system. Symposium on Network and Distributed System Security, pp 151~157, February 1994
5 H. Woll, "Reductions among number theoretic problems, Information and Computation, Vol. 72, pp. 167-179, 1987   DOI
6 A. Hill, A. D. Brett, and C. J. Taylor, "Automatic landmark identification using a new method of non-rigid correspondence" in Proceedings of IPMI '97 Conference, vol. 1230, pp. 483~488,1997
7 Jong-Min Park, Yong-Hun Kim, Beom-Joon Cho, "Password System Enhancing the Security against", The Korean Institute of Maritime Information & Communication Science, Vol. 8, No. 8, pp.2004
8 P. MacKenzie, "The PAK suites: Protocols for Password-Authenticated Key Exchange", 2002
9 E. Moulines, P. Duhamel, J.F. Cardoso, and S. Mayrargue, Subspace methods for the blind identification of multichannel fir filters, IEEE Transactions on Signal Processing, SP-43, pp. 516~525, 1995
10 E. Bach, Algorithmic Number Theory, Volumn 1: Efficient Algorithms, MIT Press, Cambridge Massachusetts, 1996
11 E. Biham and A. Shamir, "Differential Cryptanalysis of DES-like cryptosystems", Advances in Cryptology - CRYPTO '90, LNCS 537, pp. 2-21
12 Jong-Min Park, "Efficient and Secure Authenticated Key Exchange", The Korean Institute of Maritime Information & Communication Science, Vol. 3, No. 3, pp.2005
13 Bao, F., R. Deng and W. Mao. Efficient and practical fair exchange protocols with off-line TTP. 1998 IEEE Symposium on Security and Privacy. Oakland, IEEE Compute Society. pp 77~85. 1998
14 B. Schneier, Applied cryptography, John Wiley & Sons, 1996
15 A. W. Senior and A. J. Robinson. An off-line cursive handwriting recognition system. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(3) pp309~321, 1998   DOI   ScienceOn