Byzantine attacks against network coding in peer to peer distributed storage


We consider the impact of Byzantine attackers on peer-to-peer topologies for distributed storage using network coding. First, the problem is formulated as one of data flow in random evolving graphs, in which a data source and a data collector are connected to data keepers who may behave in a Byzantine fashion. We then derive analytical results for the… (More)
DOI: 10.1109/ISIT.2009.5206005

5 Figures and Tables


  • Presentations referencing similar topics