Thwarting Diversity Attacks in wireless network coding using threshold signatures and a sender-centered approach

Juan Camilo Corena, Tomoaki Ohtsuki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this work we present two t-collusion resistant schemes to detect nodes performing 'Diversity Attacks' in network coding. This attack was introduced by Popa et al. in [1] and occurs when nodes performing network coding, do not code from some of their neighbors or they do not use random coefficients, which reduces network performance; this attack is fundamentally different from Pollution Attacks and it cannot be detected by current pollution prevention schemes. Our construction differs from the original solution in that it makes use of the broadcast nature of wireless networks; which allows us to reduce the computational load of both receivers and senders compared to their non-probabilistic solution; as an additional advantage, one of our constructions works without knowledge of the topology beyond the neighbors of a node, improving one of the shortcomings of the original solution. Tools employed in our constructions involve threshold digital signatures and aggregate Message Authentication Codes (MACs).

Original languageEnglish
Title of host publicationGLOBECOM - IEEE Global Telecommunications Conference
Pages1060-1065
Number of pages6
DOIs
Publication statusPublished - 2012
Event2012 IEEE Global Communications Conference, GLOBECOM 2012 - Anaheim, CA, United States
Duration: 2012 Dec 32012 Dec 7

Other

Other2012 IEEE Global Communications Conference, GLOBECOM 2012
CountryUnited States
CityAnaheim, CA
Period12/12/312/12/7

Fingerprint

Network coding
Wireless networks
Pollution
Electronic document identification systems
Network performance
Authentication
Topology

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Thwarting Diversity Attacks in wireless network coding using threshold signatures and a sender-centered approach. / Corena, Juan Camilo; Ohtsuki, Tomoaki.

GLOBECOM - IEEE Global Telecommunications Conference. 2012. p. 1060-1065 6503253.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Corena, JC & Ohtsuki, T 2012, Thwarting Diversity Attacks in wireless network coding using threshold signatures and a sender-centered approach. in GLOBECOM - IEEE Global Telecommunications Conference., 6503253, pp. 1060-1065, 2012 IEEE Global Communications Conference, GLOBECOM 2012, Anaheim, CA, United States, 12/12/3. https://doi.org/10.1109/GLOCOM.2012.6503253
Corena, Juan Camilo ; Ohtsuki, Tomoaki. / Thwarting Diversity Attacks in wireless network coding using threshold signatures and a sender-centered approach. GLOBECOM - IEEE Global Telecommunications Conference. 2012. pp. 1060-1065
@inproceedings{e740a614155049dd81dd4729d6980812,
title = "Thwarting Diversity Attacks in wireless network coding using threshold signatures and a sender-centered approach",
abstract = "In this work we present two t-collusion resistant schemes to detect nodes performing 'Diversity Attacks' in network coding. This attack was introduced by Popa et al. in [1] and occurs when nodes performing network coding, do not code from some of their neighbors or they do not use random coefficients, which reduces network performance; this attack is fundamentally different from Pollution Attacks and it cannot be detected by current pollution prevention schemes. Our construction differs from the original solution in that it makes use of the broadcast nature of wireless networks; which allows us to reduce the computational load of both receivers and senders compared to their non-probabilistic solution; as an additional advantage, one of our constructions works without knowledge of the topology beyond the neighbors of a node, improving one of the shortcomings of the original solution. Tools employed in our constructions involve threshold digital signatures and aggregate Message Authentication Codes (MACs).",
author = "Corena, {Juan Camilo} and Tomoaki Ohtsuki",
year = "2012",
doi = "10.1109/GLOCOM.2012.6503253",
language = "English",
isbn = "9781467309219",
pages = "1060--1065",
booktitle = "GLOBECOM - IEEE Global Telecommunications Conference",

}

TY - GEN

T1 - Thwarting Diversity Attacks in wireless network coding using threshold signatures and a sender-centered approach

AU - Corena, Juan Camilo

AU - Ohtsuki, Tomoaki

PY - 2012

Y1 - 2012

N2 - In this work we present two t-collusion resistant schemes to detect nodes performing 'Diversity Attacks' in network coding. This attack was introduced by Popa et al. in [1] and occurs when nodes performing network coding, do not code from some of their neighbors or they do not use random coefficients, which reduces network performance; this attack is fundamentally different from Pollution Attacks and it cannot be detected by current pollution prevention schemes. Our construction differs from the original solution in that it makes use of the broadcast nature of wireless networks; which allows us to reduce the computational load of both receivers and senders compared to their non-probabilistic solution; as an additional advantage, one of our constructions works without knowledge of the topology beyond the neighbors of a node, improving one of the shortcomings of the original solution. Tools employed in our constructions involve threshold digital signatures and aggregate Message Authentication Codes (MACs).

AB - In this work we present two t-collusion resistant schemes to detect nodes performing 'Diversity Attacks' in network coding. This attack was introduced by Popa et al. in [1] and occurs when nodes performing network coding, do not code from some of their neighbors or they do not use random coefficients, which reduces network performance; this attack is fundamentally different from Pollution Attacks and it cannot be detected by current pollution prevention schemes. Our construction differs from the original solution in that it makes use of the broadcast nature of wireless networks; which allows us to reduce the computational load of both receivers and senders compared to their non-probabilistic solution; as an additional advantage, one of our constructions works without knowledge of the topology beyond the neighbors of a node, improving one of the shortcomings of the original solution. Tools employed in our constructions involve threshold digital signatures and aggregate Message Authentication Codes (MACs).

UR - http://www.scopus.com/inward/record.url?scp=84877650841&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84877650841&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.2012.6503253

DO - 10.1109/GLOCOM.2012.6503253

M3 - Conference contribution

AN - SCOPUS:84877650841

SN - 9781467309219

SP - 1060

EP - 1065

BT - GLOBECOM - IEEE Global Telecommunications Conference

ER -