Sciweavers

9 search results - page 1 / 2
» On counteracting Byzantine attacks in network coded peer-to-...
Sort
View
JSAC
2010
113views more  JSAC 2010»
13 years 3 months ago
On counteracting Byzantine attacks in network coded peer-to-peer networks
Abstract—Random linear network coding can be used in peerto-peer networks to increase the efficiency of content distribution and distributed storage. However, these systems are ...
MinJi Kim, Luísa Lima, Fang Zhao, Joã...
CORR
2008
Springer
137views Education» more  CORR 2008»
13 years 5 months ago
Counteracting Byzantine Adversaries with Network Coding: An Overhead Analysis
Network coding increases throughput and is robust against failures and erasures. However, since it allows mixing of information within the network, a single corrupted packet genera...
MinJi Kim, Muriel Médard, João Barro...
PPNA
2011
12 years 11 months ago
Security and privacy issues in P2P streaming systems: A survey
Streaming applications over Peer-To-Peer (P2P) systems have gained an enormous popularity. Success always implies increased concerns about security, protection, privacy and all the...
Gabriela Gheorghe, Renato Lo Cigno, Alberto Montre...
INFOCOM
2007
IEEE
13 years 11 months ago
Resilient Network Coding in the Presence of Byzantine Adversaries
Abstract— Network coding substantially increases network throughput. But since it involves mixing of information inside the network, a single corrupted packet generated by a mali...
Sidharth Jaggi, Michael Langberg, Sachin Katti, Tr...
CORR
2010
Springer
184views Education» more  CORR 2010»
13 years 4 months ago
Strong Secrecy and Reliable Byzantine Detection in the Presence of an Untrusted Relay
We consider a Gaussian two-hop network where the source and the destination can communicate only via a relay node who is both an eavesdropper and a Byzantine adversary. Both the s...
Xiang He, Aylin Yener