Secure Network Coding on a Wiretap Network

Cai, Ning; Yeung, Raymond W.

doi:10.1109/tit.2010.2090197

Cited by 196 publications

(257 citation statements)

References 23 publications

Supporting

Mentioning

252

Contrasting

Order By: Relevance

“…Secure network coding by Cai and Yeung [5], [6], [7] is a seminal work in the field of secret communication over networks. The secrecy capacity of an error-free network is established and linear achievability schemes are proposed.…”

Section: A Related Workmentioning

confidence: 99%

“…In the special case of lossless channels δ = δ E = 0 our model becomes the same as seen in [5]. Here we shortly summarize the work of Cai and Yeung [5], [6].…”

Section: Secure Network Coding Over Lossless Networkmentioning

confidence: 99%

“…Here we shortly summarize the work of Cai and Yeung [5], [6]. A linear coding scheme known as the secure network coding scheme is proposed with -in our notation -parameters (1, , (h − z) + ).…”

Section: Secure Network Coding Over Lossless Networkmentioning

confidence: 99%

“…In this section, we only examine lossless networks and simply make the point that the secure network coding scheme [5] -with a slight modification -can be cast as a two-phase scheme. We show that the modification does not effect the achieved rate, hence the two phase secure network coding scheme is also optimal.…”

Section: Two-phase Secure Network Coding Schemementioning

confidence: 99%

“…We first consider lossless networks and establish connection between the secure network coding scheme [5], [6] and the two phase approach. We propose a modified, two phase secure network coding scheme showing that there is no fundamental difference between these approaches.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Secure Network Coding With Erasures and Feedback

Czap

Fragouli

Prabhakaran

et al. 2015

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Abstract-Secure network coding assumes that the underlying network links are lossless, thus it can be applied over lossy networks after channel error correction. Yet it is well known that channel losses, such as packet erasures, can be constructively used for secrecy over a link. We address here the challenge of extending these results for arbitrary networks. We provide achievability schemes over erasure networks with feedback, that outperform the alternative approach of channel error correction followed by secure message transmission separation. We derive outer bounds on the securely achievable rate and as a consequence we show optimality of our proposed scheme in some special cases.

show abstract

Section: A Related Workmentioning

confidence: 99%

“…In the special case of lossless channels δ = δ E = 0 our model becomes the same as seen in [5]. Here we shortly summarize the work of Cai and Yeung [5], [6].…”

Section: Secure Network Coding Over Lossless Networkmentioning

confidence: 99%

Section: Secure Network Coding Over Lossless Networkmentioning

confidence: 99%

Section: Two-phase Secure Network Coding Schemementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Secure Network Coding With Erasures and Feedback

Czap

Fragouli

Prabhakaran

et al. 2015

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

show abstract

Security by Network Coding

Lauradoux¹

2012

Network Coding

View full text Add to dashboard Cite

On the optimal flow allocation and information theoretically secure network coding design for multiple multicasts

Ding

Wang

et al. 2018

Int J Communication

View full text Add to dashboard Cite

SummaryWith linear network coding (LNC), the data packets transmitted in a communication network are coded packets, which are linear combinations of original data packets. Since the coded packets can be useful for multiple destinations in multicast, LNC has been shown as a promising technology to improve the network throughput. On the other hand, the original data packets can be encoded with random symbols and transmitted in the network to make sure that a passive attacker cannot obtain the information of these original data packets when the passive attacker cannot obtain enough coded packets. Therefore, LNC also provides secure transmission without using the traditional encryption and decryption. In this paper, we will study an Information Theoretically Secure Multiple Multicasts (ITSMM) problem with the following objectives: (1) maximizing the secure transmission rate (STR), (2) minimizing the random symbol rate (RSR), and (3) minimizing the bandwidth cost (BC), when the data transmission is information theoretically secure. We firstly theoretically analyze the ITSMM problem, which shows that it is equivalent to a problem of network flow with constraints on each intermediate node. We then formulate the ITSMM problem by 3 linear programmings to get the maximum STR, the minimum RSR, and the minimum BC. After that, we prove the sufficient condition for the size of finite field over which the information theoretically secure linear multicast code (ITSLMC) can be designed. At last, we give extensive simulations, which show that the proposed algorithms are effective and efficient.

show abstract

Secure Network Coding on a Wiretap Network

Cited by 196 publications

References 23 publications

Secure Network Coding With Erasures and Feedback

Secure Network Coding With Erasures and Feedback

Security by Network Coding

On the optimal flow allocation and information theoretically secure network coding design for multiple multicasts

Contact Info

Product

Resources

About