IET Communications最新文献

{"title":"Secure transmission design in cooperative NOMA networks: Orienting toward user requirements","authors":"Dan Jiang, Yuanyuan Gao, Guoxin Li, Nan Sha, Jihao Cai, ChengFei Ding","doi":"10.1049/cmu2.12779","DOIUrl":"https://doi.org/10.1049/cmu2.12779","url":null,"abstract":"This paper presents a full‐duplex and multi‐antenna relay‐aided transmission scheme for the user‐oriented perspective in cooperative non‐orthogonal multiple access (NOMA) systems. Relying on the service requirements, two legitimate users with security demands (SU) and quality of service (QoS) demands (QU) are paired for NOMA execution. The security of SU is enhanced through inverse power allocation of the conventional NOMA. The QoS requirements for QU are guaranteed, simultaneously. Then, the precoding design at the multi‐antenna relay has been exploited to improve the reliability demands of SU. Closed‐form expressions for SU's outage probability (OP) and intercepted probability, as well as QU's OP, are derived. The security–reliability trade‐off is also presented. Additionally, performance analysis under the half‐duplex and multi‐antenna scheme is provided as a benchmark for comparison. Finally, numerical simulations are performed to confirm the accuracy of the theoretical derivations under different schemes. Results demonstrate the superiority of the proposed scheme over benchmark schemes in terms of improving the security and reliability of SU, as well as saving power consumption of the system.","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141009427","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Algebraic side‐channel attacks on Trivium stream cipher","authors":"Wenlong Sun, Jie Guan","doi":"10.1049/cmu2.12752","DOIUrl":"https://doi.org/10.1049/cmu2.12752","url":null,"abstract":"Algebraic Side‐Channel Attacks (ASCAs), first proposed by Renauld and Standaert in 2009, are a potent cryptanalysis method against block ciphers. In this paper, the authors initially utilize ASCAs to analyze the security of the Trivium stream cipher, given its concise algebraic structure. Considering its efficiency in both hardware and software implementations, the authors deploy ASCAs to target Trivium implemented both in application specific integrated circuit (ASIC) under the Hamming Distance Leakage Model (HDLM) (noted as CASE 1) and in microcontrollers of various buses (i.e. some common 8‐bit, 16‐bit, and 32‐bit architectures, noted as CASE 2, CASE 3, and CASE 4, respectively) under the Hamming Weight Leakage Model (HWLM). Here, the authors’ attacks are conducted on power‐simulated targets and not on real devices. For a single power consumption trace without measurement errors, this paper presents experimental results using MiniSat 2.0. Unfortunately, the authors were unable to break the ASIC implementation of Trivium under HDLM (CASE 1) with a time complexity of 2109 s or so, which is worse than the exhaustive key attack. For CASEs 2 to 4, the authors can find the complete 288‐bit state of Trivium within a reasonable timeframe. Specially, the success rate can reach 100% with an average solving time of less than 1 s when only measuring the leakages of the first eight consecutive rounds for CASE 2. Furthermore, the authors can still successfully recover the internal state even when obtaining leakages of the first 41 rounds with a random loss rate. In fact, it can tolerate a 74% random loss rate for the first 223 rounds. With regard to the potential errors in the measurements, the authors mitigate them using Tolerant ASCA (TASCA). Similarly, CASE 1 cannot be compromised even in error‐free situations, while the authors can still successfully recover the internal state of CASEs 2 to 4 from a single power trace, even with a high error rate, including 100% incorrect measurements. Surprisingly, for CASEs 2 to 4, the authors can recover the internal state with a 100% success rate, regardless of the error rate. As a result, the security of Trivium will not be enhanced when transitioning from a smaller 8‐bit platform to a larger 32‐bit platform. In the end, the authors will consider some more abstract attack models. The results can provide us with additional insights into the security of Trivium from a different perspective.","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141019867","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An effective attention and residual network for malware detection","authors":"Wei Gu,&nbsp;Hongyan Xing,&nbsp;Tianhao Hou","doi":"10.1049/cmu2.12754","DOIUrl":"https://doi.org/10.1049/cmu2.12754","url":null,"abstract":"<p>Due to its open source and large user base, Android has emerged as the most popular operating system. Android's popularity and openness have made it a prime target for malicious attackers. Permissions have received great attention from researchers because of their effectiveness in restricting applications’ access to sensitive resources. However, existing malware detection methods based on permissions are easily bypassed by inter-application resource access. To address these issues, we combine inter-application resource access-related intent features with permission features. Besides, we designed a customized convolutional neural network using two squeeze-and-excitation blocks to learn the inherent relationships between multi-type features. The two basic SE blocks perform squeezing operations based on average pooling and max pooling, respectively, to compute channel-wise attention from multiple perspectives. We designed a series of experiments based on real-world samples to evaluate the efficacy of the proposed framework. Empirical results demonstrate that our framework outperforms state-of-the-art methods, achieving an accuracy of 96.29%, precision of 97.52%, recall of 94.63%, F1-score of 96.06% and MCC of 92.60%. These promising experimental results consistently demonstrate that AMERDroid is an effective approach for Android malware detection.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12754","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141245923","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Survey of research on confidential computing","authors":"Dengguo Feng,&nbsp;Yu Qin,&nbsp;Wei Feng,&nbsp;Wei Li,&nbsp;Ketong Shang,&nbsp;Hongzhan Ma","doi":"10.1049/cmu2.12759","DOIUrl":"10.1049/cmu2.12759","url":null,"abstract":"<p>As the global data strategy deepens and data elements accelerate integrating and flowing more rapidly, the demand for data security and privacy protection has become increasingly prominent. Confidential computing emerges as a crucial security technology to solve security and privacy problem, and it is also a hot subject of in contemporary security technologies. Leveraging collaborative security in both hardware and software, it builds a trusted execution environment to ensure confidentiality and integrity protection for data in use. This paper provides a comprehensive overview of the development process of confidential computing, summarizing its current research status and issues, which focuses on the security requirements for data security and privacy protection. Furthermore, it deeply analyses the common technical features of confidential computing, and proposes a trusted confidential computing architecture based on collaborative hardware and software trust. Then, it elaborates on the research status and issues of confidential computing from four aspects: hardware security, architecture and key technologies, applications, and standards and evaluation. Finally, this paper provides a synthesis and outlook for the future development of confidential computing. In summary, confidential computing is currently in a rapidly developing stage and will play an important role in cyber security in the future.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12759","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140666234","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Resource allocation and passive beamforming for IRS-assisted short packet systems","authors":"Yangyi Zhang,&nbsp;Xinrong Guan,&nbsp;Qingqing Wu,&nbsp;Zhi Ji,&nbsp;Yueming Cai","doi":"10.1049/cmu2.12763","DOIUrl":"10.1049/cmu2.12763","url":null,"abstract":"<p>This paper investigates an intelligent reflecting surface (IRS) assisted downlink short packet transmission system, where an access point sends short packets to multiple devices with the help of an IRS. Specifically, a performance comparison between the frequency division multiple access and time division multiple access is conducted for the considered system, from the perspective of average age of information (AoI). To minimize the maximum average AoI among all devices, the resource allocation and passive beamforming are jointly optimized. However, the formulated problem is difficult to solve due to the non-convex objective function and coupled variables. Thus, an alternating optimization based algorithm is proposed by exploiting the semidefinite relaxation and bisection search techniques. Simulation results show that time division multiple access can achieve lower AoI by exploiting the time-selective passive beamforming of IRS for maximizing the signal to noise ratio of each device consecutively. Moreover, it also shows that as the length of information bits becomes sufficiently large as compared to the available bandwidth, the proposed frequency division multiple access transmission scheme becomes more favourable due to more flexible power allocation.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12763","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140668189","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Probabilistic models for evaluating network edge's resistance against scan and foothold attack","authors":"Shuo Wang, Qingqi Pei, Yang Xiao, Feng Shao, Shuai Yuan, Jiang Chu, Renjie Liao","doi":"10.1049/cmu2.12774","DOIUrl":"https://doi.org/10.1049/cmu2.12774","url":null,"abstract":"The threat of Scan and Foothold Attack to the Network Edge (SFANE) is increasing, which greatly affects the application and development of edge computing network architecture. However, existing works focus on the implementation of specific technologies that resist the SFANE but ignore the effectiveness analysis of them. To overcome this limitation, this paper constructs probabilistic models for evaluating network edge's resistance against SFANE. In particular, the attacker models of the SFANE based on the ATT&CK model are first formalized. Afterward, according to the state‐of‐the‐art defense technologies, three different defense strategies are illustrated: no defense, address mutation, and fingerprint decoy. Subsequently, three different probabilistic models are constructed to provide a deeper analysis of the theoretical effect of these strategies on resisting the SFANE. Finally, the experimental results show that the actual defense effect of each strategy almost perfectly follows its probabilistic model.","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140672121","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"On a class of column-weight 3 decomposable LDPC codes with the analysis of elementary trapping sets","authors":"G. Raeisi,&nbsp;M. Gholami","doi":"10.1049/cmu2.12762","DOIUrl":"10.1049/cmu2.12762","url":null,"abstract":"<p>A column-weight <span></span><math>\u0000 <semantics>\u0000 <mi>k</mi>\u0000 <annotation>$k$</annotation>\u0000 </semantics></math> LDPC code with the parity-check matrix <span></span><math>\u0000 <semantics>\u0000 <mi>H</mi>\u0000 <annotation>$H$</annotation>\u0000 </semantics></math> is called decomposable if there exists a permutation <span></span><math>\u0000 <semantics>\u0000 <mi>π</mi>\u0000 <annotation>$pi$</annotation>\u0000 </semantics></math> on the rows of <span></span><math>\u0000 <semantics>\u0000 <mi>H</mi>\u0000 <annotation>$H$</annotation>\u0000 </semantics></math>, such that <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>π</mi>\u0000 <mo>(</mo>\u0000 <mi>H</mi>\u0000 <mo>)</mo>\u0000 </mrow>\u0000 <annotation>${pi }(H)$</annotation>\u0000 </semantics></math> can be decomposed into <span></span><math>\u0000 <semantics>\u0000 <mi>k</mi>\u0000 <annotation>$k$</annotation>\u0000 </semantics></math> column-weight one matrix. In this paper, some variations of edge coloring of graphs are used to construct some column-weight three decomposable LDPC codes with girths at least six and eight. Applying the presented method on several known classes of bipartite graphs, some classes of column-weight three decomposable LDPC codes are derived having flexibility in length and rate. Interestingly, the constructed parity-check matrices based on the proper edge coloring of graphs can be considered as the base matrix of some high rate column-weight three quasi-cyclic (QC) LDPC codes with maximum-achievable girth 20. The paper also leads to a simple characterization of elementary trapping sets of the decomposable codes based on the chromatic index of the corresponding normal graphs. This characterization corresponds to a simple search algorithm finds all possible existing elementary trapping sets in a girth-6 or girth-8 column-weight 3 LDPC code which are layered super set of a short cycle in the Tanner graph of the code. Simulation results indicate that the QC-LDPC codes with large girths lifted from the constructed base matrices have good performances over AWGN channel.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12762","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140676250","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Energy efficient RF chains selection based on integrated Hungarian and genetic approaches for uplink cell-free millimetre-wave massive MIMO systems","authors":"Abdulrahman Al Ayidh,&nbsp;Mohammed M. Alammar","doi":"10.1049/cmu2.12761","DOIUrl":"10.1049/cmu2.12761","url":null,"abstract":"<p>The purpose of this work is to explore the decrease of total used power in cell-free millimetre-wave (mm-Wave) massive multiple-input multiple-output (MIMO) systems, which can be regarded an essential technology for future wireless generations to improve system performance. One of the most important strategies for reducing total power consumption is to activate and deactivate radio frequency (RF) chains at each access point (AP) in the coverage region. Nonetheless, the optimization issue for this methodology is NP-hard, and an exhaustive search method may be used to determine the ideal number of RF chains at each AP in the cell-free network. Unfortunately, the exhaustive searching approach is prohibitively complicated, indicating that it is unworkable when there are a significant number of APs in the service region. Furthermore, present RF chain selection approaches prioritize decreasing consumed power and complexity at the price of system performance in terms of total possible rate. This research solves this issue by introducing a unique RF chain selection approach that combines Hungarian and genetic algorithms. The fact that the genetic algorithm (GA) can readily determine the ideal number of active RF chains, yet this technique generally entails significant complexity in large-scale cell-free networks, prompted this notion. As a result, the Hungarian method is used early in the GA to overcome the complexity problem while still retaining system performance. In addition, the suggested system employs a semi-centralized hybrid beamforming architecture in which all analogue combiners for all APs are operated at a central processing unit using channel state information. In addition, each AP has a fully linked phase shifters network and restricted RF chains connecting to its antennas. Finally, simulation findings reveal that, when compared to state-of-the-art techniques, the suggested approach achieves the maximum attainable rate and overall energy efficiency with a tolerable computational complexity.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12761","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140683357","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Optimizing secure power allocation in massive MIMO systems with an eavesdropper under imperfect CSI conditions","authors":"Abdolrasoul Sakhaei Gharagezlou,&nbsp;Mahdi Nangir,&nbsp;Nima Imani","doi":"10.1049/cmu2.12769","DOIUrl":"10.1049/cmu2.12769","url":null,"abstract":"<p>This paper discusses the operation of a massive multiple-input multiple-output (MIMO) system from a different perspective. The system is performed in the presence of an eavesdropper who is trying to disrupt the message being transmitted between the base station (BS) and the users. An attempt has been made to maximize the secure energy efficiency (EE) of the system by allocating appropriate power to each user. The channel state information (CSI) between users and the BS is considered imperfect and the employed precoding scheme is the zero forcing (ZF). The CSI related to the eavesdropper is considered to be perfect and its precoding is assumed to be the maximum ratio transmission (MRT). The problem of optimization that is for maximizing the EE has two constraints including the maximum transmission power and the minimum user data rate. To improve the performance of system, the cell division technique is applied, which results in approaching the performance of system to the without eavesdropper scenario. Five various scenarios have been investigated in this research, and it is proved that the proposed method improves the system performance in all cases. The numerical and simulation results obtained from implementation of the proposed algorithm confirm the claim.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12769","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140687883","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Burst traffic: Congestion management and performance optimization strategies in heterogeneous cognitive radio networks","authors":"Jie Yan,&nbsp;Bo Zhang,&nbsp;Shi Wang,&nbsp;Hao Lan,&nbsp;Xin Wang","doi":"10.1049/cmu2.12753","DOIUrl":"10.1049/cmu2.12753","url":null,"abstract":"<p>In order to solve the network congestion problem caused by burst service flows in heterogeneous cognitive radio networks (Het-CRN), a two-stage dual-threshold random early detection (TD-RED) control mechanism is proposed here. Meanwhile, a three-state Markov modulated Poisson process (MMPP-3) is used to model the burst service to analyze its arrival in depth. Moreover, a performance evaluation system (PES) is proposed to quantify the interference of burst services to different classes of services and their quality of service, which can comprehensively evaluate the performance enhancement of the TD-RED control mechanism for each service. The system examines performance metrics such as packet loss rate, average delay, average captain etc. PES simulation results show that TD-RED significantly reduces the packet rejection rate and transmission delay compared to the no congestion control (NCC) and random early detection (RED) methods, thus providing superior quality of service to all services. thereby providing a superior quality of service to cognitive users. Its lower average captain fully proves that TD-RED can effectively alleviate congestion.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12753","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140691243","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}