Paper 2012/447
Multi-receiver Homomorphic Authentication Codes for Network Coding
Zhaohui Tang and Hoon Wei Lim
Abstract
We investigate a new class of authenticate codes (A-codes) that support verification by a group of message recipients in the network coding setting. That is, a sender generates an A-code over a message such that any intermediate node or recipient can check the authenticity of the message, typically to detect pollution attacks. We call such an A-code as multi-receiver homomorphic A-code (MRHA-code). In this paper, we first formally define an MRHA-code. We then derive some lower bounds on the security parameters and key sizes associated with our MRHA-codes. Moreover, we give efficient constructions of MRHA-code schemes that can be used to mitigate pollution attacks on network codes. Unlike prior works on computationally secure homomorphic signatures and MACs for network coding, our MRHA-codes achieve unconditional security.
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Authentication codesnetwork codinghomomorphismunconditional security
- Contact author(s)
- TANG0209 @ e ntu edu sg
- History
- 2012-11-03: last of 7 revisions
- 2012-08-06: received
- See all versions
- Short URL
- https://ia.cr/2012/447
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2012/447,
author = {Zhaohui Tang and Hoon Wei Lim},
title = {Multi-receiver Homomorphic Authentication Codes for Network Coding},
howpublished = {Cryptology {ePrint} Archive, Paper 2012/447},
year = {2012},
url = {https://eprint.iacr.org/2012/447}
}
