Please wait a minute...

Current Issue

    25 September 2021, Volume 42 Issue 9
    Papers
    Security capability analysis of software-based heterogeneous redundant execution system
    Bolin MA, Zheng ZHANG, Quan REN, Gaofei ZHANG, Jiangxing WU
    2021, 42(9):  1-11.  doi:10.11959/j.issn.1000-436x.2021176
    Asbtract ( 390 )   HTML ( 124)   PDF (872KB) ( 407 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Software-based redundant execution (SRE) is a popular fault-tolerant design method which makes use of faults occurring randomly to achieve fault-tolerance.Software-based heterogeneous redundant execution (SHRE) uses heterogeneous redundant software replicas with identical function based on SRE and diversity of software.By comparing the results of heterogeneous redundant software replicas, SHRE can resist threats from software vulnerabilities and homogenization.The classification method of SHRE was proposed, and the security capability of SHRE was introduced.Based on N-modular redundancy, I/O operation mode and the recovery capability of attacked software replica, resistance to attack of different structures were analyzed.The analysis shows that the security capability of SHRE performs best when it is triple-mode redundancy architecture and attacked software replica can be recovered.Besides, by shortening the recovery time of attacked software replica, security to SHRE can be improved.

    Resource optimization for UAV relay networks based on physical-layer network coding
    Junyi YANG, Bo LI, Qinyu ZHANG
    2021, 42(9):  12-20.  doi:10.11959/j.issn.1000-436x.2021172
    Asbtract ( 365 )   HTML ( 92)   PDF (848KB) ( 387 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To solve the problem of low resource utilization of the traditional two-way communication network with unmanned aerial vehicle (UAV) as relays, a resource optimization algorithm based on physical-layer network coding was proposed.Considering the transmission power constraints of the UAV relay communication network, the maximum speed constraints of the UAV and the synchronization requirements of the physical-layer network coding, a resource allocation model for joint optimization of transmission power and UAV trajectory design was formulated to minimize the system outage probability.By decoupling the original non-convex problem into two sub-problems, an iterative algorithm was proposed to realize the joint implementation of optimal trajectory design and optimal system power distribution based on the Karush-Kuhn-Tucker (KKT) conditions, Lagrangian duality method and subgradient method.Simulation results show that the proposed algorithm can significantly improve the system performance and reduce the possibility of communication interruption.

    Time deterministic network routing algorithm based on stochastic temporal graph
    Peng WANG, Xiushe ZHANG, Long SUO, Keyi SHI
    2021, 42(9):  21-30.  doi:10.11959/j.issn.1000-436x.2021138
    Asbtract ( 509 )   HTML ( 73)   PDF (896KB) ( 466 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    With respect to the contradiction between the randomness of space-terrestrial integrated network resources and the deterministic requirements of service delay in the network, a stochastic temporal graph model was proposed, based on which a routing algorithm that could guarantee the service delay was constructed.Firstly, how to compute the time-deterministic route over the space information network was modeled as a non-linear programming.To mitigate the problem, a stochastic temporal graph model was proposed, which characterized the stochastic features, caused by the stochastic services of communication links, storage and temporal resources.In addition, the coupling relationship between storage and communication links was also modeled by the graph.Thus, a model was provided by the graph for enhancing the communication link utilization and supporting the time-deterministic routing.Based on this, a routing algorithm fulfilling service delay requirements with the highest probability was proposed with O(n2) polynomial time.The optimality of the algorithm was proved.

    Low error floor LT coding algorithm by using fixed-length node classification window
    Xin SONG, Naiping CHENG, Shuyan NI, Yurong LIAO, Tuofeng LEI
    2021, 42(9):  31-42.  doi:10.11959/j.issn.1000-436x.2021155
    Asbtract ( 205 )   HTML ( 46)   PDF (1127KB) ( 232 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To solve the problem of high error floor for LT codes in additive white Gaussian noise (AWGN) channels, an improved coding scheme was designed.A fixed-length classification window was used to sort out the information nodes with relatively small degrees.Then these nodes would be forced to participate in the coding process frequently, so that they could obtain sufficiently high reliability.To design the optimal parameters, firstly, the bit error rate (BER) performance of LT codes and the cause of the error floor were analyzed, and the theoretical BER lower bound was introduced as the first constraint.Secondly, the extrinsic information gain loss ratio (GLR) was designed to measure the convergence behavior of the improved LT code, and maximizing the GLR was denoted as the second constraint.Finally, the influence of different parameters on algorithm efficiency and coding complexity were analyzed, and the principle of priority selection of parameters was pointed out as the third constraint.The simulation results show that compared with the conventional LT code, the proposed algorithm can reduce the error floor by nearly three orders of magnitude.Besides, the designed LT code outperforms the existing LT codes in literature in terms of bit error rate (BER) performance.

    Semantic representation and interval roughness analysis of IoT CapBAC rules
    Xiaoyan LIANG, Ruizhong DU
    2021, 42(9):  43-53.  doi:10.11959/j.issn.1000-436x.2021075
    Asbtract ( 213 )   HTML ( 28)   PDF (1105KB) ( 363 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To break the bottleneck of interval roughness analysis, a rule semantic model IoTACS was proposed, and IoTRA algorithm was given.In IoTACS, a conceptual structure of the IoT CapBAC rule domain was proposed, the quantitative data properties of the basic concepts were given, then the semantic tree model of rule semantics was proposed, the time relations of the time ontology were extended and its quantitative logical representation was given.As the theoretical basis, it was proved that the root cause of interval inconsistency was roughness, and its logical formalization of the roughness was given.The case study shows that IoTRA can help to improve the accuracy of the authorized interval, and the IoTACS model have higher readability than the formal model.The comparison experiments with the IoTC2 algorithm on the inconsistency analysis show that the response time of the IoTRA algorithm is more significantly reduced.

    Trajectory privacy protection scheme based on differential privacy
    Si CHEN, Anmin FU, Mang SU, Huaijiang SUN
    2021, 42(9):  54-64.  doi:10.11959/j.issn.1000-436x.2021168
    Asbtract ( 572 )   HTML ( 95)   PDF (1803KB) ( 560 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To solve the problem that the current sampling mechanism and data obfuscation method may raise insufficient data availability and privacy protection, a trajectory privacy protection scheme based on differential privacy was proposed.A new efficient sampling model based on time generalization and spatial segmentation was presented, and a k-means clustering algorithm was designed to process sampling data.By employing the differential privacy mechanism, the trajectory data was disturbed to solve the user privacy leaking problem caused by the attacker with powerful background knowledge.Simultaneously, to respond to the error boundary of the query range of pandemic, an effective prediction mechanism was designed to ensure the availability of released public track data.Simulation results demonstrate that compared with the existing trajectory differential privacy protection methods, the proposed scheme has obvious advantages in terms of processing efficiency, privacy protection intensity, and data availability.

    Label flipping adversarial attack on graph neural network
    Yiteng WU, Wei LIU, Hongtao YU
    2021, 42(9):  65-74.  doi:10.11959/j.issn.1000-436x.2021167
    Asbtract ( 553 )   HTML ( 67)   PDF (841KB) ( 540 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To expand the adversarial attack types of graph neural networks and fill the relevant research gaps, label flipping attack methods were proposed to evaluate the robustness of graph neural network aimed at label noise.The effectiveness mechanisms of adversarial attacks were summarized as three basic hypotheses, contradictory data hypothesis, parameter discrepancy hypothesis and identically distributed hypothesis.Based on the three hypotheses, label flipping attack models were established.Using the gradient oriented attack methods, it was theoretically proved that attack gradients based on the parameter discrepancy hypothesis were the same as gradients of identically distributed hypothesis, and the equivalence between two attack methods was established.Advantages and disadvantages of proposed models based on different hypotheses were compared and analyzed by experiments.Extensive experimental results verify the effectiveness of the proposed attack models.

    Runtime verification approach for DoS attack detection in edge servers
    Bin YU, Nan ZHANG, Xu LU, Zhenhua DUAN, Cong TIAN
    2021, 42(9):  75-86.  doi:10.11959/j.issn.1000-436x.2021169
    Asbtract ( 314 )   HTML ( 34)   PDF (1240KB) ( 222 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the DoS (denial of service) attacks against edge servers in an edge computing system, a parallel runtime verification approach for DoS attack detection was proposed.First, PPTL (propositional projection temporal logic) formulas were utilized to formally describe expected behaviors of an edge server and DoS attack characteristics.Then, for the PPTL formulas to be verified, a parallel runtime verification framework was adopted to make use of the computing and storage resources of an edge server to conduct anomaly detection and misuse detection.The proposed attack detection approach was performed for an actual P2P (peer-to-peer) network based on smart parking system using edge computing which was supposed to suffer from a DoS attack.Experiments show that the proposed method can accurately and efficiently identify abnormal behaviors of edge servers and types of DoS attacks.

    Dynamic security-empowering architecture for space-ground integration information network
    Lingcui ZHANG, Yaobing XU, Fenghua LI, Liang FANG, Yunchuan GUO, Zifu LI
    2021, 42(9):  87-95.  doi:10.11959/j.issn.1000-436x.2021180
    Asbtract ( 421 )   HTML ( 53)   PDF (902KB) ( 580 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To satisfy the above requirements that due to the dynamic characteristics (e.g., the dynamic variability of threats, and the dynamic changes of protection technology) of space-ground integration information network (SGIIN), the existing security technologies were no longer applicable.Firstly, a security-empowering architecture for SGIIN was designed and formalized, which integrated capability orchestration unit of security service, analysis unit of security situation and the response unit of security threat measure.Then, a double judgment method for the effectiveness of threat measure was proposed.Finally the method is theoretically proved to be credible by using belief mini-entropy.

    High-capacity image steganography algorithm combining image encryption and deep learning
    Xiaoyuan YANG, Xinliang BI, Jia LIU, Siyuan HUANG
    2021, 42(9):  96-105.  doi:10.11959/j.issn.1000-436x.2021134
    Asbtract ( 493 )   HTML ( 52)   PDF (2017KB) ( 444 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the problem that the residual image of cover image and carrier image in the high-capacity image steganography scheme based on deep learning will expose the secret image, a high-capacity image steganography scheme combining image encryption and deep learning was proposed.An image feature extraction method was used, so that the features extracted from the cover image were consistent with the features extracted from the carrier image.Before the image steganography, the sender extracted features from the cover image as a key to encrypt the secret image.After the extractor extracted the encrypted secret image, the features were extracted from the carrier image as a key to decrypt the secret image.The experimental results show that the attacker cannot find the information of the secret image from the residual image, and the frequency of key transmission is lower, and the security of the algorithm is improved.

    Fair and rational delegation of computation in the universally composable framework
    Youliang TIAN, Xiaoxia JIANG
    2021, 42(9):  106-119.  doi:10.11959/j.issn.1000-436x.2021126
    Asbtract ( 255 )   HTML ( 28)   PDF (824KB) ( 499 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To realize the economic and reputation fairness in rational delegation of computation, a fair and rational delegation of computation scheme based on blockchain model of cryptography in the universally composable (UC) framework was proposed.Firstly, a bidirectional reputation incentive model between the delegator and the calculator was presented by combining direct reputation and indirect reputation.Secondly, a dynamic game model with perfect information for fair and rational delegation of computation was constructed based on game theory, and a unique sub-game Nash equilibrium was further obtained.In addition, by analyzing the requirements for verifiability, rational decision of players, economic and reputation fairness, as well as adversary model, the ideal functionality for fair and rational delegation of computation was proposed.Finally, a fair and rational delegation of computation protocol by combining succinct commit-and-prove and smart contract was proposed to securely realize the ideal functionality.The security analysis shows that the proposed protocol satisfies UC security.

    Papers
    Choreography-driven business process management framework based on blockchain
    Dongjin YU, Yijie WEI, Xiaoxiao SUN, Ke NI, Hujun SHEN
    2021, 42(9):  120-132.  doi:10.11959/j.issn.1000-436x.2021171
    Asbtract ( 326 )   HTML ( 37)   PDF (1011KB) ( 397 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the problems of high process instantiation cost and difficult version iteration in the current blockchain-based business process management systems, a choreography-driven blockchain business process management framework was proposed.The framework included a general smart contract that could be used to store business process choreography meta-models, model component evolution versions, and instance execution status.The cost of process model instantiation on the blockchain was significantly reduced by delaying model elements instantiation timing and integrating multiple process instances.At the same time, a version control method based on model data reuse and voting mechanism was introduced, so that process instances of different versions of orchestration models could be created in a single smart contract.A real case validates the effectiveness of the framework in distributed business process management.

    ERDOF: outlier detection algorithm based on entropy weight distance and relative density outlier factor
    Zhongping ZHANG, Weixiong LIU, Yuting ZHANG, Yu DENG, Mianxin WEI
    2021, 42(9):  133-143.  doi:10.11959/j.issn.1000-436x.2021152
    Asbtract ( 263 )   HTML ( 18)   PDF (1228KB) ( 374 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An outlier detection algorithm based on entropy weight distance and relative density outlier factor was proposed to solve the problem of low accuracy in complex data distribution and high dimensional data sets.Firstly, entropy weight distance was introduced instead of euclidean distance to improve the detection accuracy of outliers.Then, the Gaussian kernel density estimation was carried out for the data object based on the concept of natural neighbor.At the same time, relative distance was proposed to describe the degree of the data object deviating from the neighborhood and improve the ability of the algorithm to detect outliers in the low-density region.Finally, the entropy weight distance and relative density outlier factor were proposed to describe the degree of outliers.Experiments with artificial data sets and real data sets show that the proposed algorithm can effectively adapt to various data distributions and outlier detection of high-dimensional data.

    Generative steganography method based on auto-generation of contours
    Zhili ZHOU, Meimin WANG, Gaobo YANG, Jianyu ZHU, Xingming SUN
    2021, 42(9):  144-154.  doi:10.11959/j.issn.1000-436x.2021174
    Asbtract ( 490 )   HTML ( 46)   PDF (1229KB) ( 540 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To address the problems of limited hiding capacity and inaccurate information extraction in the existing generative steganography methods, a novel generative steganography method was proposed based on auto-generation of contours, which consisted of two main stages, such as the contour generation driven by secret information and the contour-to-image transformation.Firstly, the contour generation model was built based on long short term memory (LSTM) for secret information-driven auto-generation of object contours.Then, a contour-to-image reversible transformation model was constructed based on pix2pix network to obtain the stego-image, and the model also supported the reversible transformations from the stego-image to contours for secret information extraction.Experimental results demonstrate that the proposed method not only achieves high hiding capacity and accurate information extraction simultaneously, but also effectively resists the attacks by steganalysis tools.It performs much better than the state-of-the-art generative steganographic methods.

    ID-based ring signature on prime order group from asymmetric pairing
    Hongxia HOU, Mingrui ZHANG, Yanqi ZHAO, Xiaoli DONG
    2021, 42(9):  155-164.  doi:10.11959/j.issn.1000-436x.2021159
    Asbtract ( 201 )   HTML ( 29)   PDF (912KB) ( 273 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the problem that the security proof was difficult to be realized under the standard model in the existing ID-based ring signature schemes, an ID-based ring signature scheme proven secure in the standard model was proposed.Firstly, the formal definitions of security model and adversary model of ID-based ring signature were given.Then, a specific ID-based ring signature scheme was constructed on the prime order groups from asymmetric pairings.Finally, the security analysis and performance analysis were given.The results of security analysis show that the proven security of the proposed scheme is achieved under the standard model by using the dual system encryption technique.The results of performance analysis show that the operation efficiency of each algorithm in the proposed scheme is improved effectively, compared with existing ID-based ring signature schemes from dual system, it is shorter to take the time in generating and verifying signature.

    Indoor carrier phase positioning algorithm based on time-varying clock error elimination
    Shaoshuai FAN, Zhiqiang RONG, Hui TIAN, Lihua LI, Xiaoqi QIN
    2021, 42(9):  165-172.  doi:10.11959/j.issn.1000-436x.2021164
    Asbtract ( 246 )   HTML ( 18)   PDF (795KB) ( 419 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To solve the problems of low positioning accuracy of traditional positioning algorithm and unsynchronized system clock in indoor wireless environment, a 3D positioning algorithm was proposed based on the fusion of triple-differential carrier phase measurements and time difference of arrival (TDoA) positioning.Considering that the time-varying clock offsets between wireless access points lead to lower positioning accuracy, the measurements from a reference terminal were used to eliminate the influence of time-varying clock offsets.The relative positions were estimated based on triple-differential carrier phase measurements, which were fused with unbiased differential TDoA positioning results to obtain the interim estimated positions.Furthermore, the carrier phase observation equations were linearized by Taylor expansion method, and the high-accuracy positioning was realized by solving the integer ambiguities.Simulation results show that the proposed algorithm eliminates the influence of time-varying clock offsets on positioning performance, and the integer ambiguities are resolved in a short time to achieve high-accuracy positioning.

    Text coverless information hiding method based on synonyms expansion and label delivery mechanism
    Zhen ZHANG, Jiaming NI, Ye YAO, Lichun GONG, Yujuan WANG, Guohua WU
    2021, 42(9):  173-183.  doi:10.11959/j.issn.1000-436x.2021139
    Asbtract ( 221 )   HTML ( 21)   PDF (897KB) ( 462 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To solve the problems of low hiding capacity and weak detection resistance, a method of coverless information hiding based on synonyms expansion and label delivery mechanism was proposed.To begin the proposed method, the secret information were divided into several keywords, then those keywords were embedded in different carrier texts respectively.Considering the interchangeability of synonyms in Chinese, using the word similarity calculation method based on HowNet,it was possible to filter synonyms which met the contextual semantics.For the purpose of increasing hiding capacity, various keywords or their synonyms were embedded in the same carrier text as much as possible.At the same moment, when recording the positional parameters of the secret information in each carrier text, those parameters were converted into a binary sequence in a fixed format, which was used to generate carrier text.Finally, the carrier texts and generated text were sent to the receiver.Comparison of the results with those of other studies confirm that the proposed method not only makes great improvement in hiding capacity and detection resistance, but also reduces the overhead of establishing and maintaining databases by using small text database.

    DNN-based Sub-6 GHz assisted millimeter wave network power allocation algorithm
    Changyin SUN, Liyan LIU, Fan JIANG, Jing JIANG
    2021, 42(9):  184-193.  doi:10.11959/j.issn.1000-436x.2021170
    Asbtract ( 240 )   HTML ( 25)   PDF (817KB) ( 368 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aimed at the problems of the signaling cost and power consumption in the power control measurement of the millimeter wave system, as well as the complexity caused by iteration operations, a millimeter wave link power allocation prediction algorithm using the Sub-6 GHz frequency band was proposed.Firstly, the mapping between the Sub-6 GHz band channel information and the optimal power allocation of the millimeter wave band was analyzed.Then, a deep neural network (DNN) model was utilized to realize this mapping function.To predict the power allocation of millimeter wave channel with Sub-6 GHz channel as input, the neural network was trained with the weighted mean square error minimization method (WMMSE) as the supervisor in different scenarios.The simulation results show that compared with the WMMSE algorithm in millimeter wave band, the proposed algorithm can obtain more than 97% of its sum-rate performance while taking less than 0.1% of the time.

    Interference detection and diversity suppression algorithm of OFDM system under partial-band jamming
    Guo LI, Ni WEN, Fengkui GONG, Jian ZHANG, Sihan ZHANG
    2021, 42(9):  194-204.  doi:10.11959/j.issn.1000-436x.2021173
    Asbtract ( 294 )   HTML ( 35)   PDF (1283KB) ( 515 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the currently widely-used OFDM system, which greatly improved the communication performance under the condition of partial-band jamming, an interference detection algorithm based on FCVE and an interference suppression algorithm based on frequency diversity were proposed.The threshold factor formula of FCVE algorithm was derived theoretically, and the interference detection threshold was calculated by using the threshold factor and the variance of the received signal, so as to achieve the interference detection with high accuracy.The simulation results show that the proposed FCVE algorithm significantly improves the interference detection probability of the classical FCME algorithm under the condition of high signal to interference ratio (SIR).Further, the interference can be greatly suppressed based on the idea of frequency diversity with the result of interference detection.The simulation results show that the bit error rate of the system can be reduced by two orders of magnitude under the same SIR.

    Comprehensive Reviews
    Survey on reinforcement learning based adaptive bit rate algorithm for mobile video streaming services
    Li’na DU, Li ZHUO, Shuo YANG, Jiafeng LI, Jing ZHANG
    2021, 42(9):  205-217.  doi:10.11959/j.issn.1000-436x.2021178
    Asbtract ( 520 )   HTML ( 48)   PDF (972KB) ( 723 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In recent years, with the continuous release of HTTP adaptive streaming (HAS) video datasets and network trace datasets, the machine learning methods, such as deep learning and reinforcement learning, have been continuously applied to adaptive bit rate (ABR) algorithms, which obtain the optimal strategy of rate control through interactive learning, and achieve superior performance that surpasses the traditional heuristic methods.Based on the analysis of the research difficulties of ABR algorithms, the research advances of ABR algorithms based on reinforcement learning (including deep reinforcement learning) was investigated.Furthermore, several representative HAS video datasets and network trace datasets were summarized, the evaluation metrics of the performance were depicted.Finally, the existing problems and the future tendency of ABR research were discussed.

    Review on autoencoder and its application
    Jie LAI, Xiaodan WANG, Qian XIANG, Yafei SONG, Wen QUAN
    2021, 42(9):  218-230.  doi:10.11959/j.issn.1000-436x.2021160
    Asbtract ( 1155 )   HTML ( 130)   PDF (792KB) ( 1483 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    As a typical deep unsupervised learning model, autoencoder can automatically learn effective abstract features from unlabeled samples.In recent years, autoencoder has been widely used in target recognition, intrusion detection, fault diagnosis and many other fields.Thus, the theoretical basis, improved methods, application fields and research directions of autoencoder were described and summarized comprehensively.At first, the network structure, theoretical derivation and algorithm flow of traditional autoencoder were introduced and analyzed, and the difference between autoencoder and other unsupervised learning algorithms was compared.Then, common improved autoencoders were discussed, and their innovation, improvement methods and relative merits were analyzed.Next, the practical application status of autoencoder in target recognition, intrusion detection and other fields were introduced.At last, the existing problems of autoencoder were summarized, and the possible research directions were prospected.

    Correspondences
    Formal modeling and security analysis method of security protocol based on CPN
    Xiang GONG, Tao FENG, Jinze DU
    2021, 42(9):  240-253.  doi:10.11959/j.issn.1000-436x.2021175
    Asbtract ( 269 )   HTML ( 32)   PDF (28786KB) ( 200 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To solve the problem of modeling and analyzing with colored Petri net (CPN), which was determining vulnerabilities in hole location but couldn’t identify any attack path, and the problem of when the introduction of the attacker model, the number of possible message paths in the CPN formal model of security protocol surges the state space prone to explosion, which made it difficult to extract accurate attack paths, the formal modeling method of security protocol was improved base on CPN, the attack paths were verified and extracted, further the fine-grained protocol modeling and control were adopted.As well as in the aspect of state-space convergence, and a waiting-sync method for different processes of CPN model in each hierarchy model was proposed, which effectively controlled the state-space scale of the model.Through the security evaluation and analysis of TMN protocol, 25 attack paths of the protocol are extracted successfully, the security of the protocol is evaluated, and the effectiveness of the proposed method is proved.

Copyright Information
Authorized by: China Association for Science and Technology
Sponsored by: China Institute of Communications
Editor-in-Chief: Zhang Ping
Associate Editor-in-Chief:
Zhang Yanchuan, Ma Jianfeng, Yang Zhen, Shen Lianfeng, Tao Xiaofeng, Liu Hualu
Editorial Director: Wu Nada, Zhao Li
Address: F2, Beiyang Chenguang Building, Shunbatiao No.1 Courtyard, Fengtai District, Beijing, China
Post: 100079
Tel: 010-53933889、53878169、
53859522、010-53878236
Email: xuebao@ptpress.com.cn
Email: txxb@bjxintong.com.cn
ISSN 1000-436X
CN 11-2102/TN
Visited
Total visitors:
Visitors of today:
Now online: