An Efficient Signature-Based Scheme for Securing Network Coding Against Pollution Attacks

Yu, Zhen; Wei, Yawen; Ramkumar, B.; Guan, Yong Liang

doi:10.1109/infocom.2008.199

Cited by 178 publications

(78 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Zhang et al [7] discussed a batch signature verification scheme for the communications between vehicles and infrastructure to lower the total verification time. Horng et al [8] presented a group signature and batch verification method for secure in the system. On the other hand, batch identification is to find the bad signatures within a batch, when the batch verification fails.…”

Section: IImentioning

confidence: 99%

“…Stanek [7] showed that method was flawed, and proposed an improved protocol to ©IJRASET (UGC Approved Journal): All Rights are Reserved resist attacks. Matt [8] discussed a solution in pairing-based signature scheme, which can identify nontrivial numbers of invalid signatures in batches. The generic batch identification methods utilize the group testing technique to find invalid signatures with the minimal number of tests, which can be applied with any signature types.…”

Section: IImentioning

confidence: 99%

“…Pastuszak et al designed a divide-andconquer verifier [6], which split a batch instance into sub ones, and applied the generic test to each sub-batch recursively, until all bad signatures are identified. Zaverucha et al [8] presented and compared some group testing algorithms for finding invalid signatures. Zhang et al [10] adopted the group testing technique to find invalid signatures in a batch in mobile networks.…”

Section: IImentioning

confidence: 99%

See 2 more Smart Citations

Based Scheme of Batch Identiﬁcation for Invalid Signatures using Game Theory Model in Wireless Mobile Networks

Jelin¹

2018

IJRASET

View full text Add to dashboard Cite

Batch cryptography technique is a powerful tool to reduce verification time. There will be two directions to apply the batch cryptography concept in WMNs: Batch verification and Batch identification. It is unrealistic to completely prevent all adversaries (attackers) from generating false messages with invalid signatures. A paramount concern in signature verification is reducing the verification delay to ensure the network QoS. To address this issue, researchers have proposed the batch validation technology Thus, to guarantee the performance of batch verification, we should identify invalid signatures in a batch rapidly. Batch identification is a technique to find the poor signatures within a batch when the batch verification fails. Due to the inefficiency of individual identification, divide and conquer techniques have been proposed to improve the performance of batch identification. In this paper, we propose a batch validation for wireless mobile networks, enabling nodes to find invalid signatures with the optimal delay under heterogeneous and dynamic attack scenarios. Specifically, we design an incomplete information of game model of history between a verifier and its attackers, and prove the existence of Nash Equilibrium, to select the dominant algorithm for identifying invalid signatures. Moreover, we propose an auto-match protocol to optimize the identification algorithm selection, when the attack strategies can be estimated based on history information. Comprehensive simulation results demonstrate that GBIM can identify invalid signatures more efficiently than existing algorithms.

show abstract

Section: IImentioning

confidence: 99%

Section: IImentioning

confidence: 99%

Section: IImentioning

confidence: 99%

See 1 more Smart Citation

Based Scheme of Batch Identiﬁcation for Invalid Signatures using Game Theory Model in Wireless Mobile Networks

Jelin¹

2018

IJRASET

View full text Add to dashboard Cite

show abstract

“…For the homomorphic digital signatures [26], [27], [28], [29], [30] the source (or intermediate nodes) can construct a valid signature on the encoded block using the signatures of the raw data without accessing the private key. The verification of the signature is possible for the collector in the usual way, assuming a PKI is available.…”

Section: Related Workmentioning

confidence: 99%

Securing coding based distributed storage in wireless sensor networks

Buttyán

Czap

Vajda

2008

2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems

View full text Add to dashboard Cite

Abstract-We present a novel information theoretic approach to make network coding based storage secure against pollution attacks in sensor networks. The approach is based on a new decoding algorithm which makes it possible to find adversarial blocks using one more encoded block than strictly necessary for decoding. Our scheme fits well to the requirements of sensor networks, because it operates with adding very low computational and communication overhead to source and storage nodes, only the collector node needs to perform some additional computation. Our approach does not apply cryptography, hence it works in environments where no pre-shared keys, secure channels or PKI are available, which is often the case in sensor networks.

show abstract

“…Several solutions were proposed to combat this attack [9,52,47]. However, packet pollution is only one of many potential attacks.…”

Section: Introductionmentioning

confidence: 99%

Secure network coding for wireless mesh networks: Threats, challenges, and directions

Dong

Curtmola

Nita-Rotaru

2009

Computer Communications

View full text Add to dashboard Cite

In recent years, network coding has emerged as a new communication paradigm that can significantly improve the efficiency of network protocols by requiring intermediate nodes to mix packets before forwarding them. Recently, several real-world systems have been proposed to leverage network coding in wireless networks. Although the theoretical foundations of network coding are well understood, a real-world system needs to solve a plethora of practical aspects before network coding can meet its promised potential. These practical design choices expose network coding systems to a wide range of attacks.We identify two general frameworks (inter-flow and intra-flow) that encompass several network coding-based systems proposed in wireless networks. Our systematic analysis of the components of these frameworks reveals vulnerabilities to a wide range of attacks, which may severely degrade system performance. Then, we identify security goals and design challenges in achieving security for network coding systems. Adequate understanding of both the threats and challenges is essential to effectively design secure practical network coding systems. Our paper should be viewed as a cautionary note pointing out the frailty of current network coding-based wireless systems and a general guideline in the effort of achieving security for network coding systems.

show abstract

An Efficient Signature-Based Scheme for Securing Network Coding Against Pollution Attacks

Cited by 178 publications

References 13 publications

Based Scheme of Batch Identiﬁcation for Invalid Signatures using Game Theory Model in Wireless Mobile Networks

Based Scheme of Batch Identiﬁcation for Invalid Signatures using Game Theory Model in Wireless Mobile Networks

Securing coding based distributed storage in wireless sensor networks

Secure network coding for wireless mesh networks: Threats, challenges, and directions

Contact Info

Product

Resources

About