Current Issue

25 April 2023, Volume 44 Issue 4

Previous Issue    Next Issue

Papers

Nonlinear transform coding for semantic communications

Ping ZHANG, Jincheng DAI, Yuming ZHANG, Sixian WANG, Xiaoqi QIN, Kai NIU

2023, 44(4):  1-14.  doi:10.11959/j.issn.1000-436x.2023087

Asbtract ( 486 )   HTML ( 125)   PDF (4273KB) ( 570 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The modular design and limited processing mechanism of traditional communication systems limit the continuous improvement of end-to-end data transmission capability.For this reason, a new nonlinear transform coding framework for semantic communications was proposed.First, an end-to-end rate distortion optimization criterion for semantic communication was derived based on variational theory.Based on this, a nonlinear transform was designed to extract the compact representation of source data in the semantic latent space, and variable-rate nonlinear joint source-channel coding was implemented through the guidance of variational entropy model.Experiments show that semantic nonlinear transform coding can significantly improve the end-to-end data transmission performance and robustness, and is one of the key technologies to catalyze future semantic communications.

Joint resampling algorithm for parallel dual feedback time-frequency domain symbol timing recovery

Peixin ZHANG, Nan ZHANG, Daqing WANG, Tong WU, Zhe LI, Fengkui GONG

2023, 44(4):  15-26.  doi:10.11959/j.issn.1000-436x.2023046

Asbtract ( 112 )   HTML ( 20)   PDF (1973KB) ( 128 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the problem that it is difficult for existing implementation algorithms of symbol timing recovery to give full consideration to high convergence accuracy and the robustness to resist timing deviation, a high-speed parallel symbol timing recovery algorithm with resampling was proposed.The timing frequency offset and timing phase offset were corrected by using double feedback loops.In the design of parallel resampling, the implementation of parallel numerically controlled oscillators and the use of enable signals sorting and shift registers to implement data reordering were proposed.When designing the timing recovery loop, the parallel implementation structure of the O＆amp;M timing error estimation algorithm was analyzed and deduced, and the design method and implementation structure of the loop correction were proposed based on the analysis of the timing phase/frequency offset correction principle.The FPGA test results show that the proposed algorithm can realize the symbol timing recovery of 64APSK modulated signals with arbitrary multiple symbol rate between 4 and 16 times, and the error vector magnitude (EVM) with the ideal signal is within 4%, which meets the requirements of broadband satellite communication.

Novel air-to-air data link system based on millimeter wave communication

Pengzheng XU, Qiyue YU, Hongchi LIN, Haining LIU

2023, 44(4):  27-37.  doi:10.11959/j.issn.1000-436x.2023057

Asbtract ( 218 )   HTML ( 33)   PDF (2129KB) ( 690 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to solve the problems of insufficient communication rate between networked fighters, signals being easily eavesdropped and interfered, and unsatisfactory networking performance in the existing air-to-air inter-aircraft data links, a millimeter wave communication air-to-air data link system was proposed.The millimeter wave communication technology was introduced into the data link system, and reconfigurable intelligent surface, orthogonal time frequency space modulation, integrated sensing and communication, and wireless ad hoc network technology were integrated.The analysis and simulation results show that the proposed system is superior to existing systems in terms of transmission bandwidth, anti-interception and anti-interference performance and hardware complexity and cost.At the same time, the proposed system faces technical challenges such as real-time beam tracking, which need further research to solve.

Nove lincidence matrix differential power analysis for resisting ghost peak

Zijing JIANG, Qun DING

2023, 44(4):  38-49.  doi:10.11959/j.issn.1000-436x.2023063

Asbtract ( 99 )   HTML ( 12)   PDF (5002KB) ( 153 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

At present, differential power analysis (DPA) is one of the most important threats to the security of block ciphers in chips.When the collected power trace is insufficient, DPA is vulnerable to ghost peak caused by the difference mean value generated by the wrong key.Based on DPA, a incidence matrix differential power analysis (IMDPA) was proposed which could effectively resist ghost peak.The prediction difference mean matrix was constructed to avoid the influence of the non leaking interval on the key guessing of the leaking interval by using the weak correlation of the guessing key in the non leaking interval.The proposed IMDPA was tested in different leak intervals of AES-128 algorithm.The results show that compared with traditional DPA, IMDPA requires less (up to 85%) power trace to guess the correct key.At the same time, the key guessing efficiency of AES-128 under the implementation of protective measures by IMDPA still has obvious advantages.In order to further verify the universality of IMDPA in block ciphers, experimental verification is conducted on SM4 algorithm.Compared with traditional DPA, IMDPA requires less (up to 87.5%) power traces to guess the correct key.

Research on multidimensional dynamic defense strategy for microservice based on deep reinforcement learning

Dacheng ZHOU, Hongchang CHEN, Weizhen HE, Guozhen CHENG, Hongchao HU

2023, 44(4):  50-63.  doi:10.11959/j.issn.1000-436x.2023077

Asbtract ( 182 )   HTML ( 22)   PDF (2919KB) ( 484 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the problem that it is hard for security defense strategies in cloud native to guarantee the quality of service under dynamic requests, a multidimensional dynamic defense strategy for microservice based on deep reinforcement learning, named D2RA strategy, was proposed to provide dynamic configuration schemes that ensure security defense performance and quality of service for microservices under dynamical requests.Firstly, based on the characteristics of multiple replicas and invocation chains of microservices, a microservices state graph was established to depict the maps between requests, system configuration and security performance, quality of service, and resource overhead of microservices.Secondly, the D2RA framework was designed and a dynamic strategy optimization algorithm based on deep Q-network was proposed for microservices to provide fast and optimal system configurations update scheme under dynamic requests.The simulation results show that D2RA effectively allocate resources under dynamic requests, and achieve 19.07% more defense effectiveness and 42.31% higher quality of service as compared to the existing methods.

Load-to-store: exploit the time leakage of store buffer transient window

Ming TANG, Yifan HU

2023, 44(4):  64-77.  doi:10.11959/j.issn.1000-436x.2023051

Asbtract ( 124 )   HTML ( 19)   PDF (1887KB) ( 396 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To research the vulnerability of modern microarchitecture and consider the mitigation, memory order buffer which was responsible for managing the execution order of memory access instructions was analyzed and found that load forward would directly bypass the data of dependent store instructions to load instructions, and speculative load would execute independent load instructions in advance.While bring efficiency optimizations, it might also lead to errors and corresponding blocking.The existing optimization mechanisms on the Intel Coffee Lake microarchitecture, and the leak attack scheme by using them were analyzed.Using the four execution modes of MOB and the corresponding duration, a variety of attacks were constructed including transient attack, covert channel, and recovery of the private key of the cryptographic algorithm.The time difference caused by MOB was used to leak the address of memory instructions, and the implementation of AES T table was attacked.Key recovery experiments were conducted on AES-128 with OpenSSL 3.0.0 on an Intel i5-9400 processor.The experimental results show that 30 000 sets of samples can recover a key byte with a probability of 63.6%.Due to the characteristics of memory order buffer, the concealment of the exploit is better than traditional cache time leaks.

Joint beam hopping and coverage control optimization algorithm for multibeam satellite system

Guoliang XU, Feng TAN, Yongyi RAN, Feng CHEN

2023, 44(4):  78-86.  doi:10.11959/j.issn.1000-436x.2023076

Asbtract ( 175 )   HTML ( 24)   PDF (2098KB) ( 531 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To improve the performance of multibeam satellite (MBS) systems, a deep reinforcement learning-based algorithm to jointly optimize the beam hopping and coverage control (BHCC) algorithm for MBS was proposed.Firstly, the resource allocation problem in MBS was transformed to a multi-objective optimization problem with the objective maximizing the system throughput and minimizing the packet loss rate of the MBS.Secondly, the MBS environment was characterized as a multi-dimensional matrix, and the objective problem was modelled as a Markov decision process considering stochastic communication requirements.Finally, the objective problem was solved by combining the powerful feature extraction and learning capabilities of deep reinforcement learning.In addition, a single-intelligence polling multiplexing mechanism was proposed to reduce the search space and convergence difficulty and accelerate the training of BHCC.Compared with the genetic algorithm, the simulation results show that BHCC improves the throughput of MBS and reduces the packet loss rate of the system, greedy algorithm, and random algorithm.Besides, BHCC performs better in different communication scenarios compared with a deep reinforcement learning algorithm, which do not consider the adaptive beam coverage.

Joint scheduling algorithm for correlative tasks in multi-access edge computing

Weifeng LU, Ning LI, Jia XU, Lijie XU, Jian XU

2023, 44(4):  87-98.  doi:10.11959/j.issn.1000-436x.2023047

Asbtract ( 159 )   HTML ( 36)   PDF (1032KB) ( 355 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Multi-access edge computing (MEC) has emerged as a promising computing paradigm for resource-intensive applications.However, most of the previous research work has not considered correlative tasks, which may lead to infeasible scheduling decisions.Considering that some tasks on the application must be completed locally and another non-negligible energy consumption problem in the multi-access edge computing offloading scenario, the joint scheduling algorithm of correlative tasks on the local and edge sides was studied.The problem was formalized as minimizing the energy consumption in the system while satisfying the application’s completion deadline constraints, and the joint scheduling (JS) algorithm was proposed to solve the problem.Finally, the performance of the JS algorithm in the application completion rate and system energy consumption were analyzed through simulation experiments.The simulation results show that the JS algorithm is superior to other comparison algorithms in the application completion rate and can save at least 43% of the system energy consumption.

Research on PAPR reduction algorithm based on CWGAN-SLM for multi-wavelet OFDM system

Guang YANG, Zhaoyang WU, Min NIE, Xiaohong YAN, Fan JIANG

2023, 44(4):  99-110.  doi:10.11959/j.issn.1000-436x.2023069

Asbtract ( 110 )   HTML ( 18)   PDF (2141KB) ( 194 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to meet the demand for low peak to average ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) technology in the future 6G satellite-ground integrated system, an algorithm combining selective mapping (SLM) algorithm and multi-wavelet OFDM technology was proposed firstly.However, the PAPR reduction was limited and the computational complexity was high.To solve this problem, a multi-wavelet OFDM PAPR reduction algorithm based on conditional Wasserstein generative adversarial network (CWGAN) and SLM was proposed, which was called CWGAN-SLM algorithm.CWGAN was introduced to generate more time-domain alternative signals to reduce the PAPR in the CWGAN-SLM algorithm.Simulation results indicate that the CWGAN-SLM algorithm greatly reduces the PAPR of the system and the computational complexity, and has a lower bit error rate.Compared with the GAN and WGAN, the CWGAN has the advantages of easy training, strong stability and good PAPR performance.

Research on efficient cross trust-domain group authentication with conditional privacy of vehicle platoon under blockchian architecture

Yingjie XIA, Siyu ZHU, Xuejiao LIU

2023, 44(4):  111-123.  doi:10.11959/j.issn.1000-436x.2023048

Asbtract ( 159 )   HTML ( 22)   PDF (2661KB) ( 660 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to balance the security and efficiency of vehicle platoon cross trust-domain identity authentication, an efficient cross trust-domain group authentication scheme with conditional privacy of vehicle platoon under blockchian architecture was proposed.A novel block structure BM-Tree was designed for vehicle platoon identity authentication, which provided support for efficient cross trust-domain group authentication by sharing the group authentication parame-ters on the blockchain.Dynamic pseudonym was used for vehicle identity privacy-preserving and bilinear mapping was used to transform the trust-domain parameters, which realized cross trust-domain group authentication with conditional privacy.An efficient group authentication protocol based on BM-Tree was proposed, which realized batch identity au-thentication and re-authentication of vehicle platoon.The proposed scheme has better performance than existing cross trust-domain authentication methods in terms of security and computational overhead.Experimental result shows that the authentication delay is reduced by 29%, 25% and 53% on average, respectively compared with BLA, MDPA and BBA.

Research on intrusion detection for maritime meteorological sensor network based on balancing generative adversarial network

Xin SUN, Guifu ZHANG, Hongyan XING, Wang Zenghui

2023, 44(4):  124-136.  doi:10.11959/j.issn.1000-436x.2023078

Asbtract ( 155 )   HTML ( 18)   PDF (4862KB) ( 164 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the problem that the resources of maritime mobile terminals were limited and the network traffic was imbalanced in the MMSN (maritime meteorological sensor network) environment, which made it difficult to detect network intrusion accurately, a mobile edge computing based physical architecture of MMSN was proposed, and an intrusion detection model based on balancing generative adversarial network was proposed.First, an advanced balancing generative adversarial network was adopted to augment the imbalanced data.Then, a lightweight network based on group convolution was applied to intrusion data classification.Finally, compared with conventional data augmentation models, the computer simulation proves that the proposed model has a higher ability to recognize various attacks, especially minority class attacks on MMSN.

SAT-based differential automatic search algorithm using divide-and-conquer strategy and its applications

Bin HU, Xiao TAN, Senpeng WANG

2023, 44(4):  137-144.  doi:10.11959/j.issn.1000-436x.2023082

Asbtract ( 135 )   HTML ( 12)   PDF (743KB) ( 362 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To improve the efficiency of automatic search, an algorithm for searching the optimal differential characteristics based on SAT model was proposed by combining the divide-and-conquer strategy.The search space was divided into disjoint subsets by using the information from Matsui boundary conditions of arbitrary continuous rounds.By analyzing the relationships between satisfiability of differential models based on SAT, a descending branch search chain model was proposed.Furthermore, at the model optimization level, the number of subsets that need to be searched and partitioned was decreased.At the level of algorithm implementation, the search space was reduced by utilizing the parallel technology.Finally, the accelerated algorithm was applied to SPECK family of ARX cryptographic algorithms.The 20, 14, 11-round optimal differential characteristics of SPECK-48, SPECK-96, SPECK-128 are obtained, which increase the previous best results by 1, 4, 2 rounds respectively.

Improved integral attack——random linear distinguish and key recovery attack

Shaoyu DU

2023, 44(4):  145-153.  doi:10.11959/j.issn.1000-436x.2023085

Asbtract ( 99 )   HTML ( 11)   PDF (1405KB) ( 307 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Based on the integral attack and collision attack of four rounds of AES, a random linear distinguish attack against four rounds of SP block ciphers was proposed, which took advantage of the non-uniformity of linear biases’ distribution between some blocks of plaintext and inner state.Combined with precomputation, a key recovery attack against four rounds of AES-like block ciphers was proposed.For LED-64, the results of distinguish attack and key recovery attack were given.Therein for LED-64 of 1-Step, the probability of successful distinguish attack is 85% under the condition that the data complexity is 2⁸ and the computational complexity is 2¹⁶ basic operation.For LED-64 of 2-Step, the calculation complexity of the key recovery attack under the condition of related key is 2¹⁴ basic operation, the data complexity is 2⁸, and the precomputation storage complexity is 2³⁸ half bytes.

CLB-Defense: based on contrastive learning defense for graph neural network against backdoor attack

Jinyin CHEN, Haiyang XIONG, Haonan MA, Yayu ZHENG

2023, 44(4):  154-166.  doi:10.11959/j.issn.1000-436x.2023074

Asbtract ( 281 )   HTML ( 27)   PDF (3377KB) ( 536 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

For the problem that the existing backdoor attack defense methods are difficult to deal with irregular and unstructured discrete graph data to alleviate the threat of backdoor attacks, a backdoor attack defense method for GNN based on contrastive learning was proposed, namely CLB-Defense.Specifically, a contrastive model was built by using contrastive learning in an unsupervised way, which searches suspicious backdoored samples.Then the suspicious backdoored samples were reshaped by using the graph importance indexes and the label smoothing strategy, and the defense against graph backdoor attack was realized.Finally, extensive experimental results show that CLB-Defense realizes the effect of defense performance on four public datasets and five popular graph backdoor attacks, e.g., CLB-Defense can reduce the attack success rate by an average of 75.66% (compared with the baselines, an improvement of 54.01%).

Statistical ineffective fault analysis of the lightweight authenticated cipher algorithm Saturnin-Short

Wei LI, Chun LIU, Dawu GU, Wenqian SUN, Jianning GAO, Mengyang QIN

2023, 44(4):  167-175.  doi:10.11959/j.issn.1000-436x.2023084

Asbtract ( 100 )   HTML ( 7)   PDF (2804KB) ( 216 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

On the random single byte-oriented fault model and the assumption of ciphertext-only attack, a statistical ineffective fault analysis of the Saturnin-Short cipher was proposed.The analysis combined the statistical distribution with the ineffective analysis, and discussed the difference between intermediate states before and after fault injections.A variety of dual distinguishers was designed, such as the probabilistic symmetric Chi-square-maximum likelihood estimate, and harmonic mean-Hamming weight.It only required at least 1 097 ineffective faults to recover the 256 bit secret key with a success rate of at least 99%.The experimental results show that the proposed distinguishers can not only decrease fault injections, but also reduce the attacking time and complexities.Therefore, the Saturnin-Short cipher cannot resist against the statistical ineffective fault analysis.It provides an important reference for the security analysis of other lightweight authenticated ciphers.

Generative text steganography method based on emotional expression in semantic space

Yuling LIU, Cuilin WANG, Zhangjie FU

2023, 44(4):  176-186.  doi:10.11959/j.issn.1000-436x.2023045

Asbtract ( 136 )   HTML ( 20)   PDF (2255KB) ( 594 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the problems that “over optimizing” the quality of steganographic text and lack of constraints on the semantic expression of the generated steganographic text in existing generative text steganography methods, a generative text steganography method was proposed based on emotional expression in semantic space.In order to make use of the scene fusion provided by the new media platform to obtain many camouflage scenes, the focus was how to use the unsupervised extraction model to extract the emotional expression combination candidate set from the original data set, then sort the candidate set of emotional expression combinations based on the improved bipartite graph sorting algorithm to obtain the emotional expression combination set, map them to the semantic space, and then implement embedding secret information while generating the user’s opinions based on the emotion expression combinations.Experimental results show that, compared with the existing generative text steganography methods in semantic space, the product reviews generated by the proposed method have a minimum perplexity of 10.536, and have a strong correlation with the chosen product, which can further guarantee the cognitive concealment of steganographic texts.At the same time, the proposed method can also be effectively used in the field of secure and confidential communication, and can avoid the senders being traced and analyzed.

Multi-function supported privacy protection data aggregation scheme for V2G network

Baiji HU, Xiaojuan ZHANG, Yuancheng LI, Rongxin LAI

2023, 44(4):  187-200.  doi:10.11959/j.issn.1000-436x.2023081

Asbtract ( 147 )   HTML ( 27)   PDF (1682KB) ( 395 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In view of the problem that the functions of the current privacy protection data aggregation scheme were insufficient to meet the increasingly rich application requirements, a multi-function supported privacy protection data aggregation (MFPDA) scheme for V2G network was proposed.By using cryptographic algorithms such as BGN, BLS, and Shamir’s secret sharing, as well as fog computing and consortium blockchain technology, multiple security functions like fault tolerance, resistance to internal attacks, batch signature verification, no need for trusted third parties, and multiple aggregation functions were integrated into one privacy protection data aggregation scheme.Security analysis shows that the proposed scheme can protect data aggregation’s security, privacy and reliability.The performance evaluation shows that the introduction of fog computing can significantly reduce the computing overhead of the control center, and the reduction rate can be as high as 66.6%; the improvement of the consortium blockchain can effectively reduce the communication and storage overhead of the system, and the reduction rate can reach 16.7% and 24.9% respectively.

Comprehensive Review

Survey on rail transit mobile edge computing network security

Renchao XIE, Wen WEN, Qinqin TANG, Yunlong LIU, Gaochang XIE, Tao HUANG

2023, 44(4):  201-215.  doi:10.11959/j.issn.1000-436x.2023071

Asbtract ( 287 )   HTML ( 39)   PDF (2394KB) ( 697 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The introduction of mobile edge computing (MEC) technology in rail transit which has the characteristics of complex environment, high densities of passengers, and high-speed mobility can meet the low latency, mobility, and massive connection requirements of rail transit.However, MEC not only improves the performance of rail transit communication network but also brings security challenges.Firstly, an overview of rail transit communication network and MEC was given.Then the value of introducing MEC into rail transit and the architecture of rail transit edge computing network were discussed.After that, the security threats faced by rail transit edge computing network was analyzed and protection scheme was proposed.Finally, some open questions were proposed, which was expected to provide ideas for future research.

Correspondences

Study of SDN intrusion intent identification algorithm based on Bayesian attack graph

Zhiyong LUO, Yu ZHANG, Qing WANG, Weiwei SONG

2023, 44(4):  216-225.  doi:10.11959/j.issn.1000-436x.2023073

Asbtract ( 129 )   HTML ( 30)   PDF (2401KB) ( 385 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Since the existing software defined network (SDN) security prediction methods do not consider the attack cost and the impact of controller vulnerabilities on SDN security, a Bayesian attack graph-based algorithm to assessing SDN intrusion intent was proposed.The PageRank algorithm was used to obtain the criticality of the device, and combining with the vulnerability value, attack cost, attack benefit and attack preference, an attack graph was constructed, and a risk assessment model was established to predict the intrusion path.Through experimental comparison, it is obvious that the proposed model can more accurately predict the intrusion path, effectively ensure the accuracy of security prediction, and provide a basis for SDN defense.

Zeroing neural network for time-varying convex quadratic programming with linear noise

Jianfeng LI, Zheyu LIU, Yang RONG, Zhan LI, Bolin LIAO, Linxi QU, Zhijie LIU, Kunhuang LIN

2023, 44(4):  226-233.  doi:10.11959/j.issn.1000-436x.2023075

Asbtract ( 109 )   HTML ( 9)   PDF (28855KB) ( 80 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the problem that linear time-varying noise may have a negative impact on the existing zeroing neural network model to solve TVQP problem, resulting in slow convergence and low accuracy of the model, a double integral enhancement zeroing neural network was proposed.To solve the problem of linear time-varying interference of the noise, the double integral was introduced based on the original ZNN design formula, and a activation function was designed to eliminate the effects of linear time-varying noise.Theoretical analysis proved that the DIEZNN model had convergence and good noise suppression ability.The experimental results show that compared with the traditional gradient neural network and other variable ZNN models, the proposed DIEZNN model has faster convergence and higher accuracy, and can effectively solve the linear time-varying noise.