An efficient homomorphic MAC-based scheme against data and tag pollution attacks in network coding-enabled wireless networks

Esfahani, Alireza; Μαντάς, Γεώργιος; Rodrı́guez, Jonathan; Neves, José

doi:10.1007/s10207-016-0351-z

Cited by 37 publications

(43 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The study goes one step further by introducing the concept of block chains as a novel solution for efficient key distribution mechanism. A comparison with well studied network coding schemes MacSig [13] and Dual HMAC [14] indicate that the proposed block chain enhanced secure network coding scheme reduces the computational complexity and the communication overhead significantly.…”

Section: Introductionmentioning

confidence: 99%

On Blockchain Enhanced Secure Network Coding for 5G Deployments

Adat

Politis

Tselios

et al. 2018

2018 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

The fifth generation of mobile networks is rapidly evolving, fueled by the ever-growing mobile traffic over recent years. Ultra-reliable and low latency provisioning of services with ranging contextual parameters mapped to highly fluctuating levels of quality of service and quality of user experience, render the optimum operation point of the future networks unsustainable. Network coding is emerging once more as a potential key enabler for optimizing bandwidth requirements and energy consumption in highly dense mobile network environments. Nonetheless, network coding deployments still need to consider security vulnerabilities and their countermeasures, before they can be adapted as part of the emerging mobile network deployments. This paper studies the performance of random linear network coding for wireless mobile networks with an emphasis on pollution attacks while proposing a novel blockchain based message authentication scheme in order to minimize delays and signalling costs.

show abstract

Section: Introductionmentioning

confidence: 99%

On Blockchain Enhanced Secure Network Coding for 5G Deployments

Adat

Politis

Tselios

et al. 2018

2018 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

show abstract

“…This method allows the system to check the integrity of network coded data and also to track and find malicious nodes in the network. However, due to high processing cost, this method is not practical [6]. While there exist alternatives for preventing pollution attacks with reduced processing costs, these solutions place limitations on topologies, require loose clock synchronization on the order of 100 ms, limit the hop count, require large field sizes or demand new public keys to be generated per generation.…”

Section: Introductionmentioning

confidence: 99%

“…A pollution attack occurs when a malicious or faulty node injects invalid linear combinations of generation into the network [5]. These invalid coded packets can quickly propagate into other packets via recoding in relay nodes and can prevent the destination node from decoding properly [6]. To prevent pollution attacks, homomorphic signatures, which are preserved through linear combination and recoding, can be used [7][8][9].…”

Section: Introductionmentioning

confidence: 99%

On the Performance of the Cache Coding Protocol

et al. 2018

View full text Add to dashboard Cite

Network coding approaches typically consider an unrestricted recoding of coded packets in the relay nodes to increase performance. However, this can expose the system to pollution attacks that cannot be detected during transmission, until the receivers attempt to recover the data. To prevent these attacks while allowing for the benefits of coding in mesh networks, the cache coding protocol was proposed. This protocol only allows recoding at the relays when the relay has received enough coded packets to decode an entire generation of packets. At that point, the relay node recodes and signs the recoded packets with its own private key, allowing the system to detect and minimize the effect of pollution attacks and making the relays accountable for changes on the data. This paper analyzes the delay performance of cache coding to understand the security-performance trade-off of this scheme. We introduce an analytical model for the case of two relays in an erasure channel relying on an absorbing Markov chain and an approximate model to estimate the performance in terms of the number of transmissions before successfully decoding at the receiver. We confirm our analysis using simulation results. We show that cache coding can overcome the security issues of unrestricted recoding with only a moderate decrease in system performance.

show abstract

“…To prevent them, homomorphic signatures, which are preserved through linear combination and recoding, can be used [4] [5] [7]. These method allow the system to check integrity of network coded data and to track and find malicious nodes in the network However, due to high processing cost, this method is not practical [11]. While there exists alternatives for preventing pollution attacks with reduced processing costs, these solutions place limitations on topologies, require loose clock synchronization on the order of 100 ms, limit the hop count, require large field sizes or demand new public keys generated per generation.…”

Section: Introductionmentioning

confidence: 99%

“…A pollution attack occurs when a malicious or faulty node injects invalid linear combinations of generation into the network [16]. These invalid coded packets can quickly propagate into other packets via recoding in relay nodes and can prevent destination node from decoding properly [11]. To prevent them, homomorphic signatures, which are preserved through linear combination and recoding, can be used [4] [5] [7].…”

Section: Introductionmentioning

confidence: 99%

On the Performance of the Cache Coding Protocol

Maboudi¹,

Sehat²,

Pahlevani³

et al. 2018

Preprint

View full text Add to dashboard Cite

Network coding approaches typically consider an unrestricted recoding of coded packets in the relay nodes for increased performance. However, this can expose the system to pollution attacks that cannot be detected during transmission, until the receivers attempt to recover the data. To prevent these attacks while allowing for the benefits of coding in mesh networks, the Cache Coding was proposed. This protocol only allows recoding at the relays when the relay has received enough packets to decode an entire generation of packets. At that point, the relay node recodes and signs the recoded packets with its own private key allowing for the system to detect and minimize the effect of pollution attacks and make relays accountable for changes on the data. This paper analyzes the delay performance of Cache Coding to understand the security-performance trade-off of this scheme. We introduce an analytical model for the case of two relays in an erasure channel relying on an Absorbing Markov Chain and a approximate model to estimate the performance in terms of the number of transmissions before successfully decoding at the receiver. We confirm our analysis using simulation results. We show that Cache Coding can overcome security issues of unrestricted recoding with only a moderate decrease in system performance.

show abstract

An efficient homomorphic MAC-based scheme against data and tag pollution attacks in network coding-enabled wireless networks

Cited by 37 publications

References 21 publications

On Blockchain Enhanced Secure Network Coding for 5G Deployments

On Blockchain Enhanced Secure Network Coding for 5G Deployments

On the Performance of the Cache Coding Protocol

On the Performance of the Cache Coding Protocol

Contact Info

Product

Resources

About