17th International Workshop on Database and Expert Systems Applications (DEXA'06) (2006)
Sept. 4, 2006 to Sept. 8, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DEXA.2006.137
Arjan Durresi , Louisiana State University, USA
Vamsi Paruchuri , Louisiana State University, USA
Leonard Barolli , Fukuoka Institute of Technology, Japan
Raj Jain , Washington University in St. Louis, USA
Makoto Takizawa , Tokyo Denki University, Japan
With the growth and acceptance of the Internet, there has been increased interest in maintaining anonymity in the network. Using traffic analysis, it is possible to infer who is talking to whom over a public network. This work develops a novel approach to hide the senders and the receivers of messages. Routes are chosen and frames traverse these routes. Each frame consists of a token and a node can send a message through a frame only when the corresponding token is free. The best thing about our protocol is that it poses no bandwidth overhead when there is at least some traffic while posing minimal bandwidth overhead when there is no traffic at all.
R. Jain, V. Paruchuri, M. Takizawa, L. Barolli and A. Durresi, "Tokens for Anonymous Communications in the Internet," 17th International Workshop on Database and Expert Systems Applications (DEXA'06)(DEXA), Krakow, Poland, 2006, pp. 83-90.