Ruoting Xiong

Ruoting Xiong

Auto-generated profile, based on publicly available information

Ruoting Xiong

University of East Anglia

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 August 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
RXRuoting Xiong
Ruoting Xiong
WRWei Ren
Wei Ren
XHXiaohan Hao
Xiaohan Hao
JHJie He
Jie He
KCKim-Kwang Raymond Choo
Kim-Kwang Raymond Choo
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.

4 December 2024 in Future Generation Computer Systems
Verified
Journal Article
Closed access
RXRuoting Xiong
Ruoting Xiong
WRWei Ren
Wei Ren
CZChengzhuo Zhang
Chengzhuo Zhang
TLTao Li
Tao Li
GMGeyong Min
Geyong Min

2 October 2023
Verified
Conference Paper
Open access
RXRuoting Xiong
Ruoting Xiong
KTKit-Lun Tong
Kit-Lun Tong
YRYi Ren
Yi Ren
WRWei Ren
Wei Ren
GPGerard Parr
Gerard Parr
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.

13 October 2025
Verified
Conference Paper
Open access
AYAmber Yucebas
Amber Yucebas
RXRuoting Xiong
Ruoting Xiong
YRYi Ren
Yi Ren
XZXu Zhang
Xu Zhang
GPGerard Parr
Gerard Parr
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.

29 February 2024 in Journal of Electrical and Computer Engineering
Verified
Journal Article
Open access
PDF file
PCPing Chen
Ping Chen
JHJingjing Hu
Jingjing Hu
ZWZhitao Wu
Zhitao Wu
RXRuoting Xiong
Ruoting Xiong
WRWei Ren
Wei Ren
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.

1 January 2026 in IEEE Transactions on Instrumentation and Measurement
Verified
Journal Article
Closed access
RXRuoting Xiong
Ruoting Xiong
YRYi Ren
Yi Ren
XSXin Shi
Xin Shi
WRWei Ren
Wei Ren
GPGerard Parr
Gerard Parr