Efficient multiple sources network coding signature in the standard model. (25th July 2014)

• Record Type: Journal Article
• Authors: Zhang, Jinlin; Shao, Jun; Ling, Yun; Ji, Min; Wei, Guiyi; Ying, Bishan; Xiang, Yang; Pathan, Mukaddim; Wei, Guiyi; Fortino, Giancarlo
• Is Part Of: Concurrency and computation. Volume 27:Number 10(2015:Jul.)
• Page Start: 2616
• Page End: 2636
• Publication Date: 2014-07-25
• Subjects: Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.3322
• Languages: English
• ISSNs: 1532-0626

Abstract

<abstract abstract-type="main" id="cpe3322-abs-0001"> <title>Summary</title> <p id="cpe3322-para-0001">Network coding is a new routing technique that can improve a network's throughput. The key idea is to allow network routers to code the received packets before transmission. However, network coding is vulnerable to pollution attacks where malicious node(s) can flood the network with invalid packets and prevent the receiver from the right decoding. Network coding signature offers a good solution to this problem. Nevertheless, existing network coding signature schemes cannot either be proven secure in the standard model, support multiple sources, or in‐time signing. In this paper, we propose a new network coding signature scheme to solve the aforementioned problems. Copyright © 2014 John Wiley &amp; Sons, Ltd.</p> </abstract>