A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
On Fast and Provably Secure Message Authentication Based on Universal Hashing
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Efficient Authentication and Signing of Multicast Streams over Lossy Channels
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
XORs in the air: practical wireless network coding
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Hot topic: physical-layer network coding
Proceedings of the 12th annual international conference on Mobile computing and networking
Practical network coding in wireless networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Homomorphic MACs: MAC-Based Integrity for Network Coding
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
HAIL: a high-availability and integrity layer for cloud storage
Proceedings of the 16th ACM conference on Computer and communications security
XOR rescue: exploiting network coding in lossy wireless networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
RIPPLE authentication for network coding
INFOCOM'10 Proceedings of the 29th conference on Information communications
Energy Friendly Integrity for Network Coding in Wireless Sensor Networks
NSS '10 Proceedings of the 2010 Fourth International Conference on Network and System Security
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In INFOCOM 2009, Yu, Wei, Ramkumar and Guan have proposed the novel mechanism (called Yu's scheme), in which a forwarder can filter polluted messages before spreading the pollution in the XOR network coding systems. In order to perform such filtering, two or more message authentication codes (MACs) are used for this scheme. However, Yu's scheme has a problem that the number of MACs increases at every coding point, since it cannot operate MACs with the XOR network coding. This means that the MAC of Yu's scheme does not have homomorphic property. In this paper, we propose the first symmetric-key-based scheme not only to filter polluted messages but also to operate MACs with the XOR network coding on a forwarder. The XOR network coding of MACs produces improvement which does not increase the number of MACs at a coding point. Our scheme uses the UHFs-based MAC with a homomorphic property to hold homomorphic MAC, and hence it can aggregate MACs in our XOR network coding systems. We emphasize that a forwarder cannot straightforward filter polluted messages even if our scheme uses the UHFs-based MACs.