A Privacy-Preserving Signature Scheme for Network Coding

Liu, Xiang; Huang, Jie; Wu, Yuanxi; Zong, Guowen

doi:10.1109/access.2019.2933870

Cited by 14 publications

(8 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The security of our privacy-preserving scheme relies on the hardness of the discrete logarithm over

, where for any

and given

, x cannot be computed in any polynomial algorithm [ 36 ].…”

Section: The Energy-efficient Privacy-preserving Scheme Based On T-s ...mentioning

confidence: 99%

Fuzzy-Based Privacy-Preserving Scheme of Low Consumption and High Effectiveness for IoTs: A Repeated Game Model

Cao

Zhu

2022

Sensors

View full text Add to dashboard Cite

In the Internet of things (IoTs), data transmission via network coding is highly vulnerable to intra-generation and inter-generation pollution attacks. To mitigate such attacks, some resource-intensive privacy-preserving schemes have been adopted in the previous literature. In order to balance resource consumption and data-privacy-preserving issues, a novel fuzzy-based privacy-preserving scheme is proposed. Our scheme is constructed on a T-S fuzzy trust theory, and network coding data streams are routed in optimal clusters formulated by a designed repeated game model to defend against pollution attacks. In particular, the security of our scheme relies on the hardness of the discrete logarithm. Then, we prove that the designed repeated game model has a subgame-perfect Nash equilibrium, and the model can improve resource utilization efficiency under the condition of data security. Simulation results show that the running time of the proposed privacy-preserving scheme is less than 1 s and the remaining energy is higher than 4 J when the length of packets is greater than 400 and the number of iterations is 100. Therefore, our scheme has higher time and energy efficiency than those of previous studies. In addition, the effective trust cluster formulation scheme (ETCFS) can formulate an optimal cluster more quickly under a kind of camouflage attack.

show abstract

“…The security of our privacy-preserving scheme relies on the hardness of the discrete logarithm over

, where for any

and given

, x cannot be computed in any polynomial algorithm [ 36 ].…”

Section: The Energy-efficient Privacy-preserving Scheme Based On T-s ...mentioning

confidence: 99%

Fuzzy-Based Privacy-Preserving Scheme of Low Consumption and High Effectiveness for IoTs: A Repeated Game Model

Cao

Zhu

2022

Sensors

View full text Add to dashboard Cite

show abstract

“…Liu Xiang et al [29] presented a privacy-preserving signature scheme for linear network coding-based networks. They used a homomorphic signature and applied new signing and verification processes that enhance the computational efficiency.…”

Section: Related Workmentioning

confidence: 99%

A Secure Protocol against Selfish and Pollution Attacker Misbehavior in Clustered WSNs

et al. 2021

View full text Add to dashboard Cite

Wireless sensor networks (WSNs) have been widely used for applications in numerous fields. One of the main challenges is the limited energy resources when designing secure routing in such networks. Hierarchical organization of nodes in the network can make efficient use of their resources. In this case, a subset of nodes, the cluster heads (CHs), is entrusted with transmitting messages from cluster nodes to the base station (BS). However, the existence of selfish or pollution attacker nodes in the network causes data transmission failure and damages the network availability and integrity. Mainly, when critical nodes like CH nodes misbehave by refusing to forward data to the BS, by modifying data in transit or by injecting polluted data, the whole network becomes defective. This paper presents a secure protocol against selfish and pollution attacker misbehavior in clustered WSNs, known as (SSP). It aims to thwart both selfish and pollution attacker misbehaviors, the former being a form of a Denial of Service (DoS) attack. In addition, it maintains a level of confidentiality against eavesdroppers. Based on a random linear network coding (NC) technique, the protocol uses pre-loaded matrices within sensor nodes to conceive a larger number of new packets from a set of initial data packets, thus creating data redundancy. Then, it transmits them through separate paths to the BS. Furthermore, it detects misbehaving nodes among CHs and executes a punishment mechanism using a control counter. The security analysis and simulation results demonstrate that the proposed solution is not only capable of preventing and detecting DoS attacks as well as pollution attacks, but can also maintain scalable and stable routing for large networks. The protocol means 100% of messages are successfully recovered and received at the BS when the percentage of lost packets is around 20%. Moreover, when the number of misbehaving nodes executing pollution attacks reaches a certain threshold, SSP scores a reception rate of correctly reconstructed messages equal to 100%. If the SSP protocol is not applied, the rate of reception of correctly reconstructed messages is reduced by 90% at the same case.

show abstract

“…In [36], Boneh et al proposed a homomorphic signature scheme, where signing a linear subspace is sufficient to authenticate all the vectors in this particular subspace. Recently, Liu et al [10] proposed a privacy‐preserving signature scheme for network coding, which is able to prevent both pollution attacks and eavesdropping attacks. Li et al [12] proposed a homomorphic network coding signature scheme for a multi‐source scenario and analysed its application in internet of things.…”

Section: Related Workmentioning

confidence: 99%

Defending pollution attacks in network coding enabled wireless ad hoc networks: a game‐theoretic framework

Liu

Huang

Yao³

et al. 2020

IET Communications

Self Cite

View full text Add to dashboard Cite

A Privacy-Preserving Signature Scheme for Network Coding

Cited by 14 publications

References 41 publications

Fuzzy-Based Privacy-Preserving Scheme of Low Consumption and High Effectiveness for IoTs: A Repeated Game Model

Fuzzy-Based Privacy-Preserving Scheme of Low Consumption and High Effectiveness for IoTs: A Repeated Game Model

A Secure Protocol against Selfish and Pollution Attacker Misbehavior in Clustered WSNs

Defending pollution attacks in network coding enabled wireless ad hoc networks: a game‐theoretic framework

Contact Info

Product

Resources

About