Name
Abstract | ||
|---|---|---|
This paper presents a Recipient-Anonymous DataDelivery (RAD), tailored and optimized for stable-topology networks. There is one simplistic approach for achieving recipient anonymity. If a message is equally broadcasted to all network entities (e.g., routers and hosts), an adversary cannot infer any traffic patterns for the intended recipient. While this technique is unconditionally secure, no one believes that this is a practical solution except in some special network environments since it requires extremely expensive traffic overhead. In this paper we realize this idea with an efficient multicast protocol by introducing the concept of a public routing proxy. A public routing proxy enables a sender to deliver a message to the intended recipient anonymously since the public routing proxy multicasts the message to a set of k network entities including the intended recipient. Thus, in the proposed protocol, the recipient's k-anonymity can be unconditionally guaranteed. We also demonstrate the practicality of the proposed protocol through intensive simulation based on well-known network topologies. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.comnet.2011.07.009 | Computer Networks |
Keywords | DocType | Volume |
Anonymous communication,Traffic analysis,Multicast tree,Public routing proxy | Journal | 55 |
Issue | ISSN | Citations |
15 | 1389-1286 | 2 |
PageRank | References | Authors |
0.37 | 18 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hyoungshick Kim | 1 | 226 | 32.27 |
| Jaehoon Jeong | 2 | 387 | 34.96 |