TY - GEN
T1 - Monotonically increasing bit vector for authenticated anonymous routing
AU - Schlegel, Roman
AU - Wong, Duncan S.
PY - 2009
Y1 - 2009
N2 - 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. © 2009 Springer-Verlag Berlin Heidelberg.
AB - 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. © 2009 Springer-Verlag Berlin Heidelberg.
UR - http://www.scopus.com/inward/record.url?scp=73349120910&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-73349120910&origin=recordpage
U2 - 10.1007/978-3-642-10844-0_12
DO - 10.1007/978-3-642-10844-0_12
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 9783642108433
VL - 56
T3 - Communications in Computer and Information Science
SP - 89
EP - 96
BT - Communication and Networking
ER -