Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
More Anonymity through Trust Degree in Trust-Based Onion Routing
verfasst von : Peng Zhou, Xiapu Luo, Rocky K. C. Chang
Erschienen in: Security and Privacy in Communication Networks
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.