More anonymity through trust degree in trust-based onion routing

Peng Zhou, Xiapu Luo, Kow Chuen Chang

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

1 Citation (Scopus)

Abstract

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.
Original languageEnglish
Title of host publicationSecurity and Privacy in Communication Networks - 8th International ICST Conference, SecureComm 2012, Revised Selected Papers
Pages273-291
Number of pages19
DOIs
Publication statusPublished - 7 Mar 2013
Event8th International ICST Conference on Security and Privacy in Communication Networks, SecureComm 2012 - Padua, Italy
Duration: 3 Sep 20125 Sep 2012

Publication series

NameLecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering
Volume106 LNICS
ISSN (Print)1867-8211

Conference

Conference8th International ICST Conference on Security and Privacy in Communication Networks, SecureComm 2012
Country/TerritoryItaly
CityPadua
Period3/09/125/09/12

Keywords

  • anonymity
  • trust degree
  • trust-based onion routing

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this