Fast Multicast Scheme with Secure Network Coding in Cloud Data Centers
- Sciences State Key Laboratory of Mathematical Engineering and Advanced Computing
450001 Zhengzhou, China
kx.huang@outlook.com - China National Digital Switching System Engineering and Technological Research Centre
450001 Zhengzhou, China
Cyue2008@126.com - Department of Computer Sciences of the University of Hongkong
Hongkong, China
Abstract
Multicast is widely applied in cloud data centers. Because intermediate nodes can encode the packets, network coding improves the capacity and robustness of multicast applications. However, this system is vulnerable to pollution attacks. Existing schemes mainly focus on homomorphic cryptographic technologies against such attacks. However, the homomorphic cryptographic technology introduces complicated key management and calculation and storage overhead. This paper proposes a novel, fast, and secure network-coding multicast on software-defined networks. This scheme separates the complicated secure multicast management from fast data transmission. In the control layer, when users and switches try to join the secure multicast, they are authenticated and authorized by the controller. Only trusted nodes can join the forwarding paths. In the data layer, the trusted nodes only forward the data. The proposed scheme can use traditional cryptography without homomorphy; thus, it greatly reduces computation complexity, improves transmission efficiency, and thwarts pollution and eavesdropping attacks.
Key words
cloud data center, multicast, secure network coding, software-defined networks
Digital Object Identifier (DOI)
https://doi.org/10.2298/CSIS160222013H
Publication information
Volume 13, Issue 2 (June 2016)
Year of Publication: 2016
ISSN: 2406-1018 (Online)
Publisher: ComSIS Consortium
Full text
Available in PDF
Portable Document Format
How to cite
Huang, K., Chen, Y., Jia, H., Lan, J., Yan, X., Wang, Z.: Fast Multicast Scheme with Secure Network Coding in Cloud Data Centers. Computer Science and Information Systems, Vol. 13, No. 2, 531–545. (2016), https://doi.org/10.2298/CSIS160222013H