Abstract
This paper proposes an efficient authentication protocol for wireless networks based on group and non-group cellular automata (CA). Most previous protocols employed typical cryptosystems such as symmetric and asymmetric encryptions in spite of their high computation and communication cost. In addition, previous protocols are problematic in that the mobile user copies his/her anonymous ticket and shares it with friends. We propose an efficient and secure authentication protocol which provides a mobile user’s anonymity and which has a low computation cost to withstand the above weakness without employing any typical cryptosystems.
This work was supported by the Brain Korea 21 Project in 2005.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
ETSI/TC Recommendation GSM 03.20, Security related network function, Tech. Rep. (1991)
Yang, C.C., Chang, T.Y., Hwang, M.S.: A new anonymous conference key distribution system based on the elliptic curve discrete logarithm problem. Computer Standards and Interfaces 25, 141–145 (2003)
Chang, C.C., Lai, Y.P.: A flexible date attachment scheme on e-cash. Computers and Security 22(2), 160–166 (2003)
Jan, J.K., Tai, C.C.: A secure electronic voting protocol with ic cards. Journal of Systems and Software 39, 93–101 (1997)
Lin, W.D., Jan, J.K.: A wireless-based authentication and anonymous schannels for large scale area. In: Proc. 6th IEEE Symposium on Computers and Communications (ISCC 2001), pp. 36–41 (2001)
Barbancho, A.M., Peinado, A.: Cryptanalysis of anonymous channel protocol for large-scale area in wireless communications. Computer Networks 43, 777–785 (2003)
Yang, C.C., Tang, Y.L., Wang, R.C., Yang, H.W.: A secure and efficient authentication protocol for anonymous channel in wireless communications. Applied Mathematics and Computation, article in press (2005)
Von Neumann, J.: The theory of self-reproducing automata. University of Illinois Press, Urbana and London (1966)
Jeon, J.C., Yoo, K.Y.: Design of Montgomery Multiplication Architecture based on Programmable Cellular Automata. Computational intelligence 20, 495–502 (2004)
Seredynski, F., Bourry, P., Zomaya, A.Y.: Cellular automata computations and secret key cryptography. Parallel Computing 30, 753–766 (2004)
Alonso-Sanz, R., Martin, M.: One-dimensional cellular automata with memory: patterns from a single site seed. Int. J. Bifur. Chaos Appl. Sci. Engrg. 12, 205–226 (2002)
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.: Charaterization 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)
Das, A.K., Ganguly, A., Dasgupta, A., Bhawmik, S., Chaudhuri, P.P.: Efficient characterization of cellular automata. IEE proceedings 137(1), 81–87 (1990)
Koc, C.K., Apohan, A.M.: Inversion of cellular automata iterations. IEE Proc. Comput. Digit. Tech. 144, 279–284 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jeon, JC., Kim, KW., Yoo, KY. (2005). Low-Complexity Authentication Scheme Based on Cellular Automata in Wireless Network. In: Jia, X., Wu, J., He, Y. (eds) Mobile Ad-hoc and Sensor Networks. MSN 2005. Lecture Notes in Computer Science, vol 3794. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11599463_41
Download citation
DOI: https://doi.org/10.1007/11599463_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30856-0
Online ISBN: 978-3-540-32276-4
eBook Packages: Computer ScienceComputer Science (R0)