Low-Complexity authentication scheme based on cellular automata in wireless network

Authors:
Jun-Cheol Jeon;Kee-Won Kim;Kee-Young Yoo
Affiliations:
Department of Computer Engineeing, Kyungpook National University, Daegu, Korea;Department of Computer Engineeing, Kyungpook National University, Daegu, Korea;Department of Computer Engineeing, Kyungpook National University, Daegu, Korea
Venue:
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Year:
2005

Citing 6
Cited 0

A secure electronic voting protocol with IC cards

Journal of Systems and Software
A new anonymous conference key distribution system based on the elliptic curve discrete logarithm problem

Computer Standards & Interfaces
A Wireless-based Authentication and Anonymous Channels for Large Scale Area

ISCC '01 Proceedings of the Sixth IEEE Symposium on Computers and Communications
Cryptanalysis of anonymous channel protocol for large-scale area in wireless communications

Computer Networks: The International Journal of Computer and Telecommunications Networking
Cellular automata computations and secret key cryptography

Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata

Quantified Score

Hi-index	0.00

Visualization

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.