Filters








27,419 Hits in 6.7 sec

Secure network coding with minimum overhead based on hash functions

Majid Adeli, Huaping Liu
2009 IEEE Communications Letters  
In order to achieve complete security in networks with network coding, it has been shown that at least original information symbols must be substituted with uniformly distributed random symbols chosen  ...  This scheme utilizes hash functions to generate different random noisy symbols by using the only uniformly distributed random symbol and the information symbols.  ...  One-way functions are also used in [16] to make a network code secure. The main idea in [16] is to obtain security based on the topology of the network.  ... 
doi:10.1109/lcomm.2009.12.091648 fatcat:gjd7ah5e7zfcffcpftdlot33ra

A Method for Low-overhead Secure Network Coding

Song Fei, Cui Zhe
2013 Applied Mathematics & Information Sciences  
This paper presents a low-overhead secure network coding scheme.  ...  The program only in the original random network coding system based on the source changes, the intermediate nodes remain unchanged; added only an interference signal at the source to guarantee the security  ...  The authors are grateful to the anonymous referee for a careful checking of the details and for helpful comments that improved this paper.  ... 
doi:10.12785/amis/070507 fatcat:nhv73pyy4nhjvpjzxvcy3f7m7y

Design of a waveguide resonator with ripled wall reflectors for a 100 GHz CARM oscillator experiment†

R. B. McCOWAN, A. W. FLIFLET, S. H. GOLD, V. L. GRANATSTEIN, M. C. WANGH
1988 International journal of electronics (Print)  
Optimal random network coding is reduced complexity in computation of coding coefficients, computation of encoded packets and coefficients are such that minimal transmission bandwidth is enough to transmit  ...  But in traditional random network coding, decoding process is possible only after receiving all encoded packets at receiving nodes. Optimal random network coding also reduces the cost of computation.  ...  Noura, Martin and Agha [35] proposed a scheme to enhance the security measure of random linear network code with the use of updated dynamic keys to construct encoding coefficient matrix.  ... 
doi:10.1080/00207218808945245 fatcat:armyoafynjde3dfqn2rnbbgjfy

Low-overhead Secure Network Coding based on Chaotic Sequence

Guangxian Xu, Xiao Fu, Wei Wu
2013 Applied Mathematics & Information Sciences  
A minimum overhead secure network coding based on chaotic sequence is presented in this paper.  ...  And only the source need to be modified, intermediate nodes implement a classical distributed network code. So the proposed scheme is applied to all the linear network coding.  ...  This paper was also supported by grant number LJQ2012029 of Liaoning Colleges and Universities Outstanding Youth Training Plan; its title is the secure network coding against strong attacker based on list-decoding  ... 
doi:10.12785/amis/072l33 fatcat:ujlo7d34tnc75bcznu4zqclei4

On the Security of Index Coding With Side Information

Son Hoang Dau, Vitaly Skachek, Yeow Meng Chee
2012 IEEE Transactions on Information Theory  
It is shown that the linear index code based on a matrix , whose column space code has length , minimum distance , and dual distance , is -block secure (and hence also weakly secure) if the adversary knows  ...  The notion of weak security, considered by Bhattad and Narayanan (2005) in the context of network coding, is generalized to block security.  ...  In the sequel, we also consider a linear randomized index code, which is based on the use of random symbols.  ... 
doi:10.1109/tit.2012.2188777 fatcat:gwjsd7xw7ndkdkn4viwhe5qhau

Energy Efficient Partial Permutation Encryption on Network Coded MANETs

Ali Khan, Qifu Tyler Sun, Zahid Mahmood, Ata Ullah Ghafoor
2017 Journal of Electrical and Computer Engineering  
In this regard, we have focused on network coding which is a lightweight mechanism that can also be used for data confidentiality.  ...  We have also proposed an algorithm for key generation and random permutation confusion key calculation.  ...  Based on this weak security research model, Wang et al. [22] designed a polynomial time deterministic code to secure linear network coding.  ... 
doi:10.1155/2017/4657831 fatcat:lrjie4aennalvdih3v53hjx5be

A Lightweight Encryption Scheme for Network-Coded Mobile Ad Hoc Networks

Peng Zhang, Chuang Lin, Yixin Jiang, Yanfei Fan, Xuemin Shen
2014 IEEE Transactions on Parallel and Distributed Systems  
It is interesting that network coding has a nice property of intrinsic security, based on which encryption can be done quite efficiently.  ...  To this end, we propose P-Coding, a lightweight encryption scheme to provide confidentiality for network-coded MANETs in an energy-efficient way.  ...  Based on the weak security model, Wang et al. [29] design a polynomial-time deterministic code to secure linear network coding.  ... 
doi:10.1109/tpds.2013.161 fatcat:oyqaaitw45c4ppusi7katterwy

Network Coding Security: Attacks and Countermeasures [article]

Luísa Lima, João P. Vilela, Paulo F. Oliveira, João Barros
2008 arXiv   pre-print
Following a brief overview of emerging network coding protocols, we provide a taxonomy of their security vulnerabilities, which highlights the differences between attack scenarios in which network coding  ...  Throughout the paper we identify a number of research challenges deemed relevant towards the applicability of secure network coding in practical networks.  ...  Figure 1 : 1 A typical example of wireless network coding. Figure 2 : 2 An instance of random linear network coding. Figure 3 : 3 Example of algebraic security.  ... 
arXiv:0809.1366v1 fatcat:ghicof62gfegblcn6h2ljwh3ta

Homomorphic Subspace MAC Scheme for Secure Network Coding

Guangjun Liu
2013 ETRI Journal  
Existing symmetric cryptography-based solutions against pollution attacks for network coding systems suffer various drawbacks, such as highly complicated key distribution and vulnerable security against  ...  The basic idea is to exploit the combination of the symmetric cryptography and linear subspace properties of network coding.  ...  With the observations of the randomization and the linear subspace properties of random network coding, Kehdi and Li [11] proposed an elegant scheme based on null keys, which are simply vectors of the  ... 
doi:10.4218/etrij.12.0212.0166 fatcat:sa7jeodyazhiheem43dm3sq3oe

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

Yixin Jiang, Haojin Zhu, Minghui Shi, Xuemin (Sherman) Shen, Chuang Lin
2010 Computer Networks  
In this paper, we propose a novel dynamic-identity based signature scheme for network coding by signing linear vector subspaces.  ...  However, existing homomorphic signature schemes for network coding either incur high transmission/computation overhead, or are vulnerable to random forgery attacks.  ...  a secure random checksum scheme [5] .  ... 
doi:10.1016/j.comnet.2009.08.006 fatcat:ffygp4bq2rhvzgzusiphyft6rq

Efficiency of Secure Network Coding Schemes [chapter]

Elke Franz, Stefan Pfennig, André Fischer
2012 Lecture Notes in Computer Science  
Network coding is a promising approach for increasing performance of multicast data transmission and reducing energy costs.  ...  Thus, we discuss in this paper parameters to assess the efficiency of secure network coding schemes.  ...  Secure Network Coding Random Linear Network Coding The common notation for describing network coding schemes is based on a directed, acyclic graph G = (V, E) consisting of a set of nodes (also called  ... 
doi:10.1007/978-3-642-32805-3_12 fatcat:bouwsczbmbgu5aekljgxpoqz7u

NB-JNCD Coding and Iterative Joint Decoding Scheme for a Reliable communication in Wireless sensor Networks with results

Kishore kumar R, S Nayana
2013 International Journal of Smart Sensor and Adhoc Network.  
A distributed random linear network coding approach for transmission and compression of information in general multisource multicast networks.  ...  NB-JNCC seamlessly combines non-binary channel coding and random linear network coding, and uses an iterative two-tier coding scheme that we proposed to jointly exploit redundancy inside packets and across  ...  Network Coding Based Privacy-Preserving Scheme In this section, we propose a novel network coding based privacy-preserving scheme for MWNs, followed by theoretical analysis on the invertibility of GEMs  ... 
doi:10.47893/ijssan.2013.1202 fatcat:qnd6yoe2ajgatasmasrgu55rmm

Secure network coding in the presence of eavesdroppers

MingXing Luo, YiXian Yang, LiCheng Wang, XinXin Niu
2010 Science China Information Sciences  
Based on the generalized attack model and all-or-nothing transformation, the security of network coding in the generalized combination network can be characterized by the network capacity and the min-cut  ...  Our concern, in the paper, is to construct information-theoretic secure network coding in the presence of eavesdroppers.  ...  is a light-weight secure scheme for confidentiality in random linear network coding.  ... 
doi:10.1007/s11432-010-0052-6 fatcat:bfz77cusvbhwzckexykv7tttbu

Universal secure error-correcting schemes for network coding

Danilo Silva, Frank R. Kschischang
2010 2010 IEEE International Symposium on Information Theory  
This paper considers the problem of securing a linear network coding system against an adversary that is both an eavesdropper and a jammer.  ...  The scheme is based on rank-metric codes and admits low-complexity encoding and decoding.  ...  A scheme is proposed in [11] that is able to achieve this maximum rate. The scheme uses Ozarow-Wyner coset coding [19] based on linear MRD codes.  ... 
doi:10.1109/isit.2010.5513776 dblp:conf/isit/SilvaK10 fatcat:bjxkbbdgovcx5nt5w7khjztz7a

Routing for security in networks with adversarial nodes

Pak Hou Che, Minghua Chen, Tracey Ho, Sidharth Jaggi, Michael Langberg
2013 2013 International Symposium on Network Coding (NetCod)  
1 We consider the problem of secure unicast transmission between two nodes in a directed graph, where an adversary eavesdrops/jams a subset of nodes.  ...  During the journey of our investigation, we also develop a new technique that has the potential to derive nontrivial bounds for general secure-communication schemes.  ...  In general, all the achievability schemes we present in this paper are based on scalar linear network coding schemes.  ... 
doi:10.1109/netcod.2013.6570834 dblp:conf/netcod/CheCHJL13 fatcat:77hwbdnmqrf2dllswkg7ylbkh4
« Previous Showing results 1 — 15 out of 27,419 results