XLXiao Lan

Xiao Lan

*This is an algorithmically generated author record based on publicly available information.

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


Xiao Lan has a total of 43 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    FSSketch: efficient frequency sorting of distributed data based on sketch and secure multi-party computation

    by Li Li, Xiao Lan

    Distributed computing environments provide considerable advantages for storing user data and performing computations, owing to their geographically dispersed nature. Within this framework, sorting data by frequency underpins numerous data aggregation and analysis tasks. Prior research aimed at mitigating privacy risks has largely focused on the application of cryptographic primitives for safeguarding data. Extending this body of work, this paper introduces an efficient algorithm for sorting data by frequency while maintaining a privacy-preserving aggregation state. The proposed method first leverages sketch theory to design a frequency-ranking algorithm for distributed data, which facilitates efficient information aggregation and sorting. Subsequently, privacy enhancements are incorporated into this frequency-ranking algorithm through additive secret sharing (ASS) and secure multi-party computation (SMPC). These cryptographic techniques enable private addition and summation operations on data distributed across multiple sources. The security of the proposed sketch-based frequency sorting algorithm (FSSketch) is evaluated within the semi-honest adversarial model. Furthermore, simulation experiments are performed utilizing the versatile multi-party computation framework (MP-SPDZ), an SMPC library. Results from these experiments indicate that FSSketch delivers superior efficiency and privacy. In comparison to alternative algorithms (P2SM and PPDA), FSSketch demonstrates a performance improvement exceeding an order of magnitude. Furthermore, the proposed FSSketch algorithm shows strong potential for real-world scenarios requiring privacy-preserving data processing, such as financial data analysis, medical data sharing, and intelligent urban management, thereby providing a reliable technical support for the broader application of privacy-preserving distributed computing.

  • Open Access

    KryptoPilot: An Open-World Knowledge-Augmented LLM Agent for Automated Cryptographic Exploitation

    by Xiaonan Liu, Zhihao Li, Xiao Lan, Hao Ren, Haizhou Wang, Xingshu Chen

    Capture-the-Flag (CTF) competitions play a central role in modern cybersecurity as a platform for training practitioners and evaluating offensive and defensive techniques derived from real-world vulnerabilities. Despite recent advances in large language models (LLMs), existing LLM-based agents remain ineffective on high-difficulty cryptographic CTF challenges, which require precise cryptanalytic knowledge, stable long-horizon reasoning, and disciplined interaction with specialized toolchains. Through a systematic exploratory study, we show that insufficient knowledge granularity, rather than model reasoning capacity, is a primary factor limiting successful cryptographic exploitation: coarse or abstracted external knowledge often fails to support correct attack modeling and implementation. Motivated by this observation, we propose KryptoPilot, an open-world knowledge-augmented LLM agent for automated cryptographic exploitation. KryptoPilot integrates dynamic open-world knowledge acquisition via a Deep Research pipeline, a persistent workspace for structured knowledge reuse, and a governance subsystem that stabilizes reasoning through behavioral constraints and cost-aware model routing. This design enables precise knowledge alignment while maintaining efficient reasoning across heterogeneous subtasks. We evaluate KryptoPilot on two established CTF benchmarks and in six real-world CTF competitions. KryptoPilot achieves a complete solve rate on InterCode-CTF, solves between 56 and 60 percent of cryptographic challenges on the NYU-CTF benchmark, and successfully solves 26 out of 33 cryptographic challenges in live competitions, including multiple earliest-solved and uniquely-solved instances. These results demonstrate the necessity of open-world, fine-grained knowledge augmentation and governed reasoning for scaling LLM-based agents to real-world cryptographic exploitation.

  • Open Access

    PrivDNFIS: Privacy-preserving and Efficient Deep Neuro-Fuzzy Inference System

    by Hao Ren, Xiao Lan, Rui Tang, Xingshu Chen

    Deep Neuro-Fuzzy Inference Systems (DNFIS) seamlessly fuse neural networks with the fuzzy inference system enabling intricate decision-making and knowledge representation, while upholding a commendable degree of adaptability and interpretability. However, the challenge of privacy-preserving inference (PI) over DNFIS has remained largely uncharted, with no prior research addressing this critical issue. In this paper, we embark on an exploration of this issue. We introduce an efficient and secure PI framework for DNFIS, named PrivDNFIS, which leverages the post-quantum lattice-based homomorphic encryption to implement secure computation protocols for PI over DNFIS. Our work incorporates several non-trivial performance enhancements. Firstly, it consolidates multiple elements of input feature vectors into a single message, reducing encryption/decryption overhead. Secondly, building upon this novel encoding approach, PrivDNFIS can perform ciphertext aggregation and vector-vector inner production without necessitating time-consuming ciphertext rotation operations. Thirdly, we replace the softmax function in the DNFIS layer with a quadratic function to further enhance inference efficiency, without compromising the inference accuracy. Under the given threat model, we provide formal security proof for PrivDNFIS. In comprehensive experimental results, PrivDNFIS demonstrates an approximately 1.9 to 4.4 times reduction in end-to-end time cost compared to the benchmark.


  • LDGI: Location-Discriminative Geo-Indistinguishability for Location Privacy

    by Youwen Zhu, Yuanyuan Hong, Qiao Xue, Xiao Lan, Yushu Zhang, Yong Xiang

    Geo-Indistinguishability (GI) is a powerful privacy model that can effectively protect location information by limiting the ability of an attacker to infer a user's true location. In real life, locations usually have different sensitive levels in terms of privacy; for example, shopping malls might be low-sensitive while home addresses might be high-sensitive for users. But the GI model does not consider the various sensitive levels of locations, and implements the same perturbation on all locations to meet the highest privacy requirement. This would cause overprotection of low-sensitive locations and reduce data utility. To strike a good balance between privacy and utility, in this paper, we propose a novel privacy notion, termed L ocation- D iscriminative G eo- I ndistinguishability (LDGI), which takes into account different sensitive levels of location privacy. With LDGI model, we then develop a perturbation scheme called EM-LDGI based on the exponential mechanism, and an advance scheme MinQL to further enhance data utility. To improve the efficiency of the proposed schemes, we design a scheme MinQL-S with the assistance of the spanner graph, at the cost of a slight utility degradation. We theoretically analyze that the proposed schemes satisfy LDGI and evaluate their performance by extensive experiments on both synthetic and real datasets. The comparison with GI mechanisms demonstrates the advantages of the LDGI model.


  • A metadata-aware detection model for fake restaurant reviews based on multimodal fusion

    by Yifei Jian, Xinyu Chen, Xiaoda Wang, Ying Liu, Xingshu Chen, Xiao Lan, Wenxian Wang, Haizhou Wang


  • Efficient and Secure Quantile Aggregation of Private Data Streams

    by Xiao Lan, Hongjian Jin, Hui Guo, Xiao Wang

    Computing the quantile of a massive data stream has been a crucial task in networking and data management. However, existing solutions assume a centralized model where one data owner has access to all data. In this paper, we put forward a study of secure quantile aggregation between private data streams, where data streams owned by different parties would like to obtain a quantile of the union of their data without revealing anything else about their inputs. To this end, we designed efficient cryptographic protocols that are secure in the semi-honest setting as well as the malicious setting. By incorporating differential privacy, we further improve the efficiency by 1.1× to 73.1×. We implemented our protocol, which shows practical efficiency to aggregate real-world data streams efficiently.


  • Open Access

    PPTPS: Building privacy-preserving auditable service with traceable timeliness for public cloud storage

    by Li Li, Xiao Lan, Mali Chen, Ting Luo, Li Chen, Yangxin Wang, Yumeng Chen

    Many works are designed to improve efficiency or enhance security and privacy of publicly-auditable cloud storage. However, building timeliness for cloud storage has not been well studied. Few works presented time-sensitive cloud storage and only focused on specific issues, such as the earliest creation time of files or resistance against a procrastinating auditor. Therefore, there leaves an absence of building traceable timeliness for publicly-auditable cloud storage. In this paper, we propose a solution PPTPS to buildPrivacy-Preserving auditable service with Traceable timeliness forPublic cloudStorage. First, we use the security properties of the blockchain to provide a time-stamp for each phase. It enables the timeliness of cloud storage. Second, we construct efficient publicly-verifiable cloud storage. Third, a customized random mask solution is proposed to prevent privacy leakage during the auditing phase. Moreover, we formally proved the security of PPTPS. At last, experimental results demonstrate that PPTPS is economically sound and technically viable.


  • A systematic security analysis of EMV protocol

    by Xiao Lan, Jing Xu, Zhenfeng Zhang, Xingshu Chen, Yonggang Luo