Trust-based onion routing employs users' own trust to circumvent compromised onion routers. However, it runs a high risk of being deanonymized by the inference attack based on a priori trust relationship. In this paper, we first observe that the onion routers with higher trust degree (e.g., those that are trusted by more users) are more effective in defending against the inference attack. We therefore incorporate trust degree into trust-based onion routing. With a rigorous theoretical analysis, we devise an optimal strategy for router selection and an optimal routing algorithm for path selection. Both minimize the risk of deanonymization by the inference attack without sacrificing the capability of evading compromised routers. Moreover, simulation-based experiments on top of real-world social networks confirm the effectiveness of the optimal router selection.
|Name||Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering|
|Conference||8th International ICST Conference on Security and Privacy in Communication Networks, SecureComm 2012|
|Period||3/09/12 → 5/09/12|
- trust degree
- trust-based onion routing
- Computer Networks and Communications