Pollution Attacks and Defenses in Wireless Inter-Flow Network Coding Systems

Author(s):  
Jing Dong ◽  
Reza Curtmola ◽  
Cristina Nita-Rotaru ◽  
David Yau
2012 ◽  
Vol 9 (5) ◽  
pp. 741-755 ◽  
Author(s):  
Jing Dong ◽  
R. Curtmola ◽  
C. Nita-Rotaru ◽  
D. K. Y. Yau

2012 ◽  
Vol 2012 ◽  
pp. 1-14 ◽  
Author(s):  
Yuanyuan Zhang ◽  
Marine Minier

Network coding has attracted the attention of many researchers in security and cryptography. In this paper, a well-known attackselective forwarding attackwill be studied in network coding systems. While most of the works have been dedicated to the countermeasures against pollution attacks where an attacker modifies intermediate packets, only few works concern selective forwarding attacks on data or acknowledgment (ACK) packets; those last ones are required in network coding. However, selective forwarding attacks stay a real threat in resource constraint networks such as wireless sensor networks, especially when selective forwarding attacks target the acknowledgment (ACK) messages, referred to asflooding attack. In the latter model, an adversary can easily create congestion in the network and exhaust all the resources available. The degradation of the QoS (delay, energy) goes beyond the capabilities of cryptographic solutions. In this paper, we first simulate and analyze the effects of selective forwarding attacks on both data flows and ACK flows. We then investigate the security capabilities of multipath acknowledgment in more details than in our original proposal (Zhang et al., 2011).


2012 ◽  
Vol 31 (6) ◽  
pp. 1512-1514
Author(s):  
Shu-fen NIU ◽  
Cai-fen WANG ◽  
Xue-yan LIU

2018 ◽  
Vol 145 ◽  
pp. 1-12 ◽  
Author(s):  
Jonas Hansen ◽  
Jeppe Krigslund ◽  
Daniel E. Lucani ◽  
Peyman Pahlevani ◽  
Frank H.P. Fitzek

2012 ◽  
Vol 457-458 ◽  
pp. 1499-1507 ◽  
Author(s):  
Si Guang Chen ◽  
Meng Wu ◽  
Wei Feng Lu

In this work we consider the problem of designing a secret error-correcting network coding scheme against an adversary that can re-select the tapping links in different time slot and inject z erroneous packets into network. We first derive a necessary condition for keeping the transmitted information secret from the adversary, while the network is only subject to the eavesdropping attack. We then design an error-correcting scheme by combining the rank-metric codes with shared secret model, which can decode the transmitted information correctly provided a sufficiently large q. With that, a secret error-correcting network coding is proposed by combining this error-correcting scheme with secret communication. We show that under the requirement of communication can achieve a rate of packets. Moreover, it ensures that the communicated information is reliable and information-theoretic security from the adversary. In particular, the requirement of packet length is not as large as the required in [12]. Finally, the security and performance analyses illustrate the characteristics of our scheme.


Sign in / Sign up

Export Citation Format

Share Document