Abstract
Although mobility support protocols such as Mobile IPv6 and LIN6 are essential for a real mobile computing environment, there is an privacy issue: these protocols have to disclose an identity of the node to receive the benefit of mobility support. In this paper, we attempt to address this issue by assigning an identity to a mobile node dynamically and securely without disclosing the statically-assigned ID of the node in the LIN6 protocol. In our method, a mobile node generates an ephemeral public/private key pair and decides a LIN6 ID that is given by a hash of the public key. This LIN6 ID is called “anonymized LIN6 ID”. Then the mobile node requests to assign this ID dynamically to the Mapping Agent that maintains location information of the ID. The Mapping Agent issues a shared secret for updating the location information to the mobile node by using the public key. A mobile node can discard the ID or request a new ID whenever the node wants, thus it is hard to track the mobile node with the anonymized LIN6 ID. We also discuss the characteristics of anonymity and the potential of DoS attack in our proposed method.
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
Johnson, D.B., Perkins, C., Arkko, J.: Mobility Support in IPv6 (2003), (Internetdraft)
Ishiyama, M., Kunishi, M., Uehara, K., Esaki, H., Teraoka, F.: LINA: A New Approach to Mobility Support in Wide Area Networks. IEICE Transactions on Communications E84-B (2001)
Hinden, R., O’Dell, M., Deering, S.: An IPv6 Aggregatable Global Unicast Address Format, RFC 2374 (1998)
Mockapetris, P.: Domain names - concepts and facilities, RFC 1034 (1987)
Balakrishnan, H., Jung, J., Sit, E., Morris, R.: Dns performance and the effectiveness of caching. In: Proceedings of the ACM SIGCOMM Internet Measurement Workshop 2001, ACM, New York (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceeding of ACM SIGCOMM, ACM, New York (2001)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: Proceedings of ACM SIGCOMM (2001)
Zhao, B.Y., Kubiatowicz, J., Joseph, A.D.: Tapestry: An infrastructure for faulttolerant wide-area location and routing. In: Technical Report UCB CSD 01-1141, University of California at Berkeley, Computer Science Department (2001)
Draves, R.: Default Address Selection for Internet Protocol version 6 (IPv6), RFC 3077 (2003)
Postel, J., Reynolds, J.: File Transfer Protocol, RFC 959 (1985)
Juels, A., Brainard, J.: Client puzzles: A cryptographic defense against connection depletion attacks. In: Proceedings of Network and Distributed System Security (NDSS 1999), pp. 151–165 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ishiyama, M., Kunishi, M., Kohno, M., Teraoka, F. (2004). Secured Anonymous ID Assignment Support for LIN6. In: Kahng, HK., Goto, S. (eds) Information Networking. Networking Technologies for Broadband and Mobile Networks. ICOIN 2004. Lecture Notes in Computer Science, vol 3090. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25978-7_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-25978-7_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23034-2
Online ISBN: 978-3-540-25978-7
eBook Packages: Springer Book Archive