Coding against a limited-view adversary: The effect of causality and feedback

Zhang, Qiaosheng; Kadhe, Swanand; Bakshi, Mayank; Jaggi, Sidharth; Sprintson, Alex

doi:10.1109/isit.2015.7282912

Cited by 14 publications

(22 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Adaptive Node Linearity attack attack randomness Papers [1], [2], [3], [6] not allowed not allowed not allowed scalar Paper [4] not allowed not allowed allowed non-linear Papers [9], [10], [23], [24], [25] not allowed not allowed allowed scalar Papers [5], [8] not allowed not allowed not allowed scalar Papers [13], [14], [11] not allowed not allowed not allowed vector Papers [12], [35] semi active attack not allowed not allowed vector…”

Section: Activementioning

confidence: 99%

Secure Network Code for Adaptive and Active Attacks With No-Randomness in Intermediate Nodes

Cai

Hayashi

2020

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

We analyze the security for network code when the eavesdropper can contaminate the information on the attacked edges (active attack) and can choose the attacked edges adaptively (adaptive attack). We show that active and adaptive attacks cannot improve the performance of the eavesdropper when the code is linear. Further, we give an non-linear example, in which an adaptive attack improves the performance of the eavesdropper. We derive the capacity for the unicast case and the capacity region for the multicast case or the multiple multicast case in several examples of relay networks, beyond the minimum cut theorem, when no additional random number is allowed as scramble variables in the intermediate nodes. IndexTerms secrecy analysis, secure network coding, adaptive attack, active attack I. INTRODUCTION Secure network coding is a method securely transmitting information from the authorized sender to the authorized receiver. Cai and Yeung [1], [2], [3] discussed the secrecy for the malicious adversary, Eve, wiretapping a subset E E of all channels in the network. The papers [4], [5], [6], [7], [8], [9], [10] developed several types of secure network coding. The papers [11], [12], [13], [14] showed the existence of a secrecy code that universally works for any types of eavesdroppers under the size constraint of E E . In particular, the papers [13], [14] constructed it by using the universal hashing lemma [15], [16], [17]. Further, the papers [11], [12], [18] evaluated errors when the information on a part of network is changed, but they evaluated the secrecy only when the information on a part of network is not changed or Eve did not know the replaced information. The recent paper [19] discussed the secrecy as well as the error when Eve contaminates the eavesdropped information and knows the replaced information. (For the detailed relation, see [19, Remark 8].) The effects of Eve's contamination depend on the type of the network code. When the code is linear, the contamination does not improve her performance. However, when the code is not linear, there exists only one example where the contamination improves her performance [19].Despite these developments, there are still some problems in existing studies. Although these existing studies achieved the optimal rate with secrecy condition, their optimality relies on the minimum cut theorem. That is, they assumed that the eavesdropper may choose any r-subset channels to access, and did not address another type of conditions for the eavesdropper. For example, the studies [11], [12], [13], [14] optimized only the codes in the source and terminal nodes and did not optimize the coding operations on the intermediate nodes. Also, in other existing studies, the intermediate nodes do not have as complicated codes as the source and terminal nodes. In this paper, to achieve the optimal rate beyond the minimum cut theorem, we address the optimization of the coding operations on the intermediate nodes as well as on the source and terminal nodes.Further, we consider a new type of at...

show abstract

Section: Activementioning

confidence: 99%

Secure Network Code for Adaptive and Active Attacks With No-Randomness in Intermediate Nodes

Cai

Hayashi

2020

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

show abstract

“…, [2], [6] give a characterization of the optimal rate-region for reliable (and secure) communication problem over multipath networks. The non-causal adversary setting is considered in [1], and some aspects of the causal adversary setting in [2], [6].…”

mentioning

confidence: 99%

“…The non-causal adversary setting is considered in [1], and some aspects of the causal adversary setting in [2], [6]. The causality constraint on Calvin limits his adversarial power since he can only choose the jamming strategy based on the observations up to the current time slot.…”

mentioning

confidence: 99%

“…The causality constraint on Calvin limits his adversarial power since he can only choose the jamming strategy based on the observations up to the current time slot. In [2], [6] we also consider a scenario wherein passive feedback is available to the transmitter Alice. In this problem setting, Alice is able to overhear the received data.…”

mentioning

confidence: 99%

“…After reviewing the prior work in [1], [2], [6], in this work we extend the previously proposed techniques to provide an information-theoretically tight characterization of the optimal throughput when Alice has passive feedback available, and when both secrecy and reliability is required. We draw the reader's attention to Table I and emphasize that the only new results in this paper correspond to the light green cells in the bottom right.…”

mentioning

confidence: 99%

See 2 more Smart Citations

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

Coding against a limited-view adversary: The effect of causality and feedback

Zhang

Kadhe

Bakshi

et al. 2015

2015 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

Abstract-We consider the problem of communication over a multi-path network in the presence of a causal adversary. The limited-view causal adversary is able to eavesdrop on a subset of links and also jam on a potentially overlapping subset of links based on the current and past information. To ensure that the communication takes place reliably and secretly, resilient network codes with necessary redundancy are needed. We study two adversarial models -additive and overwrite jamming and we optionally assume passive feedback from decoder to encoder, i.e., the encoder sees everything that the decoder sees. The problem assumes transmissions are in the large alphabet regime. For both jamming models, we find the capacity under four scenarios -reliability without feedback, reliability and secrecy without feedback, reliability with passive feedback, reliability and secrecy with passive feedback. We observe that, in comparison to the noncausal setting, the capacity with a causal adversary is strictly increased for a wide variety of parameter settings and present our intuition through several examples.

show abstract

Coding against a limited-view adversary: The effect of causality and feedback

Cited by 14 publications

References 17 publications

Secure Network Code for Adaptive and Active Attacks With No-Randomness in Intermediate Nodes

Secure Network Code for Adaptive and Active Attacks With No-Randomness in Intermediate Nodes

Reliable and secure communication over adversarial multipath networks: A survey

Coding against a limited-view adversary: The effect of causality and feedback

Contact Info

Product

Resources

About