An efficient routing protocol for anonymous networks

Roman Schlegel; Duncan S. Wong

doi:10.1109/WCINS.2010.5541798

An efficient routing protocol for anonymous networks

Roman Schlegel, Duncan S. Wong

Department of Computer Science

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

1 Citation (Scopus)

Abstract

Most existing anonymous networks focus on providing strong anonymity at the price of having lower bandwidth, higher latency and degraded usability. They also often anonymize only a few specific applications. In this paper, we propose a new approach of constructing an anonymous network. The network consists of an overlay network, which provides anonymity to all applications running on top of it, and a routing protocol, which can be considered as an anonymized version of path vector routing. The protocol preserves the high performance characteristics of path vector routing and also has the added advantage of hiding the overlay network topology. © 2010 IEEE.

Original language	English
Title of host publication	Proceedings - 2010 IEEE International Conference on Wireless Communications, Networking and Information Security, WCNIS 2010
Pages	349-353
DOIs	https://doi.org/10.1109/WCINS.2010.5541798
Publication status	Published - 2010
Event	2010 IEEE International Conference on Wireless Communications, Networking and Information Security, WCNIS 2010 - Beijing, China Duration: 25 Jun 2010 → 27 Jun 2010

Conference

Conference	2010 IEEE International Conference on Wireless Communications, Networking and Information Security, WCNIS 2010
Place	China
City	Beijing
Period	25/06/10 → 27/06/10

Research Keywords

Anonymity
Anonymous routing
Privacy

Access Output

10.1109/WCINS.2010.5541798

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{e5c35899edec4f37a69749dcdc737fd7,

title = "An efficient routing protocol for anonymous networks",

abstract = "Most existing anonymous networks focus on providing strong anonymity at the price of having lower bandwidth, higher latency and degraded usability. They also often anonymize only a few specific applications. In this paper, we propose a new approach of constructing an anonymous network. The network consists of an overlay network, which provides anonymity to all applications running on top of it, and a routing protocol, which can be considered as an anonymized version of path vector routing. The protocol preserves the high performance characteristics of path vector routing and also has the added advantage of hiding the overlay network topology. {\textcopyright} 2010 IEEE.",

keywords = "Anonymity, Anonymous routing, Privacy",

author = "Roman Schlegel and Wong, {Duncan S.}",

year = "2010",

doi = "10.1109/WCINS.2010.5541798",

language = "English",

isbn = "9781424458516",

pages = "349--353",

booktitle = "Proceedings - 2010 IEEE International Conference on Wireless Communications, Networking and Information Security, WCNIS 2010",

note = "2010 IEEE International Conference on Wireless Communications, Networking and Information Security, WCNIS 2010 ; Conference date: 25-06-2010 Through 27-06-2010",

}

Schlegel, R & Wong, DS 2010, An efficient routing protocol for anonymous networks. in Proceedings - 2010 IEEE International Conference on Wireless Communications, Networking and Information Security, WCNIS 2010., 5541798, pp. 349-353, 2010 IEEE International Conference on Wireless Communications, Networking and Information Security, WCNIS 2010, Beijing, China, 25/06/10. https://doi.org/10.1109/WCINS.2010.5541798

An efficient routing protocol for anonymous networks. / Schlegel, Roman; Wong, Duncan S.
Proceedings - 2010 IEEE International Conference on Wireless Communications, Networking and Information Security, WCNIS 2010. 2010. p. 349-353 5541798.

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - An efficient routing protocol for anonymous networks

AU - Schlegel, Roman

AU - Wong, Duncan S.

PY - 2010

Y1 - 2010

N2 - Most existing anonymous networks focus on providing strong anonymity at the price of having lower bandwidth, higher latency and degraded usability. They also often anonymize only a few specific applications. In this paper, we propose a new approach of constructing an anonymous network. The network consists of an overlay network, which provides anonymity to all applications running on top of it, and a routing protocol, which can be considered as an anonymized version of path vector routing. The protocol preserves the high performance characteristics of path vector routing and also has the added advantage of hiding the overlay network topology. © 2010 IEEE.

AB - Most existing anonymous networks focus on providing strong anonymity at the price of having lower bandwidth, higher latency and degraded usability. They also often anonymize only a few specific applications. In this paper, we propose a new approach of constructing an anonymous network. The network consists of an overlay network, which provides anonymity to all applications running on top of it, and a routing protocol, which can be considered as an anonymized version of path vector routing. The protocol preserves the high performance characteristics of path vector routing and also has the added advantage of hiding the overlay network topology. © 2010 IEEE.

KW - Anonymity

KW - Anonymous routing

KW - Privacy

UR - http://www.scopus.com/inward/record.url?scp=77957663346&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-77957663346&origin=recordpage

U2 - 10.1109/WCINS.2010.5541798

DO - 10.1109/WCINS.2010.5541798

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 9781424458516

SP - 349

EP - 353

BT - Proceedings - 2010 IEEE International Conference on Wireless Communications, Networking and Information Security, WCNIS 2010

T2 - 2010 IEEE International Conference on Wireless Communications, Networking and Information Security, WCNIS 2010

Y2 - 25 June 2010 through 27 June 2010

ER -

An efficient routing protocol for anonymous networks

Abstract

Conference

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this