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

secure network Code for Adaptive and Active Attacks With No-Randomness in Intermediate Nodes

IEEE TRANSACTIONS ON INFORMATION THEORY 2020年第3期66卷 1428-1448页

作者： Cai, Ning Hayashi, Masahito ShanghaiTech Univ Sch Informat Sci & Technol Shanghai 201210 Peoples R China Nagoya Univ Grad Sch Math Nagoya Aichi 4648602 Japan Southern Univ Sci & Technol Shenzhen Inst Quantum Sci & Engn Shenzhen 518055 Peoples R China Natl Univ Singapore Ctr Quantum Technol Singapore 117542 Singapore Peng Cheng Lab Ctr Quantum Comp Shenzhen 518000 Peoples R China

In secure network coding, there is a possibility that the eavesdropper can improve her performance when she changes (contaminates) the information on the attacked edges (active attack) and chooses the attacked edges adaptively (adaptive attack). We analyze the security for network code over such types of attacks. We show that active and adaptive attacks cannot improve the performance of the eavesdropper when the code is linear. Further, we give a non-linear example, in which an adaptive attack improves the performance of the eavesdropper. We derive the capacity for the unicast case and the capacity region for the multicast case or the multiple multicast case in several examples of relay networks, beyond the minimum cut theorem, when no additional random number is allowed as scramble variables in the intermediate nodes. No prior study compared the difference of the capacity and the capacity region between the existence and the non-existence of randomness in the intermediate nodes under these network models even with non-adaptive and non-active attacks.

关键词： Adaptive systems Adaptation models Linearity network coding Linear codes Biological system modeling Contamination Secrecy analysis secure network coding adaptive attack active attack

来源：评论

学校读者我要写书评

暂无评论

Bounds on relative generalised Hamming weight

引用

IET COMMUNICATIONS 2020年第11期14卷 1794-1804页

作者： Zhuang, Zhuojun Zhang, Keke Jing, Zhen Dai, Bin Huang, Jia Chinese Acad Sci Innovat Acad Microsatellites 99 Haike Rd Shanghai 201203 Peoples R China Southwest Jiaotong Univ Sch Informat Sci & Technol 111First SectNorth Second Ring Rd Chengdu 610031 Sichuan Peoples R China

The rth relative generalised Hamming weight (RGHW) of an [n, k] linear code C and an [n, k(1)] subcode C-1, a generalisation of generalised Hamming weight (GHW), characterises code performances of wiretap channel of type II, secure network coding, linear ramp secret sharing scheme, trellis complexity etc. In this study, the authors investigate non-asymptotic and asymptotic bounds on RGHW. In the non-asymptotic setting, they present a new proof of the Griesmer bound on RGHW by residue code and introduce the new concept of relative chain condition. They show that code pairs meeting the Griesmer, Singleton, and weak Plotkin bounds satisfy this condition. The notion of relative chain condition and these results provide a new perspective on researches including evaluating trellis complexity and determining the weight hierarchy of code pairs etc. In the asymptotic setting, they improve previous work by introducing two new metrics, respectively, for the cases r is fixed and r is proportionally increasing with n. They show the asymptotic Singleton, Plotkin, and Gilbert-Varshamov bounds on the first metric and determine the value of the second metric, which is helpful for characterising the optimal asymptotic performances of applications and constructing the optimal coding schemes.

关键词： Hamming codes network coding linear codes channel coding trellis codes Gilbert-Varshamov bounds optimal coding schemes relative generalised Hamming weight RGHW linear code secure network coding linear ramp secret sharing scheme trellis complexity asymptotic bounds nonasymptotic setting residue code relative chain condition weight hierarchy weak Plotkin bounds Griesmer bounds asymptotic Singleton bound setting

来源：评论

学校读者我要写书评

暂无评论

Distributed Group Key Management for Event Notification Confidentiality Among Sensors

引用

IEEE TRANSACTIONS ON DEPENDABLE AND secure COMPUTING 2020年第3期17卷 566-580页

作者： Esposito, Christian Ficco, Massimo Castiglione, Aniello Palmieri, Francesco De Santis, Alfredo Univ Salerno Comp Sci Dept I-84084 Fisciano SA Italy Univ Campania Luigi Vanvitelli Dept Ind & Informat Engn I-81031 Aversa CE Italy

There is an increasing involvement of the Internet of Things (IoT) in many of our daily activities, with the aim of improving their efficiency and effectiveness. We are witnessing the advent of smart cities, in which IoT is exploited to improve the management of a city's assets, as well as smart factories, where IoT is paving the way for the forth industrial revolution. These applications and many other ones imply several non-functional requirements to be satisfied by the adopted IoT solution, where security assumes paramount importance. secure communications among the IoT nodes are strongly needed due to the use of wireless technologies that are easy to eavesdrop, in order to steal valuable information. Accordingly, confidentiality is a fundamental prerequisite, but the existing solutions based on transport-level encryption are ineffective, while the ones with application-level encryption may be too expensive in terms of energy consumption. In this work, we propose a series of solutions and methods to achieve confidentiality with end-to-end guarantees, by using group-based keys within the context of a clustered and distributed key management framework. We have implemented such solutions on top of TinyOS, and assessed their achievable quality by means of the TOSSIM simulator.

关键词： Sensors Cryptography Middleware Protocols Wireless sensor networks network coding Eventing confidentiality secure network coding distributed key management key derivation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

secure Multi-Source Multicast

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2019年第1期67卷 708-723页

作者： Cohen, Alejandro Cohen, Asaf Medard, Muriel Gurewitz, Omer Ben Gurion Univ Negev Dept Commun Syst Engn IL-84105 Beer Sheva Israel MIT Lab Informat & Decis Syst Cambridge MA 02139 USA

The principal mission of multi-source multicast (MSM) is to disseminate all messages from all sources in a network to all destinations. MSM is utilized in numerous applications. In many of them, securing the messages disseminated is critical. A common secure model is to consider a network where there is an eavesdropper which is able to observe a subset of the network links, and seeks a code which keeps the eavesdropper ignorant regarding all the messages. While this is solved when all messages are located at a single source, secure MSM (SMSM) is an open problem, and the rates required are hard to characterize in general. In this paper, we consider individual security, which promises that the eavesdropper has zero mutual information with each message individually, or, more generally, with sub sets of messages. We completely characterize the rate region for SMSM under individual security, and show that such a security level is achievable at the full capacity of the network, that is, the cut-set bound is the matching converse, similar to non-secure MSM. Moreover, we show that the field size is similar to non-secure MSM and does not have to be larger due to the security constraint.

关键词： Information-theoretic security multi-source multicast communication network coding random linear coding secure network coding secure distributed storage

来源：评论

学校读者我要写书评

暂无评论

Generalized Rank Weights of Reducible Codes, Optimal Cases, and Related Properties

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2018年第1期64卷 192-204页

作者： Martinez-Penas, Umberto Aalborg Univ Dept Math Sci DK-9220 Aalborg Denmark

Reducible codes for the rank metric were introduced for cryptographic purposes. They have fast encoding and decoding algorithms, include maximum rank distance (MRD) codes, and can correct many rank errors beyond half of their minimum rank distance, which makes them suitable for error correction in network coding. In this paper, we study their security behavior against information leakage on networks when applied as coset coding schemes, giving the following main results: 1) we give lower and upper bounds on their generalized rank weights (GRWs), which measure worst case information leakage to the wire tapper;2) we find new parameters for which these codes are MRD (meaning that their first GRW is optimal) and use the previous bounds to estimate their higher GRWs;3) we show that all linear (over the extension field) codes, whose GRWs are all optimal for fixed packet and code sizes but varying length are reducible codes up to rank equivalence;and 4) we show that the information leaked to a wire tapper when using reducible codes is often much less than the worst case given by their (optimal in some cases) GRWs. We conclude with some secondary related properties: conditions to be rank equivalent to Cartesian products of linear codes and conditions to be rank degenerate, duality properties, and MRD ranks.

关键词： Generalized rank weight rank-metric codes rank distance rank equivalent codes reducible codes secure network coding

来源：评论

学校读者我要写书评

暂无评论

High-rate secret key generation aided by multiple relays for Internet of things

引用

ELECTRONICS LETTERS 2017年第17期53卷 1198-1200页

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

A multiple relays aided secret key generation algorithm is proposed to improve the generated secret key rate for Internet of things when the wireless channels change slowly. First, the two legitimate users and relays send training sequences in turn to estimate the channels. Then, the relays employ secure network coding technique to help the two legitimate users exploit the randomness of relay channels. Finally, the two legitimate users agree on a secret key without the help of relays. In addition, the optimal relays selection with optimal power allocation algorithm is present to further improve the secret key rate when relay selection is needed. The performances of the proposed algorithms are verified by Monte Carlo simulation results.

关键词： Internet of Things wireless channels network coding relay networks (telecommunication) Monte Carlo methods channel allocation high-rate secret key generation multiple relays Internet of Things wireless channels legitimate users training sequences secure network coding relay channels optimal relays selection optimal power allocation Monte Carlo simulation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：