XOR network coding pollution prevention without homomorphic functions

Juan Camilo Corena, Anirban Basu, Shinsaku Kiyomoto, Yutaka Miyake, Tomoaki Ohtsuki

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

1 Citation (Scopus)

Abstract

Network coding is a way of transmitting information where nodes in a network combine incoming packets into a single one to increase throughput in some scenarios, nodes wishing to get the original information can perform decoding when enough packets have been received. Given its efficiency, the exclusive or (XOR) operation is very popular for network coding. One security concern for networks using network coding is the so called 'pollution attack', where an adversary introduces packets that are not combinations of the original ones. In this paper, we present a construction to prevent pollution attacks in XOR network coding that is suitable for networks where nodes must perform fast verifications. Unlike existing constructions in the literature which are based on XOR-homomorphic authentication functions, our construction can be instantiated with existing cryptographic primitives that are not related to the XOR operation. The core insight of our proposal is a carefully selected set of authenticated packets that are used to authenticate the network coding stream. We show that our proposal is computationally efficient at the intermediate nodes and that can be computed efficiently at the nodes which are generating the content.

Original languageEnglish
Title of host publication2014 IEEE 11th Consumer Communications and Networking Conference, CCNC 2014
PublisherIEEE Computer Society
Pages293-300
Number of pages8
ISBN (Print)9781479923557
DOIs
Publication statusPublished - 2014
Event2014 IEEE 11th Consumer Communications and Networking Conference, CCNC 2014 - Las Vegas, NV, United States
Duration: 2014 Jan 102014 Jan 13

Other

Other2014 IEEE 11th Consumer Communications and Networking Conference, CCNC 2014
CountryUnited States
CityLas Vegas, NV
Period14/1/1014/1/13

Fingerprint

Network coding
Pollution
Authentication
Decoding
Throughput

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Corena, J. C., Basu, A., Kiyomoto, S., Miyake, Y., & Ohtsuki, T. (2014). XOR network coding pollution prevention without homomorphic functions. In 2014 IEEE 11th Consumer Communications and Networking Conference, CCNC 2014 (pp. 293-300). [6866586] IEEE Computer Society. https://doi.org/10.1109/CCNC.2014.6866586

XOR network coding pollution prevention without homomorphic functions. / Corena, Juan Camilo; Basu, Anirban; Kiyomoto, Shinsaku; Miyake, Yutaka; Ohtsuki, Tomoaki.

2014 IEEE 11th Consumer Communications and Networking Conference, CCNC 2014. IEEE Computer Society, 2014. p. 293-300 6866586.

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

Corena, JC, Basu, A, Kiyomoto, S, Miyake, Y & Ohtsuki, T 2014, XOR network coding pollution prevention without homomorphic functions. in 2014 IEEE 11th Consumer Communications and Networking Conference, CCNC 2014., 6866586, IEEE Computer Society, pp. 293-300, 2014 IEEE 11th Consumer Communications and Networking Conference, CCNC 2014, Las Vegas, NV, United States, 14/1/10. https://doi.org/10.1109/CCNC.2014.6866586
Corena JC, Basu A, Kiyomoto S, Miyake Y, Ohtsuki T. XOR network coding pollution prevention without homomorphic functions. In 2014 IEEE 11th Consumer Communications and Networking Conference, CCNC 2014. IEEE Computer Society. 2014. p. 293-300. 6866586 https://doi.org/10.1109/CCNC.2014.6866586
Corena, Juan Camilo ; Basu, Anirban ; Kiyomoto, Shinsaku ; Miyake, Yutaka ; Ohtsuki, Tomoaki. / XOR network coding pollution prevention without homomorphic functions. 2014 IEEE 11th Consumer Communications and Networking Conference, CCNC 2014. IEEE Computer Society, 2014. pp. 293-300
@inproceedings{34cad036fe184bdda0a8ebbd191f739c,
title = "XOR network coding pollution prevention without homomorphic functions",
abstract = "Network coding is a way of transmitting information where nodes in a network combine incoming packets into a single one to increase throughput in some scenarios, nodes wishing to get the original information can perform decoding when enough packets have been received. Given its efficiency, the exclusive or (XOR) operation is very popular for network coding. One security concern for networks using network coding is the so called 'pollution attack', where an adversary introduces packets that are not combinations of the original ones. In this paper, we present a construction to prevent pollution attacks in XOR network coding that is suitable for networks where nodes must perform fast verifications. Unlike existing constructions in the literature which are based on XOR-homomorphic authentication functions, our construction can be instantiated with existing cryptographic primitives that are not related to the XOR operation. The core insight of our proposal is a carefully selected set of authenticated packets that are used to authenticate the network coding stream. We show that our proposal is computationally efficient at the intermediate nodes and that can be computed efficiently at the nodes which are generating the content.",
author = "Corena, {Juan Camilo} and Anirban Basu and Shinsaku Kiyomoto and Yutaka Miyake and Tomoaki Ohtsuki",
year = "2014",
doi = "10.1109/CCNC.2014.6866586",
language = "English",
isbn = "9781479923557",
pages = "293--300",
booktitle = "2014 IEEE 11th Consumer Communications and Networking Conference, CCNC 2014",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - XOR network coding pollution prevention without homomorphic functions

AU - Corena, Juan Camilo

AU - Basu, Anirban

AU - Kiyomoto, Shinsaku

AU - Miyake, Yutaka

AU - Ohtsuki, Tomoaki

PY - 2014

Y1 - 2014

N2 - Network coding is a way of transmitting information where nodes in a network combine incoming packets into a single one to increase throughput in some scenarios, nodes wishing to get the original information can perform decoding when enough packets have been received. Given its efficiency, the exclusive or (XOR) operation is very popular for network coding. One security concern for networks using network coding is the so called 'pollution attack', where an adversary introduces packets that are not combinations of the original ones. In this paper, we present a construction to prevent pollution attacks in XOR network coding that is suitable for networks where nodes must perform fast verifications. Unlike existing constructions in the literature which are based on XOR-homomorphic authentication functions, our construction can be instantiated with existing cryptographic primitives that are not related to the XOR operation. The core insight of our proposal is a carefully selected set of authenticated packets that are used to authenticate the network coding stream. We show that our proposal is computationally efficient at the intermediate nodes and that can be computed efficiently at the nodes which are generating the content.

AB - Network coding is a way of transmitting information where nodes in a network combine incoming packets into a single one to increase throughput in some scenarios, nodes wishing to get the original information can perform decoding when enough packets have been received. Given its efficiency, the exclusive or (XOR) operation is very popular for network coding. One security concern for networks using network coding is the so called 'pollution attack', where an adversary introduces packets that are not combinations of the original ones. In this paper, we present a construction to prevent pollution attacks in XOR network coding that is suitable for networks where nodes must perform fast verifications. Unlike existing constructions in the literature which are based on XOR-homomorphic authentication functions, our construction can be instantiated with existing cryptographic primitives that are not related to the XOR operation. The core insight of our proposal is a carefully selected set of authenticated packets that are used to authenticate the network coding stream. We show that our proposal is computationally efficient at the intermediate nodes and that can be computed efficiently at the nodes which are generating the content.

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

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

U2 - 10.1109/CCNC.2014.6866586

DO - 10.1109/CCNC.2014.6866586

M3 - Conference contribution

AN - SCOPUS:84906834400

SN - 9781479923557

SP - 293

EP - 300

BT - 2014 IEEE 11th Consumer Communications and Networking Conference, CCNC 2014

PB - IEEE Computer Society

ER -