Please use this identifier to cite or link to this item:
|Title:||Multi-receiver authentication code for network coding||Authors:||Oggier, Frederique
|Keywords:||DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems||Issue Date:||2008||Abstract:||Systems exploiting network coding suffer greatly from pollution attacks which consist of injecting malicious packets in the network. The pollution attacks are amplified by the network coding process resulting in a greater damage than under traditional routing. In this paper, we address this issue with unconditionally secure multi-receiver authentication codes designed for network coding. Our scheme is robust against pollution attacks from outsiders and even from a coalition of k-1 malicious insiders. With our authentication code, intermediate nodes can verify the message integrity and origin of the packets received without having to decode and thus detect and discard the malicious packets in-transit that fail the verification. This way, the pollution is canceled out before reaching the destinations.||URI:||https://hdl.handle.net/10356/91655
|Rights:||© 2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||SPMS Conference Papers|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.