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

Secure error-correcting (SEC) schemes for network coding through McEliece cryptosystem

CLUSTER COMPUTING-THE JOURNAL OF networkS SOFTWARE TOOLS AND APPLICATIONS 2019年第5-Sup期22卷 11047-11055页

作者： Zhang, Guangzhi Cai, Shaobin Harbin Engn Univ Dept Comp Sci Harbin Heilongjiang Peoples R China Suihua Univ Suihua Peoples R China

The McEliece cryptosystem based on rank-metric codes is presented to offer both security and error-correction simultaneously in random network coding system. In the multicast network, the original messages are encoded with McEliece cryptosystem based on Gabidulin codes. Key distribution will be done one time. The rank codes decoding is performed in the sink. As long as t < d(R) (C) /2, the decoding is guaranteed, where t is the number of corrupted packets and d(R) (C) is the minimum rank distance of the rank codesC. Original messages are protected based on the cryptosystem. Compared with the rate n - mu - 2t in traditional SEC network codes, the rate approaches n-2t where mu is the number of eavesdroppers. The rate won't decrease as the number of eavesdropped edges increases.

关键词： Security and error-correction network coding Gabidulin codes Subspace distance McEliece cryptosystem

来源：评论

学校读者我要写书评

暂无评论

Capacity and Achievable Rate Regions for Linear network coding Over Ring Alphabets

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2019年第1期65卷 220-234页

作者： Connelly, Joseph Zeger, Kenneth Univ Calif San Diego Dept Elect & Comp Engn La Jolla CA 92093 USA

The rate of a network code is the ratio of the block size of the network's messages to that of its edge codewords. We compare the linear capacities and achievable rate regions of networks using finite field alphabets to the more general cases of arbitrary ring and module alphabets. For non-commutative rings, two-sided linearity is allowed. Specifically, we prove the following for directed acyclic networks. First, the linear rate region and the linear capacity of any network over a finite field depend only on the characteristic of the field. Furthermore, any two fields with different characteristics yield different linear capacities for at least one network. Second, whenever the characteristic of a given finite field divides the size of a given finite ring, each network's linear rate region over the ring is contained in its linear rate region over the field. Thus, any network's linear capacity over a field is at least its linear capacity over any other ring of the same size. An analogous result also holds for linear network codes over module alphabets. Third, whenever the characteristic of a given finite field does not divide the size of a given finite ring, there is some network whose linear capacity over the ring is strictly greater than its linear capacity over the field. Thus, for any finite field, there always exist rings over which some networks have higher linear capacities than over the field.

关键词： Linear coding capacity network coding modules (abstract algebra)

来源：评论

学校读者我要写书评

暂无评论

A Code and Rate Equivalence Between Secure network and Index coding

IEEE JOURNAL ON SELECTED AREAS IN INFORMATION THEORY

引用

IEEE JOURNAL ON SELECTED AREAS IN INFORMATION THEORY 2021年第1期2卷 106-120页

作者： Ong, Lawrence Vellambi, Badri N. Kliewer, Jorg Yeoh, Phee Lep Univ Newcastle Sch Elect Engn & Comp Callaghan NSW 2308 Australia Univ Cincinnati Coll Engn & Appl Sci Cincinnati OH 45221 USA New Jersey Inst Technol Dept Elect & Comp Engn Newark NJ 07102 USA Univ Sydney Sch Elect & Informat Engn Sydney NSW 2006 Australia

Establishing code equivalences between index coding and network coding provides important insights for code design. Previous works showed an equivalence relation between any index-coding instance and a network-coding instance, for which a code for one instance can be translated to a code for the other instance with the same decoding-error performance. The equivalence also showed a surprising result that any network-coding instance can be mapped to an index-coding instance with a properly designed code translation. In this article, we extend the existing equivalence (instance map and code translation) to one between secure index coding and secure network coding, where eavesdroppers are present in the network. In the secure setting, any code construction needs to guarantee security constraints in addition to decoding-error performance. A rate equivalence between these two problems is also established.

关键词： Code equivalence Index coding network coding secure communications wiretap

来源：评论

学校读者我要写书评

暂无评论

General transformations from single-generation to multi-generation for homomorphic message authentication schemes in network coding

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2019年 91卷 416-425页

作者： Chang, Jinyong Ji, Yanyan Xu, Maozhi Xue, Rui Xian Univ Architecture & Technol Sch Informat & Control Engn Xian Shaanxi Peoples R China Peking Univ Sch Math Sci Beijing Peoples R China North Univ China Sch Informat & Commun Engn Taiyuan Shanxi Peoples R China Chinese Acad Sci Inst Informat Engn SKLOIS Beijing Peoples R China

Homomorphic (broadcast) message authentication code (MAC for short) scheme is a powerful tool for network coding to resist the pollution attack. However, many existing schemes only support the single generation transmission and hence, potentially are vulnerable to multi-generation pollution attacks considered by Cheng et al. in 2016. In this paper, we consider how to securely convert the single generation homomorphic (broadcast) MAC schemes into multi-generation ones so that they can resist the multi-generation attacks. Concretely, We first present the multi-generation pollution attack on the single-generation homomorphic MAC scheme and propose a general transformation from single-generation scheme to one that supports multi-generation transmission. Second, we prove that the multi-generation pollution attack also holds for a kind of homomorphic broadcast MAC schemes and any c-collusion secure single-generation scheme using cover-free set system as its key-distribution strategy, can also be securely converted into one that supports multi generation transmission. Third, as applications of the two transformations, we point out the existing two single-generation schemes can be respectively transformed into ones that are secure against the multi-generation pollution attacks. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Homomorphic MAC Homomorphic broadcast MAC network coding Pollution attack

来源：评论

学校读者我要写书评

暂无评论

Spectrum Sharing With network coding for Multiple Cognitive Users

引用

IEEE INTERNET OF THINGS JOURNAL 2019年第1期6卷 230-238页

作者： Li, Nan Xiao, Ming Rasmussen, Lars Kildehoj KTH Royal Inst Technol Sch Elect Engn S-10044 Stockholm Sweden KTH Royal Inst Technol ACCESS Linnaeus Ctr S-10044 Stockholm Sweden

In this paper, an intelligently cooperative communication network with cognitive users is considered, where in a primary system and a secondary system, respectively, a message is communicated to their respective receiver over a packet-based wireless link. The secondary system assists in the transmission of the primary message employing network coding, on the condition of maintaining or improving the primary performance, and is granted limited access to the transmission resources as a reward. The users in both systems exploit their previously received information in encoding and decoding the binary combined packets. Considering the priority of legitimate users, a selective cooperation mechanism is investigated and the system performance based on an optimization problem is analyzed. Both the analytical and numerical results show that the condition for the secondary system accessing the licensed spectrum resource is when the relay link performs better than the direct link of the primary transmission. We also extend the system model into a network with multiple secondary users and propose two relay selection algorithms. Jointly considering the related link qualities, a best relay selection and a best relay group selection algorithm are discussed. Overall, it is found that the throughput performance can be improved with multiple secondary users, especially with more potential users cooperating in the best relay group selection algorithm.

关键词： Cooperative communication multiuser network coding spectrum sharing

来源：评论

学校读者我要写书评

暂无评论

A Bi-objective integer linear programming model for the routing and network coding assignment problem in WDM optical networks with dedicated protection

引用

COMPUTER COMMUNICATIONS 2019年第Jan.期133卷 51-58页

作者： Dao Thanh Hai Vietnam Natl Univ Int Sch Lab Data Sci & Optimizat Complex Syst Hanoi Vietnam

The explosive traffic growths are pushing the transport network close to its capacity limitation, raising critical issues about fiber capacity crunch. In this context, network coding has been emerging as the promising technique to improve the network capacity efficiency thanks to the capability of better resources utilization. The application of network coding to the realms of failure recovery in optical networks has paved the new way for more efficient protection schemes and indeed, XOR network coding combined with dedicated protection has been proposed, investigated and developed to challenge the well-established understanding of trading capacity efficiency for recovery speed and vice versa. In order to maximize the benefits empowered by network coding in this case, the problem of 1 + 1 routing and network coding assignment (1 + 1 RNCA) has to be optimally solved. Apart from traditional 1 + 1 routing, the decision of network coding information has also to be taken into account including the selection of pair of demands for encoding and the respective coding node and coding links. In this paper, we propose a bi-objective integer linear programming model of the 1 + 1 RNCA problem aiming at minimizing the conventional routing cost as the primary objective and furthermore minimizing the number of nodes with coding capabilities as the secondary objective. Our formulation uses a weighting method to combine two objectives into an integrated one and we provide a rigorous analysis on configuring the weight coefficients to capture the desired priority of individual objectives. The efficiency of our integrated objective model in comparison with reference designs based on the single-objective model, 1 + 1 routing and 1 + 1 RNCA, is numerically evaluated on different realistic topologies and traffic sets. Extensive simulation demonstrates that our proposal outperforms traditional approaches when it could achieve the lowest routing cost while simultaneously employing minimal nu

关键词： Routing Dedicated protection WDM optical networks network coding Integer linear programming Bi-objective model

来源：评论

学校读者我要写书评

暂无评论

The network coding Algorithm Based on Rate Selection for Device-to-Device Communications

引用

IEEE ACCESS 2019年 7卷 23396-23406页

作者： Wang, Qi Zhang, Xiang Wang, Qingshan Liu, Peng Deng, Bin Hefei Univ Technol Sch Math Hefei 230009 Anhui Peoples R China Hangzhou Dianzi Univ Sch Comp Sci & Technol Hangzhou 310018 Zhejiang Peoples R China

In this paper, we investigate the problem associated with minimizing the total energy consumption used by all devices when recovering their missing packets. It is accomplished by applying network coding based on the selection of the transmission rates in a device-to-device network. First, this paper formulates the problem as an integer nonlinear programming optimization by means of constructing a graph model with a limiting parameter to control the number of edges and thereby confirms it as an NPC. Second, this paper investigates the relationship between the energy-saving benefit and the value of the limiting parameter and thereby indicates that the benefit is maximized when the limiting parameter equals 2. Furthermore, two coding algorithms based on the selection of the maximum-weighted clique are proposed. In detail, they are selecting the best clique in terms of the weight of the vertex (SBWV) algorithm and selecting the best clique in terms of the weight of the edge (SBWE) algorithm. The former consider selecting the maximum-weighted clique on the local NC graph which is based on the weight of vertex, while the latter consider selecting the maximum-weighted cliques of the global NC graph based on the weight of the edge. Finally, the simulation results show that both the SBWV and SBWE can significantly reduce the energy of transmission and average delay when compared with COPE, content-and loss-aware IDNC, as well as TS-MIS.

关键词： Clique device-to-device (D2D) energy consumption multi-rate network coding

来源：评论

学校读者我要写书评

暂无评论

Modeling and Analysis of Two-Way Relay networks: A Joint Mechanism Using NOMA and network coding

引用

IEEE ACCESS 2019年 7卷 152679-152689页

作者： Wei, Fanbo Zhou, Ting Xu, Tianheng Hu, Honglin Chinese Acad Sci Shanghai Adv Res Inst Shanghai 201210 Peoples R China Univ Chinese Acad Sci Sch Elect Elect & Commun Engn Beijing 100049 Peoples R China

As a promising technology, non-orthogonal multiple access (NOMA) enhances spectral efficiency and system capacity by allocating the same resource to multiple users. network coding (NC) has the advantages of compressing data and high spectral efficiency, and it plays a crucial role in two-way relay networks. However, conventional two-way relay networks suffer from throughput limitations due to the use of OMA scheme. In this paper, we utilize a hybrid concept to design a two-way relaying system (namely Hybrid-TWRS) which combines NOMA and NC. Furthermore, we investigate the size-mismatch problem caused by asymmetric channel in the NOMA scheme and propose a bit-match scheme and a symbol-match scheme based on the Hybrid-TWRS. Theoretical derivation and numerical results demonstrate that the proposed method distinctly outperforms both (i) traditional two-way relaying system with OMA in the uplink and NC in the downlink (namely NC-TWRS);and (ii) NOMA-based two-way relaying system (namely NOMA-TWRS).

关键词： NOMA Uplink Downlink network coding Relay networks (telecommunications) Throughput Two-way relay network non-orthogonal multiple access (NOMA) network coding size-mismatch problem throughput performance

来源：评论

学校读者我要写书评

暂无评论

Multi-Hop D2D Communications With network coding: From a Performance Perspective

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2019年第3期68卷 2270-2282页

作者： Huang, Jun Liao, Yong Xing, Cong-Cong Chang, Zheng Chongqing Univ Posts & Telecom Sch Comp Sci Chongqing 400065 Peoples R China Chongqing Univ Posts & Telecom Sch Commun & Informat Engn Chongqing 400065 Peoples R China Nicholls State Univ Dept Math & Comp Sci Thibodaux LA 70310 USA Univ Jyvaskyla Fac Informat Technol FI-40014 Jyvaskyla Finland

Multi-hop device-to-device (D2D) communications play an important role in expanding D2D coverage. In this paper, we study a relay-based and network-coding-assisted (in particular, XOR coding) multi-hop D2D communication system. In the system, toward jointly considering the impact of interference and network traffic conditions on the quality of D2D communications, various channel fading models and traffic models are investigated, and the packet loss probability of D2D links is meticulously computed using these models. With the packet loss probability of D2D links, the general closed-form expressions of end-to-end packet loss probability (E2EPLP) of the system with the presence (or absence) of XOR coding are subsequently derived. Our experiments reveal that both the number of relays and the mechanism of XOR coding can affect the system performance. Specifically, the increase in the number of relays will lower the overall system performance (e.g., an increase in the E2EPLP and end-to-end completion time, and a decrease of the end-to-end rate may follow as a result). On the other hand, although the presence of XOR coding unfortunately raises the system E2EPLP, it can effectively improve the end-to-end completion time and end-to-end rate. It is our belief that the analytical approach proposed in this paper and the results found in our work can be useful to peer studies in the context of applying network coding in multi-hop D2D networks.

关键词： Multi-hop D2D communication network coding traffic model performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Privacy Protection for Internet of Drones: A network coding Approach

引用

IEEE INTERNET OF THINGS JOURNAL 2019年第2期6卷 1719-1730页

作者： Chen, Yu-Jia Wang, Li-Chun Natl Chiao Tung Univ Dept Elect & Comp Engn Hsinchu 300 Taiwan

This paper proposes an enhanced secure pseudonym scheme to protect the privacy of cloud data in Internet of Drones (IoD). Nowadays, drones equipped with cameras can provide surveillance and aerial photography applications. Unlike the video devices, personal drones with high mobility can track and follow an individual, causing both the identity and location privacy issues. However, IoD devices cannot implement complex cryptographic schemes because of limited computing power. To this end, we develop a secure light-weight network coding pseudonym scheme. Our designed two-tier network coding can decouple the stored IoD cloud data from the owner's pseudonyms. Therefore, our proposed network coding-based pseudonym scheme can simultaneously defend against both outside and inside attackers. We implement our proposed two-tier light-weight network coding mechanism when facing untrusted cloud database. Compared to the computationally secure hash-based pseudonym scheme, our proposed scheme achieves the highest unconditional security level, but also can reduce more than 90% of processing time as well as 10% of energy consumption.

关键词： Internet of Drones (IoD) network coding privacy protection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：