Abstract
We consider the issue of confidentiality in multicast network coding, by assuming that the encoding matrices, based upon variants of random linear network coding, are given only to the source and sinks. Based on this assumption, we provide a characterization of the mutual information between the encoded data and the two elements that can lead to information disclosure: the matrices of random coefficients and, naturally, the original data itself. Our results, some of which hold even with finite block lengths, show that, predicated on optimal source-coding, information-theoretic security is achievable for any field size without loss in terms of decoding probability. It follows that protecting the encoding matrix is generally sufficient to ensure confidentiality of network coded data.

Abstract
We consider a wireless network scenario in which the communicating nodes are assisted by a number of jammers. The goal of the jammers is to obstruct potential eavesdroppers while restricting the harmful interference experienced by the legitimate receiver. Based on a stochastic network model, we are able to show that packet collisions caused by jamming nodes can be used effectively to increase the level of secrecy. Various jammer selection policies are investigated depending on the position of source, destination and jamming nodes. Our results shed some light on the trade-off between secure throughput and energy efficiency. © 2011 IEEE.

Abstract
We present a jamming protocol for secrecy-enhanced wireless networks in which otherwise silent devices are selected as jammers to cause interference to potential eavesdroppers. This cooperative protocol includes several jammer selection policies that lead to different levels of secrecy-energy tradeoffs. Our results show that there is some advantage over selecting well-connected jammers and there is a need for a minimum number of jammers for the energy cost of jamming to payoff.

Abstract
We analyze the role of jamming as a means to increase the security of wireless systems. Specifically, we characterize the impact of cooperative/friendly jamming on the secrecy outage probability of a quasi-static wiretap fading channel. We introduce jamming coverage and jamming efficiency as security metrics, and evaluate the performance of three different jamming strategies that rely on various levels of channel state information. The analysis provides insight for the design of optimal jamming configurations and indicates that one jammer is not enough to maximize both metrics simultaneously.

Abstract
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.

Abstract
The vision towards the Network of the Future cannot be separated from the fact that today's networks, and networking services are subject to sophisticated and very effective attacks. When these attacks first appeared, spoofing and distributed denial-of-service attacks were treated as apocalypse for networking. Now, they are considered moderate damage, whereas more sophisticated and inconspicuous attacks, such as botnets activities, might have greater and far reaching impact. As the Internet is expanding to mobile phones and smart dust and as its social coverage is liberalized towards the realization of ubiquitous computing (with communication), the concerns on security and privacy have become deeper and the problems more challenging than ever. Re-designing the Internet as the Network of the Future is self-motivating for researchers, and security and privacy cannot be provided again as separate, external, add-on, solutions. In this paper, we discuss the security and privacy challenges of the Network of the Future and try to delimit the solutions space on the basis of emerging techniques. We also review methods that help the quantification of security and privacy in an effort to provide a more systematic and quantitative treatment of the area in the future. Copyright (c) 2011 John Wiley & Sons, Ltd.