Padding for orthogonality: Efficient subspace authentication for network coding

Zhang, Peng; Jiang, Yixin; Chen, Lin; Yao, Hongyi; Wasef, Albert; Shenz, Xuemin

doi:10.1109/infcom.2011.5934876

Cited by 75 publications

(130 citation statements)

References 22 publications

Supporting

Mentioning

130

Contrasting

Order By: Relevance

“…Potential threats such as pollution attacks, eavesdropping attacks, traffic analysis attacks, entropy attacks are treated in [18]- [21], respectively. However, for the wireless network coding paradigm, e.g., COPE, little attention have been paid to addressing its privacy vulnerabilities.…”

Section: Related Workmentioning

confidence: 99%

ANOC: Anonymous Network-Coding-Based Communication with Efficient Cooperation

Zhang

Chen

Jiang

et al. 2012

IEEE J. Select. Areas Commun.

Self Cite

View full text Add to dashboard Cite

Abstract-Practical wireless network coding (e.g., COPE) is a promising technique that can enhance the throughput of wireless networks. However, such a technique also bears a serious security drawback: it breaks the current privacy-preserving protocols (e.g., Onion Routing), since their operations conflict each other. As user privacy in wireless networks is highly valued nowadays, a new privacy-preserving scheme that can function with wireless network coding becomes indispensable.To address such a challenge, we apply the idea of cooperative networking and design a novel anonymity scheme named ANOC, which can function in network-coding-based wireless mesh networks. ANOC is built upon the classic Onion Routing protocol, and resolves its conflict with network coding by introducing efficient cooperation among relay nodes. Using ANOC, we can perform network coding to achieve a higher throughput, while still preserving user privacy in wireless mesh networks. We formally show how ANOC achieves the property of relationship anonymity, and conduct extensive experiments via nsclick to demonstrates its feasibility and efficiency when integrated with network coding.Index Terms-Network coding, anonymity, cooperative networking, Onion Routing. I. INTRODUCTIONHow to achieve high data throughput is a critical concern in wireless networks. Recent studies show that network coding [1], as an alternative to the traditional store-and-forward paradigm, can remarkably enhance the network capacity. In particular, authors in [2] propose COPE, the first practical wireless network coding scheme for wireless mesh networks [3]. In COPE, nodes operate in promiscuous mode, and opportunistically perform data mixing (or coding) on the packets to be forwarded to neighboring nodes. Fig. 1 shows three basic coding scenarios in COPE [4]. In Fig. 1(a), node S 1 needs to send a packet P 1 to D 1 , and this packet is relayed by node C; while S 2 needs to send a packet P 2 to D 2 , also relayed by node C. The dashed line means that D 1 and D 2 can overhear P 2 and P 1 , respectively, due to the broadcast nature of wireless channels. Without network coding, the communication will cost four transmissions in total: (1) S 1 sends P 1 to C, (2) C forwards P 1 to D 1 , (3) S 2 sends P 2 to C, and (4) C forwards P 2 to D 2 . On the other hand, with network coding, the relay node C only needs to broadcast P 1 ⊕ P 2 , and then D 1 can recover P 1 by computing P 2 ⊕(P 1 ⊕P 2 ); D 2 can recover P 2 by computing P 1 ⊕(P 1 ⊕P 2 ). In this way, one transmission will be saved at node C, and the network throughput can be improved. Fig. 1(b) shows another possible coding scenario where no overhearing is needed; Fig. 1(c) gives a hybrid scenario that combines the former two cases.In addition to throughput improvement, privacy preservation is also an important concern in wireless communications since:

show abstract

Section: Related Workmentioning

confidence: 99%

ANOC: Anonymous Network-Coding-Based Communication with Efficient Cooperation

Zhang

Chen

Jiang

et al. 2012

IEEE J. Select. Areas Commun.

Self Cite

View full text Add to dashboard Cite

show abstract

“…However, Yun et al demonstrate that Yu et al's scheme does not satisfy the required homomorphic property in [33]. Some schemes (e.g., the homomorphic hashing scheme, the MAC-based scheme, the dynamic-identity based signature scheme, and the efficient subspace authentication [27], [28], [29], [30]) have been proposed against pollution attacks for network coding and erasure codes. Y.…”

Section: H Comparisons With Other Schemesmentioning

confidence: 99%

“…For instance, erasure codes (e.g., Reed-Solomon codes [10]), fountain codes (e.g., LT codes [7]), growth codes [5], and priority linear codes [11] have been proposed in the recent years. In addition, some schemes are proposed to provide the integrity guarantee for network coding or erasure codes [26], [27], [29], [30], but the data maintenance issue is not addressed in these schemes. There are also some secure data storage schemes which include the secure data access approach with polynomial-key management, the adaptive polynomialbased data storage scheme, etc.…”

Section: Introductionmentioning

confidence: 99%

A Distributed Fault/Intrusion-Tolerant Sensor Data Storage Scheme Based on Network Coding and Homomorphic Fingerprinting

Zeng

Jiang

Chen

et al. 2012

IEEE Trans. Parallel Distrib. Syst.

Self Cite

View full text Add to dashboard Cite

Abstract-Recently, distributed data storage has gained increasing popularity for reliable access to data through redundancy spread over unreliable nodes in wireless sensor networks (WSNs). However, without any protection to guarantee the data integrity and availability, the reliable data storage can not be achieved since sensor nodes are prone to various failures, and attackers may compromise sensor nodes to pollute or destroy the stored data. Therefore, how to design a robust sensor data storage scheme to efficiently guarantee the data integrity and availability becomes a critical issue for distributed sensor storage networks. In this paper, we propose a distributed fault/intrusion-tolerant data storage scheme based on network coding and homomorphic fingerprinting in volatile WSNs environments. For high data availability, the proposed scheme uses network coding to encode the source data and distribute encoded fragments with original data pieces. With secure, compact, and efficient homomorphic fingerprinting, our scheme can fast locate incorrect fragments and then initialize data maintenance. Extensive theoretical analysis and simulative results demonstrate the efficacy and efficiency of the proposed scheme.

show abstract

“…Cheng et al [12] proposed a homomorphic MAC scheme which can achieve a higher security level using the same field size. However, it does not support multi-generation transmission and is susceptible to repetitive attacks [14]. A repetitive attack is when transmissions contains multiple generations [3], a malicious node collect the legitimate packets from previous generations and use them to forge packets for current or subsequence generations.…”

Section: Introductionmentioning

confidence: 99%

“…Due to the way the packets are combined and transmitted, a small number of polluted packets can cause large-scale pollution propagation. To solve the problem, several public-key based schemes [5]-[8] and hybrid [14][15] schemes are proposed. In these schemes, the source node signs the packet using a private key.…”

mentioning

confidence: 99%

A MAC-based scheme for multi-generation content distribution with network coding

Zhang

2014

16th International Conference on Advanced Communication Technology

View full text Add to dashboard Cite

Abstract-The system that uses network coding is highly susceptible to pollution attacks, where a malicious node may pollute a small number of packets with the purpose of preventing the recipient nodes from reconstructing the original messages properly. Some schemes that use Message Authentication Code (MAC) have been proposed for resisting this attack. However, these schemes could be broken with probability 1/q, where q is the size of the underlying field. Although the trace function has already been used for constructing MACs for a higher security, it can only be used for single-generation distribution. This paper proposes a novel MAC-based scheme that also employs trace function. However, different from prior work, our scheme can be immediately used for secure multi-generation distribution. [2] has been applied to network for achieving the optimal throughput. However, it is susceptible to pollution attacks, where a malicious node injects corrupted packets into network, aiming at preventing the recipient from reconstructing the original file. Due to the way the packets are combined and transmitted, a small number of polluted packets can cause large-scale pollution propagation. To solve the problem, several public-key based schemes [5]-[8] and hybrid [14][15] schemes are proposed. In these schemes, the source node signs the packet using a private key. The recipients use the public key known to all the nodes to check the integrity of the packet. However, these schemes are based on expensive paring operations [5]- [7] or exponentiation operations over a large field [8], which makes these schemes not fast enough for online communication. Keywords-To address the inefficiency of public-key based scheme, some efficient symmetric-key based [9]-[13] schemes are introduced. Le et al. [13] proposed an efficient message authentication code (MAC) based inter-session scheme which supports multi-generation communication. However, its security relies on the size of the underlying field, which means in standard network coding based environment, where the field size is usually

show abstract

Padding for orthogonality: Efficient subspace authentication for network coding

Cited by 75 publications

References 22 publications

ANOC: Anonymous Network-Coding-Based Communication with Efficient Cooperation

ANOC: Anonymous Network-Coding-Based Communication with Efficient Cooperation

A Distributed Fault/Intrusion-Tolerant Sensor Data Storage Scheme Based on Network Coding and Homomorphic Fingerprinting

A MAC-based scheme for multi-generation content distribution with network coding

Contact Info

Product

Resources

About