A simple and efficient authentication scheme for mobile satellite communication systems
SUMMARY In this article, the authors shall propose a simple and efficient authentication scheme for mobile satellite communication systems. The proposed scheme can achieve the following security requirements: (S1) withstand impersonation attacks; (S2) withstand denial server attacks; (S3) withstand...
Uložené v:
| Vydané v: | International journal of satellite communications and networking Ročník 30; číslo 1; s. 29 - 38 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Chichester, UK
John Wiley & Sons, Ltd
01.01.2012
|
| Predmet: | |
| ISSN: | 1542-0973, 1542-0981 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | SUMMARY
In this article, the authors shall propose a simple and efficient authentication scheme for mobile satellite communication systems. The proposed scheme can achieve the following security requirements: (S1) withstand impersonation attacks; (S2) withstand denial server attacks; (S3) withstand smart card loss attacks; (S4) withstand replay attacks; and (S5) withstand stolen‐verifier attacks, and achieve the following functionality requirements: (F1) freely choose identity; (F2) provide mutual authentication; (F3) provide session key agreement; (F4) provide user anonymity; and (F5) provide perfect forward secrecy. In additional, the proposed scheme does not use the high complex computation, such as public key cryptosystem or secret key cryptosystem, for the mobile users' side. The proposed scheme is only based on hash functions and exclusive‐OR operations. Compared with other schemes, the proposed scheme has a lower computation cost. It is more simple and efficient scheme. Copyright © 2011 John Wiley & Sons, Ltd.
The authors proposed a simple and efficient authentication scheme for mobile satellite communication systems. The proposed scheme can achieve some security requirements and functionality requirements. The proposed scheme is only based on hash functions and exclusive‐OR operations. Compared with other schemes, the proposed scheme has a lower computation cost. |
|---|---|
| Bibliografia: | istex:AD5D2A5D43A43DF95038E2E6E861BF980EA03610 ArticleID:SAT993 ark:/67375/WNG-M9F6VJHJ-5 National Science Council, Taiwan - No. NSC 99-2221-E-030-022 |
| ISSN: | 1542-0973 1542-0981 |
| DOI: | 10.1002/sat.993 |