9,048 research outputs found
Resilient Network Coding in the Presence of Byzantine Adversaries
Network coding substantially increases network throughput. But since it involves mixing of information inside the network, a single corrupted packet generated by a malicious node can end up contaminating all the information reaching a
destination, preventing decoding.
This paper introduces distributed polynomial-time rate-optimal network codes that work in the presence of Byzantine nodes. We present algorithms that target adversaries with different attacking capabilities. When the adversary can eavesdrop on all links and jam zO links, our first algorithm achieves a rate of C - 2zO, where C is the network capacity. In contrast, when the adversary has limited eavesdropping capabilities, we provide algorithms that achieve the higher rate of C - zO.
Our algorithms attain the optimal rate given the strength of the adversary. They are information-theoretically secure. They operate in a distributed manner, assume no knowledge of the topology, and can be designed and implemented in polynomial time. Furthermore, only the source and destination need to be modified; nonmalicious nodes inside the network are oblivious to the presence of adversaries and implement a classical distributed network code. Finally, our algorithms work over wired and wireless networks
On Counteracting Byzantine Attacks in Network Coded Peer-to-Peer Networks
Random linear network coding can be used in peer-to-peer networks to increase
the efficiency of content distribution and distributed storage. However, these
systems are particularly susceptible to Byzantine attacks. We quantify the
impact of Byzantine attacks on the coded system by evaluating the probability
that a receiver node fails to correctly recover a file. We show that even for a
small probability of attack, the system fails with overwhelming probability. We
then propose a novel signature scheme that allows packet-level Byzantine
detection. This scheme allows one-hop containment of the contamination, and
saves bandwidth by allowing nodes to detect and drop the contaminated packets.
We compare the net cost of our signature scheme with various other Byzantine
schemes, and show that when the probability of Byzantine attacks is high, our
scheme is the most bandwidth efficient.Comment: 26 pages, 9 figures, Submitted to IEEE Journal on Selected Areas in
Communications (JSAC) "Mission Critical Networking
Message Randomization and Strong Security in Quantum Stabilizer-Based Secret Sharing for Classical Secrets
We improve the flexibility in designing access structures of quantum
stabilizer-based secret sharing schemes for classical secrets, by introducing
message randomization in their encoding procedures. We generalize the
Gilbert-Varshamov bound for deterministic encoding to randomized encoding of
classical secrets. We also provide an explicit example of a ramp secret sharing
scheme with which multiple symbols in its classical secret are revealed to an
intermediate set, and justify the necessity of incorporating strong security
criterion of conventional secret sharing. Finally, we propose an explicit
construction of strongly secure ramp secret sharing scheme by quantum
stabilizers, which can support twice as large classical secrets as the
McEliece-Sarwate strongly secure ramp secret sharing scheme of the same share
size and the access structure.Comment: Publisher's Open Access PDF. arXiv admin note: text overlap with
arXiv:1811.0521
Universal secure rank-metric coding schemes with optimal communication overheads
We study the problem of reducing the communication overhead from a noisy
wire-tap channel or storage system where data is encoded as a matrix, when more
columns (or their linear combinations) are available. We present its
applications to reducing communication overheads in universal secure linear
network coding and secure distributed storage with crisscross errors and
erasures and in the presence of a wire-tapper. Our main contribution is a
method to transform coding schemes based on linear rank-metric codes, with
certain properties, to schemes with lower communication overheads. By applying
this method to pairs of Gabidulin codes, we obtain coding schemes with optimal
information rate with respect to their security and rank error correction
capability, and with universally optimal communication overheads, when , being and the number of columns and number of rows,
respectively. Moreover, our method can be applied to other families of maximum
rank distance codes when . The downside of the method is generally
expanding the packet length, but some practical instances come at no cost.Comment: 21 pages, LaTeX; parts of this paper have been accepted for
presentation at the IEEE International Symposium on Information Theory,
Aachen, Germany, June 201
Byzantine Modification Detection in Multicast Networks With Random Network Coding
An information-theoretic approach for detecting Byzantine or adversarial modifications in networks employing random linear network coding is described. Each exogenous source packet is augmented with a flexible number of hash symbols that are obtained as a polynomial function of the data symbols. This approach depends only on the adversary not knowing the random coding coefficients of all other packets received by the sink nodes when designing its adversarial packets. We show how the detection probability varies with the overhead (ratio of hash to data symbols), coding field size, and the amount of information unknown to the adversary about the random code
- …