Ruoting Xiong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ruoting Xiong has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Wei Ren
China University of Geosciences
8 shared publications - Yi Ren
University of East Anglia
4 shared publications - Gerard Parr
University of East Anglia
3 shared publications - Jingjing Hu
China Electronic Product Reliability and Environmental Testing Research Institute, Guangzhou, China
2 shared publications - Ping Chen
China Electronic Product Reliability and Environmental Testing Research Institute, Guangzhou, China
2 shared publications - Zhitao Wu
CEPREI, Jinan University, Guangzhou 510632, China
2 shared publications
Latest Publications
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Green Communications and Networking
- Vol. 10, 4392-4407
Securing FL-Enabled NWDAF in Private 5G Networks Against Hybrid Attacks
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Green Communications and Networking
- Vol. 10, 4392-4407
Securing FL-Enabled NWDAF in Private 5G Networks Against Hybrid Attacks
- Open Access
- 5 November 2025
- Published by Elsevier in Blockchain: Research and Applications
- Vol. 8 (1)
Next one: Predicting the future transaction of illicit addresses in the Bitcoin transaction network by a graph neural network
- 5 November 2025
- Published by Elsevier in Blockchain: Research and Applications
- Vol. 8 (1)
Open AccessNext one: Predicting the future transaction of illicit addresses in the Bitcoin transaction network by a graph neural network
- Open Access
- 13 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Performance and Viability Analysis of Deploying Cloud-native 5G Autoscaling Platforms
5G mobile network technology is undergoing rapid deployment. Autoscaling in 5G refers to the dynamic allocation and removal of network functions based on real-time service demand. It provides additional capacity to serve new users, while avoiding the risk of excessive costs. In this paper, we compare two stateless 5G autoscaling platforms: CoreKube and free5GC-helm, both deployed on the Hetzner Cloud platform. We utilize PacketRusher to generate high load for autoscaling evaluation, and collect metrics for analysis. Additionally, we analyze the bottleneck and autoscaling problem of free5GC-helm, providing guidance for real-world deployment. Our investigation revealed that the free5GC-helm scaling mechanism quickly encounters bottlenecks, primarily due to decisions made within the network repository function.
- 13 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Open AccessPerformance and Viability Analysis of Deploying Cloud-native 5G Autoscaling Platforms
5G mobile network technology is undergoing rapid deployment. Autoscaling in 5G refers to the dynamic allocation and removal of network functions based on real-time service demand. It provides additional capacity to serve new users, while avoiding the risk of excessive costs. In this paper, we compare two stateless 5G autoscaling platforms: CoreKube and free5GC-helm, both deployed on the Hetzner Cloud platform. We utilize PacketRusher to generate high load for autoscaling evaluation, and collect metrics for analysis. Additionally, we analyze the bottleneck and autoscaling problem of free5GC-helm, providing guidance for real-world deployment. Our investigation revealed that the free5GC-helm scaling mechanism quickly encounters bottlenecks, primarily due to decisions made within the network repository function.
- 4 December 2024
- Published by Elsevier in Future Generation Computer Systems
- Vol. 166
A sampling-based acceleration method for heterogeneous chiplet NoC simulations
- 4 December 2024
- Published by Elsevier in Future Generation Computer Systems
- Vol. 166
A sampling-based acceleration method for heterogeneous chiplet NoC simulations
- Open Access
- 29 February 2024
- Published by Wiley in Journal of Electrical and Computer Engineering
- Vol. 2024, 1-6
The Formal Analysis on Negative Information Selections for Privacy Protection in Data Publishing
Negative information selection is an approach to protect the privacy by using negative information to replace original information. In this paper, we prove some bounds for negative information selection. Those bounds reveal the privacy protection strength of quantitative probability analysis. We also analyzed the reconstruction probability of original information from available negative information. The formal analysis can specify the bound on the strength of security and utility for negative information selection. Besides, we simulate brute force attacks under different data leakage ratios. Specifically, we calculate the attacker’s guess times before and after the data leakage. Experimental results indicate that the data leakage of over 30% can put the original information in a dangerous situation. Furthermore, we found that the leakage possibility has little relevance to the number of elements in the full set, but it is influenced by the ratio of the leaked information.
- 29 February 2024
- Published by Wiley in Journal of Electrical and Computer Engineering
- Vol. 2024, 1-6
Open AccessThe Formal Analysis on Negative Information Selections for Privacy Protection in Data Publishing
Negative information selection is an approach to protect the privacy by using negative information to replace original information. In this paper, we prove some bounds for negative information selection. Those bounds reveal the privacy protection strength of quantitative probability analysis. We also analyzed the reconstruction probability of original information from available negative information. The formal analysis can specify the bound on the strength of security and utility for negative information selection. Besides, we simulate brute force attacks under different data leakage ratios. Specifically, we calculate the attacker’s guess times before and after the data leakage. Experimental results indicate that the data leakage of over 30% can put the original information in a dangerous situation. Furthermore, we found that the leakage possibility has little relevance to the number of elements in the full set, but it is influenced by the ratio of the leaked information.
- Open Access
- 2 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-2
From 5G to 6G: It is Time to Sniff the Communications between a Base Station and Core Networks
Thanks to mobility and large coverage, 6G mobile networks introduce satellites and unmanned aerial vehicles as aerial base stations (ABS) in the 6G era. Instead of using a wired backhaul in 5G and its predecessor, an ABS leverages a wireless channel to a core network (CN). However, such a wireless channel design introduces new security challenges. In this paper, we present that passive attackers could sniff the ABS-CN wireless channel and identify what users are doing based on deep learning methods. We collect GTP protocol data on our testbed and use convolutional neural networks to classify 5 types of encrypted App traffic, like IG and TikTok. Experiment results proved the effectiveness of the proposed method, revealing the confidential data leakage problem on the 6G wireless ABS-CN channel.
- 2 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-2
Open AccessFrom 5G to 6G: It is Time to Sniff the Communications between a Base Station and Core Networks
Thanks to mobility and large coverage, 6G mobile networks introduce satellites and unmanned aerial vehicles as aerial base stations (ABS) in the 6G era. Instead of using a wired backhaul in 5G and its predecessor, an ABS leverages a wireless channel to a core network (CN). However, such a wireless channel design introduces new security challenges. In this paper, we present that passive attackers could sniff the ABS-CN wireless channel and identify what users are doing based on deep learning methods. We collect GTP protocol data on our testbed and use convolutional neural networks to classify 5 types of encrypted App traffic, like IG and TikTok. Experiment results proved the effectiveness of the proposed method, revealing the confidential data leakage problem on the 6G wireless ABS-CN channel.
- 10 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (24) , 22581-22590
BDIM: A Blockchain-Based Decentralized Identity Management Scheme for Large Scale Internet of Things
In large-scale Internet of Things, centralized authentication imposes several critical challenges in terms of vast identity management, authentication overhead, and single point of failure. Distributed identity management has been envisioned as a promising approach for mitigating above all, but the security and performance of the overall solution have not been extensively evaluated. In this paper, we proposed a decentralized identity management scheme based on blockchain for tackling large-scale Internet of Things such as VANET. We implement smart contracts to support large-scale user access control, together with design trust management methods for reputation evaluation and credit penalty mechanisms, which can prevent various types of attacks in distributed identification contexts. The experiment results and analysis justified that our scheme is scalable with good performance. Specifically, the system response is on a millisecond scale and all the functions consume within 250ms. Also, the time consumption of the query maintains a manageable delay within 0.5ms no matter the remarkable growth of users. Finally, we observe that the throughput of the current blockchain platform could meet the requirement of our scheme with the increasing number of users’ upload request in real-world simulation.
- 10 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (24) , 22581-22590
BDIM: A Blockchain-Based Decentralized Identity Management Scheme for Large Scale Internet of Things
In large-scale Internet of Things, centralized authentication imposes several critical challenges in terms of vast identity management, authentication overhead, and single point of failure. Distributed identity management has been envisioned as a promising approach for mitigating above all, but the security and performance of the overall solution have not been extensively evaluated. In this paper, we proposed a decentralized identity management scheme based on blockchain for tackling large-scale Internet of Things such as VANET. We implement smart contracts to support large-scale user access control, together with design trust management methods for reputation evaluation and credit penalty mechanisms, which can prevent various types of attacks in distributed identification contexts. The experiment results and analysis justified that our scheme is scalable with good performance. Specifically, the system response is on a millisecond scale and all the functions consume within 250ms. Also, the time consumption of the query maintains a manageable delay within 0.5ms no matter the remarkable growth of users. Finally, we observe that the throughput of the current blockchain platform could meet the requirement of our scheme with the increasing number of users’ upload request in real-world simulation.
- Open Access
- 17 March 2023
- Published by Association for Computing Machinery (ACM)
- p. 49-53
MergeTree: a Tree Model with Merged Nodes for Threat Induction
Threat tree model can clearly organize threat induction information and thus is widely used for risk analysis in software assurance. Threat tree will grow to complicated structures, e.g., the number of nodes and branches, when the threat information grows to a huge volume. To extend the scalability of the threat tree model, we propose a tree model with merged nodes so as to largely decrease the number of nodes and branches. The formal model and dedicated algorithms are proposed in details. The experimental results show the practicality of MergeTree. We also formally analyze the soundness and completeness of the proposed model.
- 17 March 2023
- Published by Association for Computing Machinery (ACM)
- p. 49-53
Open AccessMergeTree: a Tree Model with Merged Nodes for Threat Induction
Threat tree model can clearly organize threat induction information and thus is widely used for risk analysis in software assurance. Threat tree will grow to complicated structures, e.g., the number of nodes and branches, when the threat information grows to a huge volume. To extend the scalability of the threat tree model, we propose a tree model with merged nodes so as to largely decrease the number of nodes and branches. The formal model and dedicated algorithms are proposed in details. The experimental results show the practicality of MergeTree. We also formally analyze the soundness and completeness of the proposed model.