Network Coding Signature Scheme Research Articles

Certificateless Homomorphism Network Coding Signature Scheme

As an information transmission technology, network coding can reduce the transmission delay and improve the transmission efficiency with network performance. However, the nodes in network are vulnerable to the pollution and forgery attacks. Until now, most of network coding schemes are from pairing. Under the requirement of low computation complexity, we construct certificateless homomorphism network coding signature scheme (CL-HNCSS). In CL-HNCSS, certificateless technology avoids key management and key escrow for multi-source nodes, the homomorphism and scalar multiplication are used to reduce the computation cost. CL-HNCSS satisfies the unforgeability under the adaptive chosen-message attacks and can resist the pollution attacks. In addition, CL-HNCSS has very high communication and computation efficiency.

A certificateless linearly homomorphic signature scheme for network coding and its application in the IoT

Network coding is an effective method to optimize network throughput and improve routing reliability, and has been widely used in a decentralized Internet of Things system. However, the packet-mixing property of network coding renders transmission susceptible to pollution attacks, which may prevent the reconstruction of the original file. A homomorphic signature scheme is a powerful tool that enables network coding to combat pollution attacks. Although a series of homomorphic signature schemes already exists, no construction has been proposed to support both homomorphic network coding signatures and the certificateless characteristic. In this paper, we construct a certificateless linearly homomorphic signature scheme for network coding, thus avoiding the disadvantages of certificate management and key escrow problems. We then prove the security of the scheme in a random oracle model against an adaptively chosen dataset attack under two types of adversaries. Moreover, performance analysis results show that our scheme has a lower communication overhead and enjoys a comparable computation cost with related schemes.

Lightweight certificateless linearly homomorphic network coding signature scheme for electronic health system

With the flourishing development of the Internet of Things (IoT), the electronic health system (EHS) as a leading technology has attracted widespread attention. However, the unsatisfactory network transmission throughput hinders practical applications of EHS to some extent. Network coding can solve this problem, but it also incurs another drawback called pollution attack. Pollution attack can be prevented by using homomorphic network coding signature schemes to check whether a corrupted packet is injected. However, existing schemes require high computational cost for signature verification which will reduce the transmission efficiency. A lightweight certificateless linearly homomorphic network coding signature scheme is proposed. This scheme requires a quite low computational cost when both signing and verifying a data packet. In addition, it is proved that the scheme is secure, and it was implemented by using the Java Pairing-Based Cryptography Library (JPBC) on a personal computer (PC). The simulation results illustrate that our scheme is efficient.

A Privacy Preserving Network Coding Signature Scheme Based on Lattice

Network coding is a desirable method to optimize network throughput and improve routing reliability, and is widely used in distributed Internet of Things systems. However, the packet mixing characteristic of network coding makes the transmission vulnerable to pollution attacks, which may hinder the reconstruction of the original data. Moreover, network coding has the potential to resist privacy threats such as eavesdropping attacks since intermediate nodes encourage coding / mixing operations, however, once adversary collects enough packets, simple network coding deployment can not achieve this purpose. In this paper we first present a privacy-preserving network coding signature scheme using lattice theory, which can be viewed as a promising tool for designing post-quantum cryptographic protocols. We blind the global coefficient matrix by encrypting the original encoding vector so as to resist eavesdropping attack, while preventing both intra/inter-generation pollution attacks by simultaneously signing the data packet and the generation identifier. We showed that our scheme is correct, and also proved that our scheme is secure against both eavesdropping and pollution attacks under the security of pseudo-random function and the small integer solution (SIS) assumption in standard lattices.

Secure Data Delivery With Identity-Based Linearly Homomorphic Network Coding Signature Scheme in IoT

With the appearance and flourishing development of the Internet of Things (IoT), wireless sensor networks technology has been attracting increasing attention. Network coding is an indispensable technology in the wireless sensor networks, which can improve network transmission throughput. However, pollution attacks is a serious security problem that must be faced in the process of data coding. Although the homomorphic network coding signature schemes can solve this troublesome, the high signature generation and verification cost of these schemes will reduce the transmission efficiency. In this article, we propose an efficient identity-based linearly homomorphic network coding signature scheme for wireless sensor networks to guarantee data integrity and authenticity. In our scheme, the computation cost of signature generation and verification are both independent of the size of the data packet. The scheme is proved secure against existential forgery under adaptive chosen identity and adaptive chosen subspace attacks in random oracle model. Using Java pairing-based Cryptography Library (JPBC), the simulation results illustrate that our scheme is more efficient in practical application.

A Privacy-Preserving Signature Scheme for Network Coding

In this paper, a novel privacy-preserving signature scheme for network coding is proposed, which can mitigate both intra-generation and inter-generation pollution attacks efficiently, and leverage the inherent security property of random network coding to prevent eavesdropping attacks at the same time. Our scheme is constructed on a bi-linear map between two multiplicative cyclic groups with the same order, and its security relies on the hardness of the discrete logarithm problem. We proved that the construction of our scheme is correct, and also showed that our scheme is resistant against both pollution attacks and eavesdropping attacks by demonstrating that the probabilities of an adversary recovering the native messages and forging a valid signature for a bogus packet are both negligible functions of the security parameter. We evaluated the performance of our scheme in terms of communication overhead and computational complexity, and carried out extensive experiments to compare the running time of different procedures between our scheme and several previous schemes. The experimental results showed that our scheme is more efficient than the previous schemes simulated.

A Homomorphic Network Coding Signature Scheme for Multiple Sources and its Application in IoT

As a method for increasing throughput and improving reliability of routing, network coding has been widely used in decentralized IoT systems. When files are shared in the system, network coding signature techniques can help authenticate whether a modified packet in files is injected or not. However, in an IoT system, there are often multiple source devices each of which has its own authentication key, where existing single-source network coding signature schemes cannot work. In this paper, we study the problem of designing secure network coding signatures in the network with multiple sources and propose the multisource homomorphic network coding signature. We also give construction and prove its security.

Efficient Post-Quantum Secure Network Coding Signatures in the Standard Model

In contrast to traditional “store-and-forward” routing mechanisms, network coding offers an elegant solution for achieving maximum network throughput. The core idea is that intermediate network nodes linearly combine received data packets so that the destination nodes can decode original files from some authenticated packets. Although network coding has many advantages, especially in wireless sensor network and peer-to-peer network, the encoding mechanism of intermediate nodes also results in some additional security issues. For a powerful adversary who can control arbitrary number of malicious network nodes and can eavesdrop on the entire network, cryptographic signature schemes provide undeniable authentication mechanisms for network nodes. However, with the development of quantum technologies, some existing network coding signature schemes based on some traditional number-theoretic primitives vulnerable to quantum cryptanalysis. In this paper we first present an efficient network coding signature scheme in the standard model using lattice theory, which can be viewed as the most promising tool for designing post-quantum cryptographic protocols. In the security proof, we propose a new method for generating a random lattice and the corresponding trapdoor, which may be used in other cryptographic protocols. Our scheme has many advantages, such as supporting multi-source networks, low computational complexity and low communication overhead.

Security analysis of a homomorphic signature scheme for network coding

AbstractRecently, Liu and Wang proposed a homomorphic signature scheme for network coding, which was claimed to resist against pollution attacks. However, we show that in Liu and Wang's scheme, after several generations, the adversary is able to launch a successful forgery attack with a high probability. Therefore, Liu and Wang's scheme is not secure. After analyzing the cause of the attack, an improved scheme is given, which can combat against the proposed attack in an efficient way. Copyright © 2015 John Wiley & Sons, Ltd.

Efficient multiple sources network coding signature in the standard model

SummaryNetwork 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 & Sons, Ltd.

An efficient ECC-based mechanism for securing network coding-based P2P content distribution

Network coding has been demonstrated to be able to improve the performance of P2P content distribution. However, it is vulnerable to pollution attacks where malicious peers can flood the network with corrupted blocks easily, leading to substantial performance degradation. Moreover, existing corruption detection schemes for network coding are not well suited to P2P systems. Effective scheme to detect the corruption and identify the attacker is required to thwart such attacks. In this paper, we propose an efficient ECC-based mechanism for securing network coding-based P2P content distribution, namely ESNC, which includes an efficient network coding signature scheme and an identity-based malicious peer identification scheme. The two schemes cooperate to thwart pollution attacks on network coding effectively in P2P networks, not only detecting corrupted blocks on-the-fly efficiently, but also precisely identifying all the malicious peers quickly. ESNC is mainly based on elliptic curve cryptography (ECC) and can provide high level of security. It incurs significantly less computation and communication overheads than other comparable state-of-the-art schemes for P2P systems. ESNC can work with arbitrary topologies, as it is the case in P2P networks. Security analysis demonstrates that ESNC can resist hash collision attacks, signature forgery attacks, and collusion attacks with arbitrary number of colluding malicious peers. Simulation results show that ESNC effectively limits the corruption spread and identifies all the malicious peers in a short time under different practical settings.

An efficient dynamic-identity based signature scheme for secure network coding

The network coding based applications are vulnerable to possible malicious pollution attacks. Signature schemes have been well-recognized as the most effective approach to address this security issue. However, existing homomorphic signature schemes for network coding either incur high transmission/computation overhead, or are vulnerable to random forgery attacks. In this paper, we propose a novel dynamic-identity based signature scheme for network coding by signing linear vector subspaces. The scheme can rapidly detect/drop the packets that are generated from pollution attacks, and efficiently thwart random forgery attack. By employing fast packet-based and generation-based batch verification approaches, a forwarding node can verify multiple received packets synchronously with dramatically reduced total verification cost. In addition, the proposed scheme provides one-way identity authentication without requiring any extra secure channels or separate certificates, so that the transmission cost can be significantly reduced. Simulation results demonstrate the practicality and efficiency of the proposed schemes.