Anxiao He
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Anxiao He has a total of 50 co-authors. Here are the top co-authors by number of shared publications:
- Kai Bu
Zhejiang University, Hangzhou, China
4 shared publications - Kui Ren
Zhejiang University
4 shared publications - Qian-Ping Gu
Simon Fraser University
3 shared publications - Yixin Sun
University of Virginia, Charlottesville, Virginia, USA
2 shared publications - Yizhe Zhang
University of Virginia, Charlottesville, VA, USA
2 shared publications - Adrian Perrig
ETH Zurich, Zurich, Switzerland
1 shared publication
Latest Publications
- Open Access
- 2 September 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 4 (CoNEXT3) , 1-25
Constructing a High-precision and Semantically Rich BGP Community Dictionary via Large Language Models (LLMs)
BGP communities are essential for inter-domain routing control, but their semantics are often buried in noisy, unstructured operator documentation. Manual inspection and annotation is an laborious process that does not scale. Meanwhile, existing automated methods, mainly relying on regular expressions, cannot reliably interpret semantic meaning or handle placeholder-style formats. We develop an LLM-based framework for extracting high-precision BGP community semantics from heterogeneous operator documentation. Our framework combines format-aware preprocessing to filter community-relevant content from noisy operator documents, schema-guided extraction to generate structured output, and consensus-based aggregation across models to mitigate hallucinations and false extractions. Using a manually-annotated benchmark dataset containing 9,244 community value–meaning pairs, our framework achieves 85-99% precision across different extraction tasks and substantially outperforms prior state-of-the-art methods on placeholder communities and preserving semantic accuracy. Using our framework, we construct one of the largest open-access available BGP community dictionaries, containing more than 29.9K semantically annotated communities across 766 ASes. Finally, we perform the first large-scale analysis of semantic variability in operator-defined BGP communities using our dictionary. We release our code, benchmark, and constructed dictionary to support future research.
- 2 September 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 4 (CoNEXT3) , 1-25
Open AccessConstructing a High-precision and Semantically Rich BGP Community Dictionary via Large Language Models (LLMs)
BGP communities are essential for inter-domain routing control, but their semantics are often buried in noisy, unstructured operator documentation. Manual inspection and annotation is an laborious process that does not scale. Meanwhile, existing automated methods, mainly relying on regular expressions, cannot reliably interpret semantic meaning or handle placeholder-style formats. We develop an LLM-based framework for extracting high-precision BGP community semantics from heterogeneous operator documentation. Our framework combines format-aware preprocessing to filter community-relevant content from noisy operator documents, schema-guided extraction to generate structured output, and consensus-based aggregation across models to mitigate hallucinations and false extractions. Using a manually-annotated benchmark dataset containing 9,244 community value–meaning pairs, our framework achieves 85-99% precision across different extraction tasks and substantially outperforms prior state-of-the-art methods on placeholder communities and preserving semantic accuracy. Using our framework, we construct one of the largest open-access available BGP community dictionaries, containing more than 29.9K semantically annotated communities across 766 ASes. Finally, we perform the first large-scale analysis of semantic variability in operator-defined BGP communities using our dictionary. We release our code, benchmark, and constructed dictionary to support future research.
- 6 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (3) , 6183-6195
SwiftOracle: Orthogonality-Driven Private Multipath Validation
Path validation enables end-hosts to regulate and verify packet forwarding that otherwise remains transparent in the current internet architecture. It promises various guarantees in security and privacy for internet users. Recent advances in path validation start to secure multipath routing and protect path privacy. However, state-of-the-art private multipath validation limit in efficiency and may not apply to relatively large networks due to impractically long proofs. In this paper, we propose SwiftOracle that leverages orthogonality to achieve efficient private multipath validation. SwiftOracle uses orthogonal vectors as alternative keys; this enables much efficient proof computation. To protect path privacy, SwiftOracle only allows each router to know limited neighborship information. Furthermore, we develop constant-size proofs for SwiftOracle to guarantee scalability in large-scale networks. We implement SwiftOracle using DPDK and evaluate its performance in comparison with state-of-the-art VALNET. The results show that SwiftOracle can deliver 6$\times$ faster computation speed, support at least 4$\times$ larger network scale with more intricate topologies, and yield over 21$\times$ higher throughput on average.
- 6 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (3) , 6183-6195
SwiftOracle: Orthogonality-Driven Private Multipath Validation
Path validation enables end-hosts to regulate and verify packet forwarding that otherwise remains transparent in the current internet architecture. It promises various guarantees in security and privacy for internet users. Recent advances in path validation start to secure multipath routing and protect path privacy. However, state-of-the-art private multipath validation limit in efficiency and may not apply to relatively large networks due to impractically long proofs. In this paper, we propose SwiftOracle that leverages orthogonality to achieve efficient private multipath validation. SwiftOracle uses orthogonal vectors as alternative keys; this enables much efficient proof computation. To protect path privacy, SwiftOracle only allows each router to know limited neighborship information. Furthermore, we develop constant-size proofs for SwiftOracle to guarantee scalability in large-scale networks. We implement SwiftOracle using DPDK and evaluate its performance in comparison with state-of-the-art VALNET. The results show that SwiftOracle can deliver 6$\times$ faster computation speed, support at least 4$\times$ larger network scale with more intricate topologies, and yield over 21$\times$ higher throughput on average.
- Open Access
- 27 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 720-741
Scaling SCIERA: A Journey Through the Deployment of a Next-generation Network
- 27 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 720-741
Open AccessScaling SCIERA: A Journey Through the Deployment of a Next-generation Network
- 14 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 21 (4) , 2720-2734
SwiftParade: Anti-Burst Multipath Validation
Path validation promises a necessary security add-on for future Internet architectures. It authenticates not only source identities but also the exact path where a packet forwards through. This offers users more flexibility and reliability in network services. Most existing solutions focus on single-path validation that pre-correlates a packet to a specific forwarding path. However, parallel transmissions in multipath routing tend to induce bursty traffic that is hardly validated in time by existing solutions. In this paper, we present SwiftParade as the first attempt toward anti-burst multipath validation. It proposes a composite validation technique that can simultaneously validate a group of packets likely from multiple different paths. This helps to amortize the validation overhead across packets of the entire group instead of imposing the validation overhead equally on every packet. To implement composite validation, SwiftParade further explores a noncommutative homomorphic asymmetric encryption scheme. We prove effectiveness and security of SwiftParade through theoretical analysis. We also conduct extensive experiments to evaluate SwiftParade performance. The results show that SwiftParade offers high efficiency and applicability to multipath validation with complex routing topologies. In comparison with the state-of-the-art multipath validation solution—Atlas, SwiftParade speeds up packet processing by 2.5× $\sim 8.3\times$ and increases communication throughput by 2.8× $\sim 10.2\times$ .
- 14 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 21 (4) , 2720-2734
SwiftParade: Anti-Burst Multipath Validation
Path validation promises a necessary security add-on for future Internet architectures. It authenticates not only source identities but also the exact path where a packet forwards through. This offers users more flexibility and reliability in network services. Most existing solutions focus on single-path validation that pre-correlates a packet to a specific forwarding path. However, parallel transmissions in multipath routing tend to induce bursty traffic that is hardly validated in time by existing solutions. In this paper, we present SwiftParade as the first attempt toward anti-burst multipath validation. It proposes a composite validation technique that can simultaneously validate a group of packets likely from multiple different paths. This helps to amortize the validation overhead across packets of the entire group instead of imposing the validation overhead equally on every packet. To implement composite validation, SwiftParade further explores a noncommutative homomorphic asymmetric encryption scheme. We prove effectiveness and security of SwiftParade through theoretical analysis. We also conduct extensive experiments to evaluate SwiftParade performance. The results show that SwiftParade offers high efficiency and applicability to multipath validation with complex routing topologies. In comparison with the state-of-the-art multipath validation solution—Atlas, SwiftParade speeds up packet processing by 2.5× $\sim 8.3\times$ and increases communication throughput by 2.8× $\sim 10.2\times$ .
- 13 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 18 (15566013) , 1268-1282
Hummingbird: Dynamic Path Validation With Hidden Equal-Probability Sampling
Path validation has already been incrementally deployed in the Internet architecture. It secures packet forwarding by enabling end hosts to negotiate specific forwarding paths and enforcing on-path routers to prove their forwarding behaviors along these paths. Most existing path validation solutions target static paths, paying less attention to fully dynamic paths that support flexible routing. In this paper, we present Hummingbird as the first validation solution over fully dynamic paths. It features a hidden equal-probability sampling technique. Gaining efficiency via routers probabilistically sampling packets to validate, we craft the sampling probability such that each router validates a similar amount of packets given an unknown path length. We further hide the state of whether a packet has been sampled and validated using a lightweight, non-cryptographic scheme. This prevents attackers from differentiating and selectively mis-forwarding packets. We validate security and efficiency of Hummingbird through both theoretical proof and experimental evaluation.
- 13 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 18 (15566013) , 1268-1282
Hummingbird: Dynamic Path Validation With Hidden Equal-Probability Sampling
Path validation has already been incrementally deployed in the Internet architecture. It secures packet forwarding by enabling end hosts to negotiate specific forwarding paths and enforcing on-path routers to prove their forwarding behaviors along these paths. Most existing path validation solutions target static paths, paying less attention to fully dynamic paths that support flexible routing. In this paper, we present Hummingbird as the first validation solution over fully dynamic paths. It features a hidden equal-probability sampling technique. Gaining efficiency via routers probabilistically sampling packets to validate, we craft the sampling probability such that each router validates a similar amount of packets given an unknown path length. We further hide the state of whether a packet has been sampled and validated using a lightweight, non-cryptographic scheme. This prevents attackers from differentiating and selectively mis-forwarding packets. We validate security and efficiency of Hummingbird through both theoretical proof and experimental evaluation.
- 11 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 15 (15566013) , 3832-3847
Atomos: Constant-Size Path Validation Proof
Path validation has been explored as an indispensable security feature for the future Internet. Motivated by the Path-Aware Networking Research Group (PANRG) under the Internet Engineering Task Force (IETF) and Internet Research Task Force (IRTF), it gives end-hosts more control over packet forwarding and ensures that the forwarding history is verifiable. The main idea is to require that routers add proofs in packet headers for other routers to verify. We identify linear-scale proofs as the essential efficiency barrier of existing path validation solutions. In this paper, we propose Atomos to validate network paths with constant-size proofs. To this end, we construct a noncommutative homomorphic asymmetric-key encryption scheme. Asymmetric cryptography minimizes the number of proofs needed and saves time in processing proofs. The homomorphism we design yields constant-size proofs. It limits the header-space overhead and outperforms existing linear-scale counterparts when the path length exceeds a value that is usually small. Furthermore, the proposed encryption scheme is noncommutative so that any deviation from the forwarding path can be detected. We explore a series of design strategies for security and efficiency. The evaluation results show that Atomos yields not only shorter proofs but also faster validation than existing solutions.
- 11 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 15 (15566013) , 3832-3847
Atomos: Constant-Size Path Validation Proof
Path validation has been explored as an indispensable security feature for the future Internet. Motivated by the Path-Aware Networking Research Group (PANRG) under the Internet Engineering Task Force (IETF) and Internet Research Task Force (IRTF), it gives end-hosts more control over packet forwarding and ensures that the forwarding history is verifiable. The main idea is to require that routers add proofs in packet headers for other routers to verify. We identify linear-scale proofs as the essential efficiency barrier of existing path validation solutions. In this paper, we propose Atomos to validate network paths with constant-size proofs. To this end, we construct a noncommutative homomorphic asymmetric-key encryption scheme. Asymmetric cryptography minimizes the number of proofs needed and saves time in processing proofs. The homomorphism we design yields constant-size proofs. It limits the header-space overhead and outperforms existing linear-scale counterparts when the path length exceeds a value that is usually small. Furthermore, the proposed encryption scheme is noncommutative so that any deviation from the forwarding path can be detected. We explore a series of design strategies for security and efficiency. The evaluation results show that Atomos yields not only shorter proofs but also faster validation than existing solutions.
- 14 January 2020
- Published by Springer Nature
- p. 219-234
Divide and Conquer: Efficient Multi-path Validation with ProMPV
- 14 January 2020
- Published by Springer Nature
- p. 219-234
Divide and Conquer: Efficient Multi-path Validation with ProMPV