Design and study of a strong crypto-system model for e-Commerce
ICCC '02 Proceedings of the 15th international conference on Computer communication
Anonymous authentication protocol for GSM networks
International Journal of Security and Networks
On cellular botnets: measuring the impact of malicious devices on a cellular network core
Proceedings of the 16th ACM conference on Computer and communications security
Secure communication among cell phones and sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Improved delegation-based authentication protocol for secure roaming service with unlinkability
IEEE Communications Letters
Synchronization system for crypto initialization over GSM voice channel
SSIP '09/MIV'09 Proceedings of the 9th WSEAS international conference on signal, speech and image processing, and 9th WSEAS international conference on Multimedia, internet & video technologies
Privacy and authentication protocol providing anonymous channels in GSM
Computer Communications
Security and privacy issues for the network of the future
Security and Communication Networks
SecureSMS: A secure SMS protocol for VAS and other applications
Journal of Systems and Software
Hi-index | 0.43 |
With the advance of wireless communications technology, mobile communications has become more convenient than ever. However, because of the openness of wireless communications, the protection of the privacy between communicating parties is becoming a very important issue. We focus on the security of the Global System for Mobile communication (GSM) networks. A secure communication architecture for the GSM network is proposed. In the proposed architecture, we use public-key cryptography for user authentication and stream cipher for message encryption and decryption. An authentication protocol and a key generation method are presented in conjunction with the proposed architecture. Cryptanalysis and operational analysis show that the authentication protocol is secure and efficient. Simulation results indicate that the key generation method can always produce key strings of evenly distributed 0s and 1s and with infinite period.