Providing witness anonymity under peer-to-peer settings

  • Authors:
  • Bo Zhu;Sanjeev Setia;Sushil Jajodia;Lingyu Wang

  • Affiliations:
  • Concordia Institute for Information Systems Engineering, Concordia University, Montreal, QC, Canada;Department of Computer Science, George Mason University, Fairfax, VA;Center for Secure Information Systems, George Mason University, Fairfax, VA;Concordia Institute for Information Systems Engineering, Concordia University, Montreal, QC, Canada

  • Venue:
  • IEEE Transactions on Information Forensics and Security
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we introduce the concept of witness anonymity for peer-to-peer systems, as well as other systems with the peer-to-peer nature. Witness anonymity combines the seemingly conflicting requirements of anonymity (for honest peers who report on the misbehavior of other peers) and accountability (for malicious peers that attempt to misuse the anonymity feature to slander honest peers). We propose the Secure Deep Throat (SDT) protocol to provide anonymity for the witnesses of malicious or selfish behavior to enable such peers to report on this behavior without fear of retaliation. On the other hand, in SDT, the misuse of anonymity is restrained in such a way that any malicious peer attempting to send multiple claims against the same innocent peer for the same reason (i.e., the same misbehavior type) can be identified. We also describe how SDT can be used in two modes. The active mode can be used in scenarios with real-time requirements, e.g., detecting and preventing the propagation of peer-to-peer worms, whereas the passive mode is suitable for scenarios without strict real-time requirements, e.g., query-based reputation systems. We analyze the security and overhead of SDT, and present countermeasures that can be used to mitigate various attacks on the protocol. Moreover, we show how SDT can be easily integrated with existing protocols/mechanisms with a few examples. Our analysis shows that the communication, storage, and computation overheads of SDT are acceptable in peer-to-peer systems.