Ying Gao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ying Gao has a total of 50 co-authors. Here are the top co-authors by number of shared publications:
- Jie Chen
Wuhan University
4 shared publications - Jie Ma
Beihang University, Beijing, China
4 shared publications - Xiaofeng Chen
School of Cyber Science and Technology, Beihang University, Beijing, China
4 shared publications - Haoyu Wang
Huazhong University of Science and Technology, China
3 shared publications - Huanghao Deng
School of Cyber Science and Technology, Beihang University, Beijing, China
3 shared publications - Jinwen Xi
Beijing University of Posts and Telecommunications, Beijing, China, China
3 shared publications
Latest Publications
- 7 November 2026
- Published by Springer Nature
- p. 571-586
Temporal-Topological Feature Fusion for Encrypted Traffic Classification
- 7 November 2026
- Published by Springer Nature
- p. 571-586
Temporal-Topological Feature Fusion for Encrypted Traffic Classification
- 18 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. PP (3) , 1-15
An Efficient NTRU-Type MPHE Scheme for Sensitive Data in Cloud Computing
The development of cloud computing has heightened demand for sensitive data privacy. Multi party homomorphic encryption (MPHE) enables ho momorphicevaluation on encrypted data from multiple users, providing a crucial solution for secure multi-user computation in cloud computing models. NTRU-type MPHEschemes are particularly promising due to their simplicity and efficiency; however, existing solutions face three key limitations: a lack of threshold decryption (t-out-of-N), reliance on trusted third parties, and vulnerability to subfield lattice attacks. In this paper, we propose GTS, a novel NTRU-type MPHE scheme. Compared to existing schemes, GTS offers several advantages. On the one hand, we design a t-out-of-N threshold access structure, allowing GTS to facilitate threshold decryption with predefined participants. On the other hand, we combine distributed key generation and Lagrange interpolation, enabling GTS to operate without relying on trusted third parties and enhancing its resistance to subfield lattice attacks. These features effectively address the aforementioned challenges. We provide the correctness and security proofs for GTS, along with comprehensive analyses of computational and communication overheads. Experimental evaluations demonstrate significant efficiency improvements: compared to state-of-the-art methods, GTS achieves total execution time speedups of up to 2.4× and 3.7× at 128-bit security with N = 20 parties.
- 18 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. PP (3) , 1-15
An Efficient NTRU-Type MPHE Scheme for Sensitive Data in Cloud Computing
The development of cloud computing has heightened demand for sensitive data privacy. Multi party homomorphic encryption (MPHE) enables ho momorphicevaluation on encrypted data from multiple users, providing a crucial solution for secure multi-user computation in cloud computing models. NTRU-type MPHEschemes are particularly promising due to their simplicity and efficiency; however, existing solutions face three key limitations: a lack of threshold decryption (t-out-of-N), reliance on trusted third parties, and vulnerability to subfield lattice attacks. In this paper, we propose GTS, a novel NTRU-type MPHE scheme. Compared to existing schemes, GTS offers several advantages. On the one hand, we design a t-out-of-N threshold access structure, allowing GTS to facilitate threshold decryption with predefined participants. On the other hand, we combine distributed key generation and Lagrange interpolation, enabling GTS to operate without relying on trusted third parties and enhancing its resistance to subfield lattice attacks. These features effectively address the aforementioned challenges. We provide the correctness and security proofs for GTS, along with comprehensive analyses of computational and communication overheads. Experimental evaluations demonstrate significant efficiency improvements: compared to state-of-the-art methods, GTS achieves total execution time speedups of up to 2.4× and 3.7× at 128-bit security with N = 20 parties.
- Open Access
- 10 April 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 10 (OOPSLA1) , 540-570
When Specifications Meet Reality: Uncovering API Inconsistencies in Ethereum Infrastructure
The Ethereum ecosystem, which secures over $381 billion in assets, fundamentally relies on client APIs as the sole interface between users and the blockchain. However, these critical APIs suffer from widespread implementation inconsistencies, which can lead to financial discrepancies, degraded user experiences, and threats to network reliability. Despite this criticality, existing testing approaches remain manual and incomplete: they require extensive domain expertise, struggle to keep pace with Ethereum's rapid evolution, and fail to distinguish genuine bugs from acceptable implementation variations. We present APIDiffer, the first specification-guided differential testing framework designed to automatically detect API inconsistencies across Ethereum's diverse client ecosystem. APIDiffer transforms API specifications into comprehensive test suites through two key innovations: (1) specification-guided test input generation that creates both syntactically valid and invalid requests enriched with real-time blockchain data, and (2) specification-aware false positive filtering that leverages large language models to distinguish genuine bugs from acceptable variations. Our evaluation across all 11 major Ethereum clients reveals the pervasiveness of API bugs in production systems. APIDiffer uncovered 72 bugs, with 90.28% already confirmed or fixed by developers, including one critical error in the official specifications themselves. Beyond these raw numbers, APIDiffer achieves up to 89.67% higher code coverage than existing tools and reduces false positive rates by 37.38%. The Ethereum community's response validates our impact: developers have integrated our test cases, expressed interest in adopting our methodology, and escalated one bug to the official Ethereum Project Management meeting. By making APIDiffer open-source, we enable continuous validation of Ethereum client API implementations, thereby strengthening the foundational integrity of the entire Ethereum ecosystem.
- 10 April 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 10 (OOPSLA1) , 540-570
Open AccessWhen Specifications Meet Reality: Uncovering API Inconsistencies in Ethereum Infrastructure
The Ethereum ecosystem, which secures over $381 billion in assets, fundamentally relies on client APIs as the sole interface between users and the blockchain. However, these critical APIs suffer from widespread implementation inconsistencies, which can lead to financial discrepancies, degraded user experiences, and threats to network reliability. Despite this criticality, existing testing approaches remain manual and incomplete: they require extensive domain expertise, struggle to keep pace with Ethereum's rapid evolution, and fail to distinguish genuine bugs from acceptable implementation variations. We present APIDiffer, the first specification-guided differential testing framework designed to automatically detect API inconsistencies across Ethereum's diverse client ecosystem. APIDiffer transforms API specifications into comprehensive test suites through two key innovations: (1) specification-guided test input generation that creates both syntactically valid and invalid requests enriched with real-time blockchain data, and (2) specification-aware false positive filtering that leverages large language models to distinguish genuine bugs from acceptable variations. Our evaluation across all 11 major Ethereum clients reveals the pervasiveness of API bugs in production systems. APIDiffer uncovered 72 bugs, with 90.28% already confirmed or fixed by developers, including one critical error in the official specifications themselves. Beyond these raw numbers, APIDiffer achieves up to 89.67% higher code coverage than existing tools and reduces false positive rates by 37.38%. The Ethereum community's response validates our impact: developers have integrated our test cases, expressed interest in adopting our methodology, and escalated one bug to the official Ethereum Project Management meeting. By making APIDiffer open-source, we enable continuous validation of Ethereum client API implementations, thereby strengthening the foundational integrity of the entire Ethereum ecosystem.
- 3 March 2026
- Published by Elsevier in Theoretical Computer Science
- Vol. 1071
Matchmaking encryption for NC1 circuits without obfuscation
- 3 March 2026
- Published by Elsevier in Theoretical Computer Science
- Vol. 1071
Matchmaking encryption for NC1 circuits without obfuscation
- 19 February 2026
- Published by Elsevier in Computer Networks
- Vol. 279
Controllable encrypted data sharing scheme with key update for blockchain-assisted IoT
- 19 February 2026
- Published by Elsevier in Computer Networks
- Vol. 279
Controllable encrypted data sharing scheme with key update for blockchain-assisted IoT
- Open Access
- 5 February 2026
- Published by Springer Nature in Cybersecurity
- Vol. 9 (1)
GPU-accelerated Batch Private Information Retrieval with lower communication overheads
Private Information Retrieval (PIR) is a critical component in many privacy-preserving systems, and Batch PIR schemes constructed by Probabilistic Batch Code have garnered widespread attention in both academia and industry due to their relatively low average computational cost. However, existing Batch PIR still face challenges in balancing computational and communication efficiency, while some also exhibit poor adaptability to databases of large entries. In this paper, building upon the state-of-the-art Batch PIR schemes, we employ two approaches to enhance their overall performance. To reduce the communication cost of Batch PIR, we propose a novel Oblivious Ciphertext Decompression scheme $$\textsf{GCTObvDecomperss}$$ based on the 3-Hash Garbled Cuckoo Table algorithm. We use the hypergraph peeling algorithm to construct this scheme and give a formal security definition and proof of this scheme to ensure it is computationally oblivious. In the implementation, our scheme reduces the additional communication cost in Batch PIR by 27% while achieving a 7.9 $$\times$$ improvement in efficiency compared to existing solutions. Moreover, to enhance computational performance, we analyze the computational bottleneck of Spiral PIR and optimize it using GPU technology, achieving a 267 $$\times$$ speedup in the first-dimensional processing phase compared to serial execution, and reducing the total computation cost by 3.9 $$\times$$ . Furthermore, we conduct comprehensive evaluations of our Batch PIR protocol, demonstrating its superior performance in both computational efficiency and communication overhead, as well as its capability to support efficient retrieval in databases of large entries. Finally, we use our Batch PIR in an anonymous messaging protocol Pung, and evaluate the performance of this real-world application. By using our Batch PIR, the latency can be reduced by 18.8% when the number of records reached $$2^{18}$$ compared to the original protocol, indicating that our construction can provide a more effective and practical method in related scenarios.- 5 February 2026
- Published by Springer Nature in Cybersecurity
- Vol. 9 (1)
Open AccessGPU-accelerated Batch Private Information Retrieval with lower communication overheads
Private Information Retrieval (PIR) is a critical component in many privacy-preserving systems, and Batch PIR schemes constructed by Probabilistic Batch Code have garnered widespread attention in both academia and industry due to their relatively low average computational cost. However, existing Batch PIR still face challenges in balancing computational and communication efficiency, while some also exhibit poor adaptability to databases of large entries. In this paper, building upon the state-of-the-art Batch PIR schemes, we employ two approaches to enhance their overall performance. To reduce the communication cost of Batch PIR, we propose a novel Oblivious Ciphertext Decompression scheme $$\textsf{GCTObvDecomperss}$$ based on the 3-Hash Garbled Cuckoo Table algorithm. We use the hypergraph peeling algorithm to construct this scheme and give a formal security definition and proof of this scheme to ensure it is computationally oblivious. In the implementation, our scheme reduces the additional communication cost in Batch PIR by 27% while achieving a 7.9 $$\times$$ improvement in efficiency compared to existing solutions. Moreover, to enhance computational performance, we analyze the computational bottleneck of Spiral PIR and optimize it using GPU technology, achieving a 267 $$\times$$ speedup in the first-dimensional processing phase compared to serial execution, and reducing the total computation cost by 3.9 $$\times$$ . Furthermore, we conduct comprehensive evaluations of our Batch PIR protocol, demonstrating its superior performance in both computational efficiency and communication overhead, as well as its capability to support efficient retrieval in databases of large entries. Finally, we use our Batch PIR in an anonymous messaging protocol Pung, and evaluate the performance of this real-world application. By using our Batch PIR, the latency can be reduced by 18.8% when the number of records reached $$2^{18}$$ compared to the original protocol, indicating that our construction can provide a more effective and practical method in related scenarios. - 2 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (8) , 16578-16591
Privacy-Preserving and Puncturable Bilateral Access Control From Lattices for Cloud-Assisted IoV
Cloud-assisted Internet of Vehicles (IoV) enables real-time data collection and processing through vehicle–cloud collaboration, thereby improving traffic scheduling efficiency and safety. However, ensuring data privacy and verifying data authenticity remain major challenges in such systems. Although existing primitives such as matchmaking encryption (ME) provide partial protection, they still lack quantum resistance and forward security for historical data. To address this limitation, we propose a lattice-based puncturable identity-based ME (PIB-ME) scheme and design a revocable data sharing system with bilateral access control (RDSS-BAC) tailored for cloud-assisted IoV. We formalize the definition and security model of PIB-ME and prove its security under the RLWE assumption. The proposed PIB-ME enables bilateral access control between communicating vehicles, supports key puncturing for flexible revocation, and achieves post-quantum security. Security analysis demonstrates that, in addition to privacy and authenticity, the scheme resists tampering, collusion, and quantum attacks. Finally, theoretical complexity analysis and experimental evaluation confirm the efficiency and practicality of our scheme in cloud-assisted IoV scenarios.
- 2 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (8) , 16578-16591
Privacy-Preserving and Puncturable Bilateral Access Control From Lattices for Cloud-Assisted IoV
Cloud-assisted Internet of Vehicles (IoV) enables real-time data collection and processing through vehicle–cloud collaboration, thereby improving traffic scheduling efficiency and safety. However, ensuring data privacy and verifying data authenticity remain major challenges in such systems. Although existing primitives such as matchmaking encryption (ME) provide partial protection, they still lack quantum resistance and forward security for historical data. To address this limitation, we propose a lattice-based puncturable identity-based ME (PIB-ME) scheme and design a revocable data sharing system with bilateral access control (RDSS-BAC) tailored for cloud-assisted IoV. We formalize the definition and security model of PIB-ME and prove its security under the RLWE assumption. The proposed PIB-ME enables bilateral access control between communicating vehicles, supports key puncturing for flexible revocation, and achieves post-quantum security. Security analysis demonstrates that, in addition to privacy and authenticity, the scheme resists tampering, collusion, and quantum attacks. Finally, theoretical complexity analysis and experimental evaluation confirm the efficiency and practicality of our scheme in cloud-assisted IoV scenarios.
- 1 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Chinese Journal of Electronics
- Vol. 34 (5) , 1375-1387
RLMI: A Black-Box Model Inversion Attack Method Against Large Language Models for Text Classification
The combination of pre-training and fine-tuning has become a standard paradigm for training large language models (LLMs). However, recent studies have shown that LLMs may unintentionally memorize fine-tuning data, which is typically domain-specific and sensitive, potentially leading to severe privacy risks. To address this privacy concern, this paper proposes a reinforcement learning-based model inversion (RLMI) attack to extract text data used for fine-tuning LLMs on text classification tasks. First, we formulate the inversion of text data as a generation process of text sequences token by token. Then, a policy-based reinforcement learning algorithm optimizes the parameters of a text generation model, serving as the policy network. Finally, we generate text sequences highly likely to be part of the fine-tuning dataset by using the optimized policy network. By integrating a reinforcement learning framework, this method enables efficient exploration of the text space, addressing challenges posed by the discreteness of text data and the unavailability of the LLM's internal structure and parameters. Extensive experiments demonstrate the effectiveness of this method in generating text sequences consistent with target labels and similar to the fine-tuning data. These findings reveal potential privacy vulnerabilities in fine-tuning LLMs and underscore the need for further research into privacy-preserving technologies.
- 1 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Chinese Journal of Electronics
- Vol. 34 (5) , 1375-1387
RLMI: A Black-Box Model Inversion Attack Method Against Large Language Models for Text Classification
The combination of pre-training and fine-tuning has become a standard paradigm for training large language models (LLMs). However, recent studies have shown that LLMs may unintentionally memorize fine-tuning data, which is typically domain-specific and sensitive, potentially leading to severe privacy risks. To address this privacy concern, this paper proposes a reinforcement learning-based model inversion (RLMI) attack to extract text data used for fine-tuning LLMs on text classification tasks. First, we formulate the inversion of text data as a generation process of text sequences token by token. Then, a policy-based reinforcement learning algorithm optimizes the parameters of a text generation model, serving as the policy network. Finally, we generate text sequences highly likely to be part of the fine-tuning dataset by using the optimized policy network. By integrating a reinforcement learning framework, this method enables efficient exploration of the text space, addressing challenges posed by the discreteness of text data and the unavailability of the LLM's internal structure and parameters. Extensive experiments demonstrate the effectiveness of this method in generating text sequences consistent with target labels and similar to the fine-tuning data. These findings reveal potential privacy vulnerabilities in fine-tuning LLMs and underscore the need for further research into privacy-preserving technologies.
- Open Access
- 22 June 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 2 (ISSTA) , 1559-1582
OpDiffer: LLM-Assisted Opcode-Level Differential Testing of Ethereum Virtual Machine
As Ethereum continues to thrive, the Ethereum Virtual Machine (EVM) has become the cornerstone powering tens of millions of active smart contracts. Intuitively, security issues in EVMs could lead to inconsistent behaviors among smart contracts or even denial-of-service of the entire blockchain network. However, to the best of our knowledge, only a limited number of studies focus on the security of EVMs. Moreover, they suffer from 1) insufficient test input diversity and invalid semantics; and 2) the inability to automatically identify bugs and locate root causes. To bridge this gap, we propose OpDiffer, a differential testing framework for EVM, which takes advantage of LLMs and static analysis methods to address the above two limitations. We conducted the largest-scale evaluation, covering nine EVMs and uncovering 26 previously unknown bugs, 22 of which have been confirmed by developers and three have been assigned CNVD IDs. Compared to state-of-the-art baselines, OpDiffer can improve code coverage by at most 71.06%, 148.40% and 655.56%, respectively. Through an analysis of real-world deployed Ethereum contracts, we estimate that 7.21% of the contracts could trigger our identified EVM bugs under certain environmental settings, potentially resulting in severe negative impact on the Ethereum ecosystem.
- 22 June 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 2 (ISSTA) , 1559-1582
Open AccessOpDiffer: LLM-Assisted Opcode-Level Differential Testing of Ethereum Virtual Machine
As Ethereum continues to thrive, the Ethereum Virtual Machine (EVM) has become the cornerstone powering tens of millions of active smart contracts. Intuitively, security issues in EVMs could lead to inconsistent behaviors among smart contracts or even denial-of-service of the entire blockchain network. However, to the best of our knowledge, only a limited number of studies focus on the security of EVMs. Moreover, they suffer from 1) insufficient test input diversity and invalid semantics; and 2) the inability to automatically identify bugs and locate root causes. To bridge this gap, we propose OpDiffer, a differential testing framework for EVM, which takes advantage of LLMs and static analysis methods to address the above two limitations. We conducted the largest-scale evaluation, covering nine EVMs and uncovering 26 previously unknown bugs, 22 of which have been confirmed by developers and three have been assigned CNVD IDs. Compared to state-of-the-art baselines, OpDiffer can improve code coverage by at most 71.06%, 148.40% and 655.56%, respectively. Through an analysis of real-world deployed Ethereum contracts, we estimate that 7.21% of the contracts could trigger our identified EVM bugs under certain environmental settings, potentially resulting in severe negative impact on the Ethereum ecosystem.