.png){kind=icon}
Return
ANOC: Anonymous Network-Coding-Based Communication with Efficient Cooperation
.png){kind=icon}
OA
AI
DOI：10.1109/JSAC.2012.121018.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Practical wireless network coding (e. g., COPE) is a promising technique that can enhance the throughput of wireless networks. However, such a technique also bears a serious security drawback: it breaks the current privacy-preserving protocols (e. g., Onion Routing), since their operations conflict each other. As user privacy in wireless networks is highly valued nowadays, a new privacy-preserving scheme that can function with wireless network coding becomes indispensable. To address such a challenge, we apply the idea of cooperative networking and design a novel anonymity scheme named ANOC, which can function in network-coding-based wireless mesh networks. ANOC is built upon the classic Onion Routing protocol, and resolves its conflict with network coding by introducing efficient cooperation among relay nodes. Using ANOC, we can perform network coding to achieve a higher throughput, while still preserving user privacy in wireless mesh networks. We formally show how ANOC achieves the property of relationship anonymity, and conduct extensive experiments via nsclick to demonstrates its feasibility and efficiency when integrated with network coding.
Keywords:
Network coding
anonymity
cooperative networking
Onion Routing
Journal
IF:
17.2
Papers:
6.4K
Citations:
3.1W
Organization
View more organizations
Cited Papers
ShareSaveShareSave5-Hydroxy-4-oxo-L-norvaline Depletes Intracellular Glutathione: a New Modulator of Drug ResistanceOAAI
OAAIShareSaveCANDIDA INFECTION OF LOCAL NECROSIS IN SEVERE ACUTE PANCREATITIS IS ASSOCIATED WITH INCREASED MORTALITY.png)
ShockOAAI
ShockIF0
OAAIShareSaveShareSave
ShareSaveShareSave View more