Security analysis of a homomorphic signature scheme for network coding

Jiang, Tao; Liu, Yining; Zhang, Mingwu

doi:10.1002/sec.1321

Cited by 13 publications

(4 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to (13) and (14), computing γ 1 consumes one bilinear map operation whereas computing γ 2 consumes one bilinear map operation, m + n + 1 exponentiations, and m + n + 1 multiplications. Therefore, we have…”

Section: Performance Evaluation a Communication Overheadmentioning

confidence: 99%

A Privacy-Preserving Signature Scheme for Network Coding

Liu

Huang

et al. 2019

IEEE Access

View full text Add to dashboard Cite

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. INDEX TERMS Network coding, pollution attacks, homomorphic signature, eavesdropping attacks.

show abstract

Section: Performance Evaluation a Communication Overheadmentioning

confidence: 99%

A Privacy-Preserving Signature Scheme for Network Coding

Liu

Huang

et al. 2019

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Homomorphic and data aggregation schemes are also widely used in other fields. In [23], Cheng et al present an improved scheme after analyzing the security of the homomorphic signature scheme of network coding, which can effectively deal with the proposed attack. Liu et al [24] propose a privacy-preserving health data aggregation scheme based on differential privacy, which not only resists against various attacks, but also achieves the robustness.…”

Section: Related Workmentioning

confidence: 99%

Secure and Fine-grained Electricity Consumption Aggregation Scheme for Smart Grid

2018

KSII TIIS

View full text Add to dashboard Cite

Currently, many of schemes for smart grid data aggregation are based on a one-level gateway (GW) topology. Since the data aggregation granularity in this topology is too single, the control center (CC) is unable to obtain more fine-grained data aggregation results for better monitoring smart grid. To improve this issue, Shen et al. propose an efficient privacy-preserving cube-data aggregation scheme in which the system model consists of two-level GW. However, a risk exists in their scheme that attacker could forge the signature by using leaked signing keys. In this paper, we propose a secure and fine-grained electricity consumption aggregation scheme for smart grid, which employs the homomorphic encryption to implement privacy-preserving aggregation of users' electricity consumption in the two-level GW smart grid. In our scheme, CC can achieve a flexible electricity regulation by obtaining data aggregation results of various granularities. In addition, our scheme uses the forward-secure signature with backward-secure detection (FSBD) technique to ensure the forward-backward secrecy of the signing keys. Security analysis and experimental results demonstrate that the proposed scheme can achieve forward-backward security of user's electricity consumption signature. Compared with related schemes, our scheme is more secure and efficient.

show abstract

“…Liu and Wang [26] proposed a novel homomorphic signature scheme using a dynamic public key technique, which not only can resist intra-generation pollution attacks but also can prevent inter-generation pollution attacks. Chen et al [27] introduced an improved homomorphic signature scheme. Zhang et al [31] presented a hybrid-key cryptographic method and the source node produce a number of MACs and a signature for every transmitted message.…”

Section: Related Workmentioning

confidence: 99%

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

2016

KSII TIIS

View full text Add to dashboard Cite

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.

show abstract

Security analysis of a homomorphic signature scheme for network coding

Cited by 13 publications

References 26 publications

A Privacy-Preserving Signature Scheme for Network Coding

A Privacy-Preserving Signature Scheme for Network Coding

Secure and Fine-grained Electricity Consumption Aggregation Scheme for Smart Grid

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

Contact Info

Product

Resources

About