In this article, we shall propose an efficient anonymous channel protocol for wireless communications. The most important feature of our proposed protocol has the property of untraceability. In our scheme, the mobile stations (MSs) and the home network (HN) must authenticate each other. Moreover, the HN is untraceable in such a way that supports location anonymity and MSs identity anonymity for MSs roaming, dynamic channel assignment and broadcasting. Compare our protocol with Juang et al.'s protocol, our mobile agent communication cost is 3m which is more efficient than the Juang et al.'s protocol 5m. At the same time, our mobile agent computation cost is 2Th which is also more efficient than the Juang et al.'s protocol 1Tpublic+1Th. We can avoid employing public key cryptography in the anonymous channel ticket authentication phase since to keep the computation cost down.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Jinn-Ke JAN, Whe Dar LIN, "An Efficient Anonymous Channel Protocol in Wireless Communications" in IEICE TRANSACTIONS on Communications,
vol. E84-B, no. 3, pp. 484-491, March 2001, doi: .
Abstract: In this article, we shall propose an efficient anonymous channel protocol for wireless communications. The most important feature of our proposed protocol has the property of untraceability. In our scheme, the mobile stations (MSs) and the home network (HN) must authenticate each other. Moreover, the HN is untraceable in such a way that supports location anonymity and MSs identity anonymity for MSs roaming, dynamic channel assignment and broadcasting. Compare our protocol with Juang et al.'s protocol, our mobile agent communication cost is 3m which is more efficient than the Juang et al.'s protocol 5m. At the same time, our mobile agent computation cost is 2Th which is also more efficient than the Juang et al.'s protocol 1Tpublic+1Th. We can avoid employing public key cryptography in the anonymous channel ticket authentication phase since to keep the computation cost down.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e84-b_3_484/_p
Copy
@ARTICLE{e84-b_3_484,
author={Jinn-Ke JAN, Whe Dar LIN, },
journal={IEICE TRANSACTIONS on Communications},
title={An Efficient Anonymous Channel Protocol in Wireless Communications},
year={2001},
volume={E84-B},
number={3},
pages={484-491},
abstract={In this article, we shall propose an efficient anonymous channel protocol for wireless communications. The most important feature of our proposed protocol has the property of untraceability. In our scheme, the mobile stations (MSs) and the home network (HN) must authenticate each other. Moreover, the HN is untraceable in such a way that supports location anonymity and MSs identity anonymity for MSs roaming, dynamic channel assignment and broadcasting. Compare our protocol with Juang et al.'s protocol, our mobile agent communication cost is 3m which is more efficient than the Juang et al.'s protocol 5m. At the same time, our mobile agent computation cost is 2Th which is also more efficient than the Juang et al.'s protocol 1Tpublic+1Th. We can avoid employing public key cryptography in the anonymous channel ticket authentication phase since to keep the computation cost down.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - An Efficient Anonymous Channel Protocol in Wireless Communications
T2 - IEICE TRANSACTIONS on Communications
SP - 484
EP - 491
AU - Jinn-Ke JAN
AU - Whe Dar LIN
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E84-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2001
AB - In this article, we shall propose an efficient anonymous channel protocol for wireless communications. The most important feature of our proposed protocol has the property of untraceability. In our scheme, the mobile stations (MSs) and the home network (HN) must authenticate each other. Moreover, the HN is untraceable in such a way that supports location anonymity and MSs identity anonymity for MSs roaming, dynamic channel assignment and broadcasting. Compare our protocol with Juang et al.'s protocol, our mobile agent communication cost is 3m which is more efficient than the Juang et al.'s protocol 5m. At the same time, our mobile agent computation cost is 2Th which is also more efficient than the Juang et al.'s protocol 1Tpublic+1Th. We can avoid employing public key cryptography in the anonymous channel ticket authentication phase since to keep the computation cost down.
ER -