How to construct random functions
Journal of the ACM (JACM)
Perfectly secure message transmission
Journal of the ACM (JACM)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Efficient Authentication and Signing of Multicast Streams over Lossy Channels
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
XORs in the air: practical wireless network coding
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Decentralized security mechanisms for routing protocols
Decentralized security mechanisms for routing protocols
Network Coding Theory (Foundations and Trends(R) in Communications and Information Theory)
Network Coding Theory (Foundations and Trends(R) in Communications and Information Theory)
Efficient operation of coded packet networks
Efficient operation of coded packet networks
Practical defenses against pollution attacks in intra-flow network coding for wireless mesh networks
Proceedings of the second ACM conference on Wireless network security
Broadcasting with locally bounded Byzantine faults
Information Processing Letters
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction
IEEE Transactions on Information Theory
Resilient Network Coding in the Presence of Byzantine Adversaries
IEEE Transactions on Information Theory
Homomorphic network coding signatures in the standard model
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Preventing pollution attacks in multi-source network coding
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Cooperatively securing network coding against pollution attacks with incentive mechanism
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
Entropy attacks and countermeasures in wireless network coding
Proceedings of the fifth ACM conference on Security and Privacy in Wireless and Mobile Networks
Lightweight integrity for XOR network coding in wireless sensor networks
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
On the practicality of cryptographic defences against pollution attacks in wireless network coding
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
By allowing routers to randomly mix the information content in packets before forwarding them, network coding can maximize network throughput in a distributed manner with low complexity. However, such mixing also renders the transmission vulnerable to pollution attacks, where a malicious node injects corrupted packets into the information flow. In a worst case scenario, a single corrupted packet can end up corrupting all the information reaching a destination. In this paper, we propose RIPPLE, a symmetric key based in-network scheme for network coding authentication. RIPPLE allows a node to efficiently detect corrupted packets and encode only the authenticated ones. Despite using symmetric key based homomorphic Message Authentication Code (MAC) algorithms, RIPPLE achieves asymmetry by delayed disclosure of the MAC keys. Our work is the first symmetric key based solution to allow arbitrary collusion among adversaries. It is also the first to consider tag pollution attacks, where a single corrupted MAC tag can cause numerous packets to fail authentication farther down the stream, effectively emulating a successful pollution attack.