A New Bound on the Performance of the Bandwidth Puzzle

A bandwidth puzzle was recently proposed to defend against colluding adversaries in peer-to-peer networks. The colluding adversaries do not do actual work but claim to have uploaded content for each other to gain free credits from the system. The bandwidth puzzle guarantees that if the adversaries c...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on information forensics and security 2012-04, Vol.7 (2), p.731-742
1. Verfasser:	Zhang, Zhenghao
Format:	Artikel
Sprache:	eng
Schlagworte:	Asymptotic properties Bandwidth Communication system security Computer information security Gain Indexes Lower bounds Materials Networks Peer to peer computing Robustness Security Strategy Streaming media
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!