Really Simple Security for P2P Dissemination of Really Simple Syndication

  • Authors:
  • Anwitaman Datta;Liu Xin

  • Affiliations:
  • School of Computer Engineering, NTU Singapore, ;School of Computer Engineering, NTU Singapore,

  • Venue:
  • OTM '08 Proceedings of the OTM Confederated International Workshops and Posters on On the Move to Meaningful Internet Systems: 2008 Workshops: ADI, AWeSoMe, COMBEK, EI2N, IWSSA, MONET, OnToContent + QSI, ORM, PerSys, RDDS, SEMELS, and SWWS
  • Year:
  • 2008
  • Reliable P2P Feed Delivery

    CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid

Quantified Score

Hi-index 0.00

Visualization

Abstract

Using peer-to-peer overlays to notify users whenever a new update occurs is a promising approach to support web based publish subscribe systems like RSS. Such a peer-to-peer approach can scale well by reducing load at the source and also guarantee timeliness of notifications. However, malicious peers may stop propagating the updates or modify them, thus making the P2P mechanism useless or even harmful. We propose overlay independent randomized strategies to mitigate these ill-effects of malicious peers at a marginal overhead.In the P2P approaches, generally a small subset of the end-users (Rootpeers) pull directly from the source and push any update downstream (to Downstream peers). Several such P2P approaches have been proposed [1], [2], [3]. Unlike other approaches, our approach puts the focus on the security issue, that is to protect the system against various malicious peers, without altering the behavior of currently deployed servers.