检索结果-内蒙古大学图书馆

secure network coding in the presence of eavesdroppers

Science China(Information Sciences) 2010年第3期53卷 648-658页

作者： LUO MingXing1,2,3, YANG YiXian1,2,3, WANG LiCheng1,2,3 & NIU XinXin1,2,3 1Information Security Center, State Key Laboratory of networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China 2Key Laboratory of network and Information Attack and Defence Technology of MOE, Beijing University of Posts and Telecommunications, Beijing 100876, China 3National Engineering Laboratory for Disaster Backup and Recovery, Beijing University of Posts and Telecommunications, Beijing 100876, China 1. Information Security Center State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China2. Key Laboratory of Network and Information Attack and Defence Technology of MOE Beijing University of Posts and Telecommunications Beijing 100876 China3. National Engineering Laboratory for Disaster Backup and Recovery Beijing University of Posts and Telecommunications Beijing 100876 China

Our concern, in the paper, is to construct information-theoretic secure network coding in the presence of eavesdroppers. 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 bound of wiretapping set from the source. Furthermore, it can be extended to any directed acyclic networks with single source. Compared with the traditional results, we construct information-theoretic secure network coding without additional encryptions and giving up any capacity.

关键词： all-or-nothing transformation secure network coding eavesdropping

来源：评论

学校读者我要写书评

暂无评论

secure network coding and Non-Malleable Codes: Protection Against Linear Tampering

Secure Network Coding and Non-Malleable Codes: Protection Ag...

引用

IEEE International Symposium on Information Theory

作者： Chabanne, Herve Cohen, Gerard Patey, Alain Morpho Paris France Telecom ParisTech Paris France Morpho Ident & Secur Alliance Paris France Telecom ParisTech Ident & Secur Alliance Paris France

ISBN: (纸本)9781467325790

At ICS 2010, Dziembowski et al. introduced the notion of Non-Malleable Codes (NMC), adapting the cryptographic notion of non-malleability to the coding theory. Using NMC, if an attacker modifies a codeword, decoding this modified codeword will return either the original message or a completely unrelated value. The property of non-malleability depends on a family of modifications authorized to the attacker. In their paper, Dziembowski et al. propose a construction valid for the family of all bit-wise independent functions. At ITW 2011, Chabanne et al. proposed another construction for non-malleable codes w.r.t. bit-wise independent tampering functions by drawing a parallel between NMC and the Wire-Tap Channel II. In this paper, we show that the construction using Linear Coset coding proposed by Chabanne et al. is non-malleable w.r.t. a larger class of functions, by considering linear tampering. Our results are derived from security results on secure network coding using Linear Coset coding, introduced by El Rouayheb and Soljanin at ISIT 2007.

关键词： Non-Malleable Codes secure network coding Wire-Tap Channel II Coset coding

来源：评论

学校读者我要写书评

暂无评论

An efficient MAC scheme for secure network coding with probabilistic detection

引用

Frontiers of Computer Science 2012年第4期6卷 429-441页

作者： Boyang WANG Hui LI Jin CAO State Key Laboratory of Integrated Services Networks Xidian UniversityXi'an 710071China

network coding is vulnerable to pollution at- tacks, which prevent receivers from recovering the source message correctly. Most existing schemes against pollution attacks either bring significant redundancy to the original message or require a high computational complexity to ver- ify received blocks. In this paper, we propose an efficient scheme against pollution attacks based on probabilistic key pre-distribution and homomorphic message authentication codes （MACs）. In our scheme, each block is attached with a small number of MACs and each node can use these MACs to verify the integrity of the corresponding block with a high probability. Compared to previous schemes, our scheme still leverages a small number of keys to generate MACs for each block, but more than doubles the detection probability. Mean- while, our scheme is able to efficiently restrict pollution prop- agation within a small number of hops. Experimental results show that our scheme is more efficient in verification than existing ones based on public-key cryptography.

关键词： secure network coding pollution attacks homo- morphic message authentication codes （MACs） probabilistic detection

来源：评论

学校读者我要写书评

暂无评论

Efficient Protocols for Perfectly secure Message Transmission With Applications to secure network coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2020年第10期66卷 6340-6353页

作者： Spini, Gabriele Zemor, Gilles Ctr Wiskunde & Informat CWI NL-1098 XG Amsterdam Netherlands Dutch Org Appl Sci Res TNO Cyber Secur & Robustness Dept NL-2595 DA The Hague Netherlands Univ Bordeaux Inst Math Bordeaux UMR 5251 F-33400 Talence France

In the model that has become known as "Perfectly secure Message Transmission" (PSMT), a sender Alice is connected to a receiver Bob through n parallel two-way channels. A computationally unbounded adversary Eve controls t of these channels, meaning she can acquire and alter any data that is transmitted over these channels. The sender Alice wishes to communicate a secret message to Bob privately and reliably, i.e. in such a way that Eve gains no information about the message while Bob is able to recover it completely. We focus on PSMT protocols that work in two transmission rounds for n = 2t + 1. We break from previous work by following a conceptually simpler blueprint. This has two consequences: first, we obtain improved efficiency, namely, we reduce the previously best-known communication complexity, i.e. the number of transmitted bits necessary to communicate a 1-bit secret, from O(n(3) log n) to O(n(2) log n). Our solution also reaches optimal transmission rate for a secret of size O(n log n), thus answering the hitherto open question of attaining a threshold below O(n(2) log n) bits. Second, our construction can be adapted to more general scenarios relevant to network coding, where the adversary is given more power.

关键词： Protocols Complexity theory Reliability network coding Receivers Indexes Artificial neural networks Perfectly secure message transmission secure network coding

来源：评论

学校读者我要写书评

暂无评论

On the mobile relay placement in hybrid MANETs with secure network coding

引用

SECURITY AND COMMUNICATION networkS 2014年第4期7卷 738-749页

作者： Wang, Jin Lu, Kejie Soochow Univ Sch Comp Sci & Technol Suzhou Peoples R China Univ Puerto Rico Dept Elect & Comp Engn Mayaguez PR 00680 USA

In mobile ad hoc networks (MANET), deploying a small number of mobile relays can greatly improve the throughput, delay, and security performance. However, in such a hybrid MANET, it is challenging to determine the optimal locations of mobile relays. In this paper, we study a mobile relay placement problem to maximize the network throughput of hybrid MANET with secure network coding capability. Specifically, we first study the maximal throughput of a hybrid MANET, in which the position of each mobile relay is known. For such a special case, we model the maximal throughput problem as a linear programming problem. On the basis of the understanding of this problem, we then formulate the optimal relay placement problem as an integer linear programming problem. Because integer linear programming is too complex to solve for a large MANET, we propose an efficient near-optimal approximation algorithm based on linear programming-relaxation. Finally, we conduct extensive simulation experiments, which demonstrate the effectiveness of the proposed algorithms. Copyright (c) 2013 John Wiley & Sons, Ltd.

关键词： mobile ad hoc networks (MANETs) mobile relay secure network coding linear programming (LP) LP relaxation

来源：评论

学校读者我要写书评

暂无评论

Refined secure network coding Scheme with no Restriction on coding Vectors

引用

IEEE COMMUNICATIONS LETTERS 2012年第11期16卷 1907-1910页

作者： Kim, Young-Sik Chosun Univ Dept Informat & Commun Engn Kwangju South Korea

In this letter, we consider the secure network coding problem with no restriction on the network coding vectors. Adeli and Liu proposed a scheme achieving perfect security in a network with network coding. In order to hide a security weakness of their scheme, they imposed a restriction on the linear network code design. However, this restriction can be violated when the random linear network coding is used due to the completely decentralized nature of it. We refine Adeli and Liu's scheme into new one with no restriction and thus remove the security weakness under the computationally bounded adversary assumption.

关键词： secure network coding random linear network coding cryptographic hash functions avalanche effect random number generators one-time pad

来源：评论

学校读者我要写书评

暂无评论

On the Optimality of secure network coding

引用

IEEE COMMUNICATIONS LETTERS 2015年第7期19卷 1165-1168页

作者： Guang, Xuan Lu, Jiyong Fu, Fang-Wei Nankai Univ Sch Math Sci Tianjin 300071 Peoples R China Nankai Univ LPMC Tianjin 300071 Peoples R China Nankai Univ Chern Inst Math Tianjin 300071 Peoples R China

In network communications, information transmission often encounters wiretapping attacks. secure network coding is introduced to prevent information from being leaked to adversaries. The investigation of performance bounds on the numbers of source symbols and random symbols are two fundamental research problems. For an important case that each wiretap-set with cardinality not larger than r, Cai and Yeung proposed a coding scheme, which is optimal in the senses of maximizing the number of source symbols and at the same time minimizing the number of random symbols. In this letter, we further study achievable lower bound on the number of random key and show that it just depends on the security constraint, and particularly, is independent to the information amount for transmission. This implies that when the number of transmitted source message changes, we can't reduce the number of random key to keep the same security level. We further give an intuitive interpretation on our result. In addition, a similar construction of secure linear network codes is proposed, which achieves this lower bound on the number of random key no matter how much information is transmitted. At last, we also extend our result to imperfect security case.

关键词： secure network coding perfect security imperfect security rate of the key achievability

来源：评论

学校读者我要写书评

暂无评论

Cooperative Group Secret Key Generation Based on secure network coding

引用

IEEE COMMUNICATIONS LETTERS 2018年第7期22卷 1466-1469页

作者： Xiao, Shuaifang Guo, Yunfei Huang, Kaizhi Jin, Liang China Natl Digital Switching Syst Engn & Technol Zhengzhou 450002 Henan Peoples R China

Most of the existing works on group secret key (GSK) generation are based on pairwise key which wasting the total time and power of the group users. We present a cooperative GSK generation algorithm via star topology with one central node and one reference node. After channel estimation, secure network coding technique is employed by the central node to help all the group users exploit the randomness of reference channel with nothing about that leaking to the eavesdropper. Then all the group users agree on a secret key from the correlative observations of the reference channel in one information reconciliation phase. In addition, the expression of achievable secret key rate is derived. Theoretical and Monte Carlo simulation results validate the performance of our proposed algorithm.

关键词： Physical layer security group secret key generation secure network coding

来源：评论

学校读者我要写书评

暂无评论

On the optimal design of secure network coding against wiretapping attack

引用

COMPUTER networkS 2016年 99卷 82-98页

作者： Chang, Xiangmao Wang, Jin Wang, Jianping Lu, Kejie Zhuang, Yi Nanjing Univ Aeronaut & Astronaut Sch Comp Sci & Technol 29 Jiangjun Rd Nanjing 211106 Jiangsu Peoples R China Soochow Univ Dept Comp Sci & Technol 1 Shizi Rd Suzhou 215006 Peoples R China City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China Shanghai Univ Elect Power Coll Comp Sci & Technol 2588 Changyang Rd Shanghai 200090 Peoples R China Univ Puerto Rico Dept Elect & Comp Engn Mayaguez PR 00681 USA Collaborat Innovat Ctr Novel Software Technol & I Nanjing 210023 Jiangsu Peoples R China

In this paper, we study the optimal design of weakly secure linear network coding (WSLNC) against wiretapping attack. Specifically, given a set of wiretapped links, we investigate how to maximize the weakly secure transmission rate of multiple unicast streams between a pair of source and destination nodes, and how to minimize the size of the required finite field, over which the WSLNC can be implemented. In our study, we apply a novel approach that integrates the WSLNC design and the transmission topology construction. We first provide theoretical analysis and prove that the problem of finding the optimal transmission topology is NP-hard. We then develop efficient algorithms to find optimal and sub-optimal topologies in different scenarios. With the transmission topology, we design WSLNC schemes and theoretically analyze the relationships between the transmission topology and two important system factors: (1) the size of the finite field, and (2) the probability that a random linear network coding is weakly secure. Based on the relationships, we further improve our algorithms to address the two system factors, while keeping the same maximal STR. Extensive simulation results show that the proposed heuristic algorithms can achieve good performance in various scenarios. (C) 2015 Elsevier B.V. All rights reserved.

关键词： secure network coding Wiretapping attack secure transmission rate network topology

来源：评论

学校读者我要写书评

暂无评论

Local-Encoding-Preserving secure network coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2020年第10期66卷 5965-5994页

作者： Guang, Xuan Yeung, Raymond W. Fu, Fang-Wei Nankai Univ Sch Math Sci Tianjin 300071 Peoples R China Nankai Univ LPMC Tianjin 300071 Peoples R China Chinese Univ Hong Kong Inst Network Coding Hong Kong Peoples R China Chinese Univ Hong Kong Dept Informat Engn Hong Kong Peoples R China Nankai Univ Chern Inst Math Tianjin 300071 Peoples R China Nankai Univ Tianjin Key Lab Network & Data Secur Technol Tianjin 300071 Peoples R China

Information-theoretic security is considered in the paradigm of network coding in the presence of wiretappers, who can access one arbitrary edge subset up to a certain size, also referred to as the security level. secure network coding is applied to prevent the leakage of the source information to the wiretappers. In this paper, we consider the problem of secure network coding when the information rate and the security level can change over time. To efficiently solve this problem, we put forward local-encoding-preserving secure network coding, where a family of secure linear network codes (SLNCs) is called local-encoding-preserving if all the SLNCs in this family share a common local encoding kernel at each intermediate node in the network. We first consider the design of a family of local-encoding-preserving SLNCs for a fixed security level and a flexible rate. A simple approach is presented for efficiently constructing upon an SLNC that exists a local-encoding-preserving SLNC with the same security level and the rate reduced by one. By applying this approach repeatedly, we can obtain a family of local-encoding-preserving SLNCs with a fixed security level and multiple rates. We further consider the design of a family of local-encoding-preserving SLNCs for a fixed rate and a flexible security level. We present a novel and efficient approach for constructing upon an SLNC that exists a local-encoding-preserving SLNC with the same rate and the security level increased by one. Next, we consider the design of a family of local-encoding-preserving SLNCs for a fixed dimension (equal to the sum of rate and security level) and a flexible pair of rate and security level. We propose another novel approach for designing an SLNC such that the same SLNC can be applied for all the rate and security-level pairs with the fixed dimension. Also, two polynomial-time algorithms are developed for efficient implementations of the later two proposed approaches, respectively. Furthermore, w

关键词： network coding Encoding Information rates Kernel Ciphers network coding secure network coding information-theoretic security flexible information rate flexible security level local-encoding-preserving property rate and security-level region code construction algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：