Network Codes Resilient to Jamming and Eavesdropping

Yao, Hongyi; Silva, Danilo; Jaggi, Sidharth; Langberg, Michael

doi:10.1109/netcod.2010.5487669

Cited by 33 publications

(96 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The network error correction code [6] gives the maximum rate at which the source can transmit secretly and securely; our construction achieves the same maximum rate but with a lower computational complexity and a higher error correction probability. Our new scheme is an extension of that in [4] which only considers error correction but not the secrecy of the messages.…”

Section: B Backgroundmentioning

confidence: 88%

“…Directly applying the result in [6], which provides polynomial time encoding and decoding algorithms for all achievable rates, gives the following: Theorem 1. For the path-key establishment problem above, …”

Section: B Backgroundmentioning

confidence: 99%

“…The contribution of this paper is showing that information theoretic network error correction codes [2] [6] can be applied to achieve optimal performance for two practical key agreement scenarios. Compared with cryptographic authentication, schemes based on informationtheoretic error correction codes do not need pre-key set up, achieve low computational overhead, and are secure even when the adversary has unlimited computational capability.…”

Section: Introductionmentioning

confidence: 99%

“…Thus, the problem of key agreement between A and B can be reduced to the problem of secure communication in a two-hop parallel path network. When some of the wireless nodes can be compromised by an adversary, the work in [6] shows the maximum rate at which the source can transmit secretly and securely when using network error correction codes. We propose a new code which achieves the same rate, but, being designed for a specific topology, achieves better performance, i.e.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Key agreement for wireless networks in the presence of active adversaries

Yao

Nita-Rotaru

2011

2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)

Self Cite

View full text Add to dashboard Cite

In this work we consider key agreement in a distributed wireless network in which adversarial nodes may exist in the network. Two practical scenarios are studied, i.e., path-key establishment and key pool bootstrapping. For both scenarios, previous work mainly focuses on preventing adversarial eavesdropping attacks. When the adversarial nodes can both eavesdrop and change the packets in the network, we show that an optimal scheme (in terms of error correction capability) can be obtained by using techniques from the literature of network error correction codes. In particular, for the path-key establishment problem, which has a particular topological structure, we propose a lightweight scheme with lower error probability and computational complexity than existing network error correction codes. For the key pool bootstrapping scenario, we show a connection with multisource network error correction coding, and show that network coding is necessary for optimal resilience against adversarial attacks.

show abstract

Section: B Backgroundmentioning

confidence: 88%

Section: B Backgroundmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Key agreement for wireless networks in the presence of active adversaries

Yao

Nita-Rotaru

2011

2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)

Self Cite

View full text Add to dashboard Cite

show abstract

“…As a result, as long as the overall rate decreases by z r , both secrecy and reliability are simultaneously met. 4 5) Secret key extraction via passive feedback: A surprising effect of passive feedback is that it allows Alice and Bob to extract secret keys from corrupted links as long as the received codeword on the link is hidden from Calvin. This allows for simultaneous reliable and secret transmission at rates higher than that achievable by just mixing z r random keys with the message.…”

Section: ) Mixing Keys For Secrecymentioning

confidence: 99%

Reliable and secure communication over adversarial multipath networks: A survey

Kadhe

Sprintson

Zhang

et al. 2015

2015 10th International Conference on Information, Communications and Signal Processing (ICICS)

Self Cite

View full text Add to dashboard Cite

We consider the problem of reliable and information theoretically secure communication over adversarial multi-path networks. The adversary, hidden in the multi-path network, is able to eavesdrop on and jam (possibly distinct) subsets of links. We study three types of problems -communication in the presence of non-causal adversaries, causal adversaries, and causal adversaries with passive feedback to the transmitter. For each of these problems, we further consider two types of jamming -additive jamming (modeling wireless communication) and overwrite jamming (modeling communication over wired networks). We survey recent results, and present new results for the setting with passive feedback available to the encoder -thus providing a "complete characterization" for the problem. For each variation of the problem, our results provide information theoretically optimal rates and computationally efficient codes asymptotically achieving these rates for both reliable as well as secure transmission.

show abstract

Counteracting malicious adversaries via secret and reliable coding mechanism in random network coding

Chen

Lü

2011

Int J Communication

View full text Add to dashboard Cite

SUMMARYThis paper investigates the problem of constructing a secret and reliable network coding communication scheme against an adversary that can reselect the μ tapping links in different time slices and inject z erroneous packets into the network, while the network suffers from ρ packet erasures. We first derive a necessary condition for keeping the transmitted information secret from the adversary, while the network is only subject to eavesdropping attack, and no errors are injected. We then provide two network coding schemes for error and erasure correction, which can decode the transmitted information correctly. With that, a secret and reliable network coding is proposed by combining two error and erasure correction schemes with secret communication. We show that under the requirement of 2z + ρ+ μ < k ⩽2z + 2ρ communication can achieve a rate of k −μ−z −ρ packets, where k denotes the network capacity. Moreover, it ensures that the communicated information has complete reliability and information‐theoretic security from the adversary. In particular, the requirement of packet length does not need to be sufficiently large, which is close to the practical packet length. Finally, we also compare our scheme's performance with existing work; the numeric results and security analyses illustrate the performance and security of our scheme. Copyright © 2011 John Wiley & Sons, Ltd.

show abstract

Network Codes Resilient to Jamming and Eavesdropping

Cited by 33 publications

References 19 publications

Key agreement for wireless networks in the presence of active adversaries

Key agreement for wireless networks in the presence of active adversaries

Reliable and secure communication over adversarial multipath networks: A survey

Counteracting malicious adversaries via secret and reliable coding mechanism in random network coding

Contact Info

Product

Resources

About