Abstract
Wireless network applications mostly authenticate clients with an identity / password or pin. OTP authentication schemes have developed based on time synchronization or one-way hash functions, although they can be trouble some and they have a high computational complexity. The current paper provides secure authentication for low-power wireless devices and other applications requiring authentication that is secure against passive attacks based on replaying captured and reusable passwords. In addition, our scheme highly minimizes the computational and transmission complexity and solves time or sequence synchronization problems by applying non-group cellular automata, based on the non-reversibility and uniqueness of the state configuration.
This work was supported by the Brain Korea 21 Project in 2005.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
IEEE Standard 802.11. Wireless LAN medium access control (MAC) and physical layer (PHY) specification IEEE Draft Standard (1996)
Perkins, C.: IP mobility support. Internet Request for Comments 2002 (1996)
Menezes, A.J., Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)
Lamport, L.: Password Authentication with Insecure Communication. Communication of ACM 24, 770–772 (1981)
Haller, N.: The S/KEY One-Time Password System. In: Proc. of the ISOC Symposium on Network and Distributed System Security. University of Illinois Press (1994)
Soh, B., Joy, A.: A Novel Web Security Evaluation Model for a One Time Password System. In: Proc. of the IEEE/WIC International Conference on Web Intelligence (2003)
Von Neumann, J.: The theory of self-reproducing automata. University of Illinois Press, Urbana (1966)
Jeon, J.C., Yoo, K.Y.: Design of Montgomery Multiplication Architecture based on Programmable Cellular Automata. Computational intelligence 20, 495–502 (2004)
Seredynski, M., Pienkosz, K., Bouvry, P.: Reversible Cellular Automata Based Encryption. In: Jin, H., Gao, G.R., Xu, Z., Chen, H. (eds.) NPC 2004. LNCS, vol. 3222, pp. 411–418. Springer, Heidelberg (2004)
Das, S., Sikdar, B.K., Pal Chaudhuri, P.: Characterization of Reachable/Nonreachable Cellular Automata States. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds.) ACRI 2004. LNCS, vol. 3305, pp. 813–822. Springer, Heidelberg (2004)
Koc, C.K., Apohan, A.M.: Inversion of cellular automata iterations. IEE Proc. Comput. Digit. Tech. 144, 279–284 (1997)
Seredynski, M., Bouvry, P.: Block Encryption Using Reversible Cellular Automata. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds.) ACRI 2004. LNCS, vol. 3305, pp. 785–792. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jeon, JC., Kim, KW., Yoo, KY. (2006). Non-group Cellular Automata Based One Time Password Authentication Scheme in Wireless Networks. In: Burmester, M., Yasinsac, A. (eds) Secure Mobile Ad-hoc Networks and Sensors. MADNES 2005. Lecture Notes in Computer Science, vol 4074. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11801412_10
Download citation
DOI: https://doi.org/10.1007/11801412_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36646-1
Online ISBN: 978-3-540-37863-1
eBook Packages: Computer ScienceComputer Science (R0)