Systematic-RLNC Based Secure and QoS Centric Routing Scheme for WSNs, Journal of Telecommunications and Information Technology, 2019, nr 4

In this paper a highly robust and efficient systematic-random linear network coding (S-RLNC) routing scheme is proposed. Unlike classic security systems, the proposed S-RLNC transmission model incorporates an advanced pre-coding and interleaving concept followed by multigeneration mixing (MGM) based data transmission to assure secure and QoS efficient communication. The proposed S-RLNC MGM based routing scheme exhibits higher throughput (99.5-100%) than the existing NCC-ARQ-WSN protocol (80%). Unlike NCC-ARQ-WSN, the proposed model incorporates multiple enhancements, such as RLNC concept, systematic network coding, MGM concept, IBF provision and redundant packet optimization. Combined, all these optimizations have strengthened the proposed S-RLNC MGM to exhibit optimum performance for secure and QoS-centric communication over WSN

Lightweight Security for Network Coding

Under the emerging network coding paradigm, intermediate nodes in the network are allowed not only to store and forward packets but also to process and mix different data flows. We propose a low-complexity cryptographic scheme that exploits the inherent security provided by random linear network coding and offers the advantage of reduced overhead in comparison to traditional end-to-end encryption of the entire data. Confidentiality is achieved by protecting (or "locking") the source coefficients required to decode the encoded data, without preventing intermediate nodes from running their standard network coding operations. Our scheme can be easily combined with existing techniques that counter active attacks.Comment: Proc. of the IEEE International Conference on Communications (ICC 2008), Beijing, China, May 200

Identifying malicious nodes in network-coding-based peer-to-peer streaming networks

published or submitted for publicatio

Centralized and Cooperative Transmission of Secure Multiple Unicasts using Network Coding

We introduce a method for securely delivering a set of messages to a group of clients over a broadcast erasure channel where each client is interested in a distinct message. Each client is able to obtain its own message but not the others'. In the proposed method the messages are combined together using a special variant of random linear network coding. Each client is provided with a private set of decoding coefficients to decode its own message. Our method provides security for the transmission sessions against computational brute-force attacks and also weakly security in information theoretic sense. As the broadcast channel is assumed to be erroneous, the missing coded packets should be recovered in some way. We consider two different scenarios. In the first scenario the missing packets are retransmitted by the base station (centralized). In the second scenario the clients cooperate with each other by exchanging packets (decentralized). In both scenarios, network coding techniques are exploited to increase the total throughput. For the case of centralized retransmissions we provide an analytical approximation for the throughput performance of instantly decodable network coded (IDNC) retransmissions as well as numerical experiments. For the decentralized scenario, we propose a new IDNC based retransmission method where its performance is evaluated via simulations and analytical approximation. Application of this method is not limited to our special problem and can be generalized to a new class of problems introduced in this paper as the cooperative index coding problem