Efficient Weakly-Secure Network Coding Schemes against Wiretapping Attacks

Wei, Yawen; Guan, Yong Liang

doi:10.1109/netcod.2010.5487671

Cited by 26 publications

(15 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Two important issues in secure network co mmunicat ion are secrecy and authenticity. In the network coding context, the problem of ensuring secrecy in the presence of a wire tap adversary has been considered in [10] and [11]. The problem of correct ing adversarial errors to build authenticated channels has been studied in [12] and [13].…”

Section: Background and Related Workmentioning

confidence: 99%

Reliable Channels for Systems in the Presence of Byzantine Faults

Karaata

Hamdan

2016

MATEC Web of Conferences

View full text Add to dashboard Cite

Abstract. Consider a distributed system that delivers each message from a process to its destination if the message transmission does not experience any faults and only delivers those sent by a non -faulty system process. Such a system is referred to as a reliable message passing system. A reliable message passin g system requires a reliable channel, a communication channel between a pair of processes that always detects a fault in message transmission and each detected fault is an actual fault, to be implemented. In this paper, we first identify the necessary conditions to detect some restricted form of Byzantine Faults in a message passing system where n disjoint paths exist between each pair of endpoints. We consider Byzantine Faults (BF) whose e_ect is limited to the modification of a message metadata, omission faults, and message replay. We then present a protocol implementing a reliable channel in message passing systems in the presence of n -1 Byzantine Faults using n disjoint paths between each pair of communication endpoints where the paths with faults are not known apriori. T he proposed protocol detects Byzantine Faults, where each detected fault, an actual fault, authenticates message origins, identifies faulty paths and classifies faults in the presence of multiple messages sent by various system processes.

show abstract

Section: Background and Related Workmentioning

confidence: 99%

Reliable Channels for Systems in the Presence of Byzantine Faults

Karaata

Hamdan

2016

MATEC Web of Conferences

View full text Add to dashboard Cite

show abstract

“…The work in [14] looks at security for network coded sensor networks with keys distributed by a mobile agent that visits the nodes.…”

Section: Related Workmentioning

confidence: 99%

Low cost security for sensor networks

Atsan

Safaka

Keller

et al. 2013

2013 International Symposium on Network Coding (NetCod)

View full text Add to dashboard Cite

Abstract-We design and evaluate a lightweight encryption protocol suitable for sensor networks, that enables weak security in the presence of passive eavesdroppers. At every communication round, our protocol creates a key between each sensor node and the sink, by appropriately mixing and coding information packets that the nodes passively overhear. Evaluation using the TOSSIM simulator indicates that with our protocol we can gain significant security benefits at low overhead cost.

show abstract

“…Wei et al [14] studied two efficient LNC schemes providing weak security by using random symbol and permutation function. Silva and Kschischang [15] showed more efficient weakly secure LNC scheme which does not need to enlarge the size of finite field.…”

Section: Related Workmentioning

confidence: 99%

Modeling and Optimal Design of Linear Network Coding for Secure Unicast with Multiple Streams

Wang

et al. 2013

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

In this paper, we will address the modeling and optimal design of linear network coding (LNC) for secure unicast with multiple streams between the same source and destination pair. The objectives include 1) satisfying the weakly secure requirements, 2) maximizing the transmission data rate, and 3) minimizing the size of the finite field. To fulfill the first two objectives, we formulate a secure unicast routing problem and prove that it is equivalent to a constrained link-disjoint path problem. Based on this fact, we develop an efficient algorithm that can find the optimal unicast topology in a polynomial amount of time. With the given topology, we investigate the design of both weakly secure deterministic LNC and weakly secure random LNC. In the designs of deterministic LNC and random LNC, we prove that the required size of the finite field decreases with the decrease of the number of intermediate nodes in the topology. Therefore, to meet the third objective, we formulate a problem to minimize the number of intermediate nodes. We prove that this problem is NP-Complete and develop an approximation algorithm to solve it. Finally, extensive simulation experiments have been conducted, and the results demonstrate the effectiveness of the proposed algorithms.Index Terms-Secure linear network coding, deterministic linear network coding, random linear network coding, passive attack, unicast, finite field . J. Wang is with the

show abstract

Efficient Weakly-Secure Network Coding Schemes against Wiretapping Attacks

Cited by 26 publications

References 24 publications

Reliable Channels for Systems in the Presence of Byzantine Faults

Reliable Channels for Systems in the Presence of Byzantine Faults

Low cost security for sensor networks

Modeling and Optimal Design of Linear Network Coding for Secure Unicast with Multiple Streams

Contact Info

Product

Resources

About