Abstract
Anonymous routing where data packets can be routed efficiently while hiding the topology of the network from all nodes is a crucial part of achieving anonymity in an efficient anonymous network. Traditional routing protocols leak network topology information to nodes while existing anonymous routing protocols do not provide authentication for routing information. A malicious node can arbitrarily reduce the path cost value carried in an anonymous route announcement message for the purpose of negatively influencing routing efficiency or facilitating launching various attacks such as eavesdropping or man-in-the-middle attacks. In this paper we propose a generic scheme and a concrete instantiation to transform a routing protocol into an authenticated one in the sense that the path cost cannot be reduced by a malicious node.
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
Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514–532. Springer, Heidelberg (2001)
Boukerche, A., El-Khatib, K., Xu, L., Korba, L.: A novel solution for achieving anonymity in wireless ad hoc networks. In: Ould-Khaoua, M., Zambonelli, F. (eds.) PE-WASUN, pp. 30–38. ACM Press, New York (2004)
El-Khatib, K., Korba, L., Song, R., Yee, G.: Secure dynamic distributed routing algorithm for ad hoc wireless networks. In: International Conference on Parallel Processing Workshops (ICPPW 2003), pp. 359–366 (2003)
Goldwasser, S., Micali, S., Rivest, R.: A digital signature scheme secure against adaptive chosen-message attack. SIAM J. Computing 17(2), 281–308 (1988)
Kent, S., Lynn, C., Seo, K.: Secure Border Gateway Protocol (S-BGP). IEEE Journal on Selected Areas in Communications 18(4), 582–592 (2000)
Kent, S.T., Lynn, C., Mikkelson, J., Seo, K.: Secure Border Gateway Protocol (S-BGP) - Real World Performance and Deployment Issues. In: NDSS (2000)
Lynn, B.: PBC Library, http://crypto.stanford.edu/pbc/
Murphy, S.: BGP Security Vulnerabilities Analysis. RFC 4272 (Informational) (January 2006)
Papadimitratos, P., Haas, Z.: Secure routing for mobile ad hoc networks. In: SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS 2002), San Antonio, TX, pp. 01–27 (2002)
Rajendran, T., Sreenaath, K.V.: Secure anonymous routing in ad hoc networks. In: Shyamasundar, R.K. (ed.) Bangalore Compute. Conf., p. 19. ACM Press, New York (2008)
Rekhter, Y., Li, T., Hares, S.: A Border Gateway Protocol 4 (BGP-4). RFC 4271 (Draft Standard) (January 2006)
Schlegel, R., Wong, D.S.: Low Latency High Bandwidth Anonymous Overlay Network with Anonymous Routing. Cryptology ePrint Archive, Report 2009/294 (2009), http://eprint.iacr.org/
Wan, T., Kranakis, E., Van Oorschot, P.C.: Pretty Secure BGP (psBGP). In: NDSS (2005)
White, R.: Securing BGP through secure origin BGP (soBGP). Business Communications Review 33, 47–53 (2003)
Zhang, Y., Liu, W., Lou, W.: Anonymous communications in mobile ad hoc networks. In: INFOCOM, pp. 1940–1951. IEEE, Los Alamitos (2005)
Zhu, B., Wan, Z., Kankanhalli, M., Bao, F., Deng, R.: Anonymous Secure Routing in Mobile Ad-Hoc Networks. In: 29th Annual IEEE International Conference on Local Computer Networks, 2004, pp. 102–108 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schlegel, R., Wong, D.S. (2009). Monotonically Increasing Bit Vector for Authenticated Anonymous Routing. In: Ślęzak, D., Kim, Th., Chang, A.CC., Vasilakos, T., Li, M., Sakurai, K. (eds) Communication and Networking. FGCN 2009. Communications in Computer and Information Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10844-0_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-10844-0_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10843-3
Online ISBN: 978-3-642-10844-0
eBook Packages: Computer ScienceComputer Science (R0)