Xun Xiao
Research Subjects
Xun Xiao has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
Artur Hecker
Munich Research Center, Huawei Technologies, Munich, Germany
2 shared publications- Hassan Nassar
Department of Computer Science, Karlsruhe Institute of Technology
2 shared publications - Jeferson Gonzalez-Gomez
Costa Rica Institute of Technology
2 shared publications - Jorg Henkel
Karlsruhe Institute of Technology (KIT), Chair for Embedded Systems (CES), Karlsruhe, Germany
2 shared publications - Osama Abboud
Munich Research Center, Huawei Technologies, Germany
2 shared publications Fengyang Guo
Munich Research Center, Huawei Technologies, Munich, Germany
1 shared publication
Latest Publications
- Open Access
- 25 April 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Cyber-Physical Systems
- Vol. 10 (4) , 1-23
LightFAt+: Lightweight Control-flow Attestation via Unsupervised Machine Learning
As computational devices continue to evolve, an increasing number of applications are being run remotely. These applications span a broad range of devices, from low-capability IoT nodes to high-capability large cloud providers. Remote execution often involves handling sensitive data or running proprietary software, raising the challenge of ensuring uncompromised code execution. Remote Attestation addresses this challenge by verifying the integrity of the code through the calculation of a potentially extensive sequence of cryptographic hash values. However, this computation can lead to a control flow explosion due to variable loop bounds, which renders traditional Control-Flow attestation schemes impractical for complex real-world applications. In this work, we introduce LightFAt+, a Light weight Control- F low At testation scheme. Rather than relying on the costly computation of cryptographic hashes, LightFAt+ utilizes readings from the processor’s Performance Monitoring Unit (PMU) together with lightweight unsupervised Machine Learning (ML) classifiers. This approach allows LightFAt+ to detect whether a target application’s control flow has been compromised, thereby enhancing the system’s security. From the prover’s perspective, LightFAt+ incurs significantly lower overhead than other state-of-the-art control-flow attestation solutions. More importantly, from the verifier’s perspective, LightFAt+ achieves a detection accuracy of over 95%, with low false-negative and false-positive rates, as well as very fast inference times when applied to real-world applications and reference (benchmark) programs.
- 25 April 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Cyber-Physical Systems
- Vol. 10 (4) , 1-23
Open AccessLightFAt+: Lightweight Control-flow Attestation via Unsupervised Machine Learning
As computational devices continue to evolve, an increasing number of applications are being run remotely. These applications span a broad range of devices, from low-capability IoT nodes to high-capability large cloud providers. Remote execution often involves handling sensitive data or running proprietary software, raising the challenge of ensuring uncompromised code execution. Remote Attestation addresses this challenge by verifying the integrity of the code through the calculation of a potentially extensive sequence of cryptographic hash values. However, this computation can lead to a control flow explosion due to variable loop bounds, which renders traditional Control-Flow attestation schemes impractical for complex real-world applications. In this work, we introduce LightFAt+, a Light weight Control- F low At testation scheme. Rather than relying on the costly computation of cryptographic hashes, LightFAt+ utilizes readings from the processor’s Performance Monitoring Unit (PMU) together with lightweight unsupervised Machine Learning (ML) classifiers. This approach allows LightFAt+ to detect whether a target application’s control flow has been compromised, thereby enhancing the system’s security. From the prover’s perspective, LightFAt+ incurs significantly lower overhead than other state-of-the-art control-flow attestation solutions. More importantly, from the verifier’s perspective, LightFAt+ achieves a detection accuracy of over 95%, with low false-negative and false-positive rates, as well as very fast inference times when applied to real-world applications and reference (benchmark) programs.
- Open Access
- 26 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 24 (5s) , 1-24
DPReF: Decentralized Key Generation Using Physical-Related Functions
Physical Unclonable Functions (PUFs) serve as a lightweight source to generate cryptographic keys utilizing the inherent physical device properties, making them particularly suitable for resource-constrained environments such as Internet of Things (IoT) devices. Recently, Physical-Related Functions (PReFs) extended PUFs to enable multiple devices to generate similar keys without the need to exchange or store them, improving security. However, state-of-the-art PReF implementations rely on a Trusted Third Party (TTP) to identify relative challenges, introducing a potential vulnerability if the TTP is compromised. In this work, we propose the first decentralized PReF protocol, removing reliance on the TTP and mitigating associated security risks. The proposed protocol allows relative challenges to be identified directly between devices in a decentralized manner. Additionally, we formalize a mathematical model to estimate the minimum number of devices required to build a network, based on the sizes of the PUF and the shared Challenge-Response Pair (CRP).. We demonstrate the generality of our model by verifying it across different types of state-of-the-art PUFs (Arbiter-based Non-Volatile Memory PUF (ANV-PUF) and Pseudo Linear Feedback Shift Register PUF (PLPUF).). We establish a 128 bit cryptographic key using the proposed protocol that matches the state-of-the-art but in a decentralized manner. Moreover, we prove that our protocol can be used to construct hardware-assisted attestation networks using ANV-PUF and PLPUF implementations with a shared secret of 16 bit that allows for both integrity and identity verification.
- 26 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 24 (5s) , 1-24
Open AccessDPReF: Decentralized Key Generation Using Physical-Related Functions
Physical Unclonable Functions (PUFs) serve as a lightweight source to generate cryptographic keys utilizing the inherent physical device properties, making them particularly suitable for resource-constrained environments such as Internet of Things (IoT) devices. Recently, Physical-Related Functions (PReFs) extended PUFs to enable multiple devices to generate similar keys without the need to exchange or store them, improving security. However, state-of-the-art PReF implementations rely on a Trusted Third Party (TTP) to identify relative challenges, introducing a potential vulnerability if the TTP is compromised. In this work, we propose the first decentralized PReF protocol, removing reliance on the TTP and mitigating associated security risks. The proposed protocol allows relative challenges to be identified directly between devices in a decentralized manner. Additionally, we formalize a mathematical model to estimate the minimum number of devices required to build a network, based on the sizes of the PUF and the shared Challenge-Response Pair (CRP).. We demonstrate the generality of our model by verifying it across different types of state-of-the-art PUFs (Arbiter-based Non-Volatile Memory PUF (ANV-PUF) and Pseudo Linear Feedback Shift Register PUF (PLPUF).). We establish a 128 bit cryptographic key using the proposed protocol that matches the state-of-the-art but in a decentralized manner. Moreover, we prove that our protocol can be used to construct hardware-assisted attestation networks using ANV-PUF and PLPUF implementations with a shared secret of 16 bit that allows for both integrity and identity verification.
- 23 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 17 (2) , 392-405
Accelerating Tip Selection in Burst Message Arrivals for DAG-Based Blockchain Systems
Blockchain systems (e.g., IOTA) use Directed Acyclic Graph (DAG) topology to organize its ledger records. A new message is added by attaching to the tips selected from the DAG. For tip selection, a stochastic approach is widely used, where a random walk is simulated until it ends at a tip of the DAG. Prior art intensively focused on the fairness and security issues of this random walk approach. However, its computational efficiency issue was largely neglected. This paper reports that under a burst message arrival condition, the random walk approach, even with parallelization, will suffer from severe delays. To solve this problem, this paper proposes a new approach inspired by Absorbing Markov chain (AMC) theory. Specifically, the new approach first periodically calculates a tip selection probability distribution (TSPD) of the DAG ledger. With this information, a processing node only needs to do sampling from the calculated TSPD, which significantly accelerates the tip selection process. Rigorous theoretical complexity analysis is provided; in addition, the approach is compared with both single- and multi-processing random walk schemes. Evaluation results confirm the key findings and demonstrate the benefits of the solution.
- 23 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 17 (2) , 392-405
Accelerating Tip Selection in Burst Message Arrivals for DAG-Based Blockchain Systems
Blockchain systems (e.g., IOTA) use Directed Acyclic Graph (DAG) topology to organize its ledger records. A new message is added by attaching to the tips selected from the DAG. For tip selection, a stochastic approach is widely used, where a random walk is simulated until it ends at a tip of the DAG. Prior art intensively focused on the fairness and security issues of this random walk approach. However, its computational efficiency issue was largely neglected. This paper reports that under a burst message arrival condition, the random walk approach, even with parallelization, will suffer from severe delays. To solve this problem, this paper proposes a new approach inspired by Absorbing Markov chain (AMC) theory. Specifically, the new approach first periodically calculates a tip selection probability distribution (TSPD) of the DAG ledger. With this information, a processing node only needs to do sampling from the calculated TSPD, which significantly accelerates the tip selection process. Rigorous theoretical complexity analysis is provided; in addition, the approach is compared with both single- and multi-processing random walk schemes. Evaluation results confirm the key findings and demonstrate the benefits of the solution.
- 19 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (2) , 1259-1273
A Theoretical Model Characterizing Tangle Evolution in IOTA Blockchain Network
IOTA blockchain system is lightweight without heavy proof-of-work mining phases, which is considered a promising service platform of Internet-of-Things applications. IOTA organizes ledger data in a directed acyclic graph (DAG), called Tangle, rather a chain structure as in traditional blockchains. With arriving messages, IOTA tangle grows in a special way, as multiple messages can be attached to the tangle at different locations in parallel. Hence, the network dynamics of an operational IOTA system would justify a thorough study, which is currently unexplored in the literature. In this paper, we present the first theoretical modeling for the evolving IOTA tangle based on stochastic analysis. After analyzing snapshots of the real-world IOTA ledger data, our key finding suggests that IOTA tangle follows a rather atypical double Pareto Lognormal (dPLN) degree distribution. In contrast, typical power-law and exponential distributions do not accurately reflect the fact. For model parameter estimation, we further realize that using generic optimization solvers cannot yield quality fitting results. Thus, we design an alternative algorithm based on Expectation-Maximization (EM) framework. We evaluate the proposed model and fitting algorithm with official data provided by IOTA Foundation. Quantitative comparisons confirm the fitting quality of our proposed model and algorithm. The whole analysis reveals a deeper understanding of the internal mechanism of IOTA network.
- 19 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (2) , 1259-1273
A Theoretical Model Characterizing Tangle Evolution in IOTA Blockchain Network
IOTA blockchain system is lightweight without heavy proof-of-work mining phases, which is considered a promising service platform of Internet-of-Things applications. IOTA organizes ledger data in a directed acyclic graph (DAG), called Tangle, rather a chain structure as in traditional blockchains. With arriving messages, IOTA tangle grows in a special way, as multiple messages can be attached to the tangle at different locations in parallel. Hence, the network dynamics of an operational IOTA system would justify a thorough study, which is currently unexplored in the literature. In this paper, we present the first theoretical modeling for the evolving IOTA tangle based on stochastic analysis. After analyzing snapshots of the real-world IOTA ledger data, our key finding suggests that IOTA tangle follows a rather atypical double Pareto Lognormal (dPLN) degree distribution. In contrast, typical power-law and exponential distributions do not accurately reflect the fact. For model parameter estimation, we further realize that using generic optimization solvers cannot yield quality fitting results. Thus, we design an alternative algorithm based on Expectation-Maximization (EM) framework. We evaluate the proposed model and fitting algorithm with official data provided by IOTA Foundation. Quantitative comparisons confirm the fitting quality of our proposed model and algorithm. The whole analysis reveals a deeper understanding of the internal mechanism of IOTA network.
- 23 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (5) , 3901-3916
Accelerating Industrial IoT Acoustic Data Separation With In-Network Computing
Acoustic data from the Industrial Internet of Things (IIoT) are widely used in anomaly detection because audio information reflects richer internal statuses of monitored working machines than the video does. Since multiple acoustic data sources interfere with each other by nature, source data estimation is a prerequisite of subsequent anomaly detection. Existing schemes often use a centralized manner to separate full data on a remote node in clouds. However, such a centralized manner may delay reactions to anomalies due to data transmission delay and the complexity of solving data separation problems. This article shows that the data separation phase can be substantially accelerated with an in-network computing approach. The key idea is to offload data processing jobs to intermediate network nodes along the forwarding path. We first propose a distributed algorithm so that the data separation jobs can be done in a progressive manner; likewise, we modify the forwarding layer in order to eliminate hop-by-hop data transmission delay that hurts the performance of using in-network computing. We further derive theoretical upper and lower bounds of the required number of intermediate nodes that achieve the maximum acceleration. We also implement our proposed solution in a full-stack network emulator. Based on an open and professional data set, evaluation results justify the feasibility and advantages of our idea with nearly 32.18% acceleration on total processing time. This work exemplifies the convergence of IIoT, edge, and clouds.
- 23 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (5) , 3901-3916
Accelerating Industrial IoT Acoustic Data Separation With In-Network Computing
Acoustic data from the Industrial Internet of Things (IIoT) are widely used in anomaly detection because audio information reflects richer internal statuses of monitored working machines than the video does. Since multiple acoustic data sources interfere with each other by nature, source data estimation is a prerequisite of subsequent anomaly detection. Existing schemes often use a centralized manner to separate full data on a remote node in clouds. However, such a centralized manner may delay reactions to anomalies due to data transmission delay and the complexity of solving data separation problems. This article shows that the data separation phase can be substantially accelerated with an in-network computing approach. The key idea is to offload data processing jobs to intermediate network nodes along the forwarding path. We first propose a distributed algorithm so that the data separation jobs can be done in a progressive manner; likewise, we modify the forwarding layer in order to eliminate hop-by-hop data transmission delay that hurts the performance of using in-network computing. We further derive theoretical upper and lower bounds of the required number of intermediate nodes that achieve the maximum acceleration. We also implement our proposed solution in a full-stack network emulator. Based on an open and professional data set, evaluation results justify the feasibility and advantages of our idea with nearly 32.18% acceleration on total processing time. This work exemplifies the convergence of IIoT, edge, and clouds.