Yongbin Zhou
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
Research Subjects
Yongbin Zhou has a total of 147 co-authors. Here are the top co-authors by number of shared publications:
- Yuejun Liu
School of Cyber Science and Engineering, Nanjing University of Science and Technology, Nanjing, China
13 shared publications - Yiwen Gao
Nanjing University of Science and Technology
11 shared publications - Jingdian Ming
School of Cyber Science and Engineering, Nanjing University of Science and Technology, Nanjing, China
9 shared publications - Shuchao Pang
Nanjing University of Science and Technology, Nanjing, China
9 shared publications - Hailong Zhang
North China Electric Power University
6 shared publications - Jiabei Wang
Nanjing University of Science and Technology
6 shared publications
Latest Publications
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1700-1714
When Module Lattice Leaks: Horizontal Fusion Attacks on ML-DSA Implementation
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1700-1714
Open AccessWhen Module Lattice Leaks: Horizontal Fusion Attacks on ML-DSA Implementation
- 8 November 2026
- Published by Springer Nature
- p. 63-85
From Clues to Evidence Chains: Verifying LLM-Generated Firmware Security Findings
- 8 November 2026
- Published by Springer Nature
- p. 63-85
From Clues to Evidence Chains: Verifying LLM-Generated Firmware Security Findings
- 23 October 2026
- Published by Springer Nature
- p. 780-798
BinCryptID: Semantic-Structural Identification of Cryptographic Functions in Stripped Binaries
- 23 October 2026
- Published by Springer Nature
- p. 780-798
BinCryptID: Semantic-Structural Identification of Cryptographic Functions in Stripped Binaries
- 23 October 2026
- Published by Springer Nature
- p. 392-410
Toward Comprehensive Cryptographic API Misuse Detection: Fine-Tuning Discriminative LLMs on Sliced Code Snippets
- 23 October 2026
- Published by Springer Nature
- p. 392-410
Toward Comprehensive Cryptographic API Misuse Detection: Fine-Tuning Discriminative LLMs on Sliced Code Snippets
- 17 October 2026
- Published by Springer Nature
- p. 506-526
Rank-Based Distribution Reshaping for Robust EM/Power Fusion in Side-Channel Analysis Across Sampling Rates
- 17 October 2026
- Published by Springer Nature
- p. 506-526
Rank-Based Distribution Reshaping for Robust EM/Power Fusion in Side-Channel Analysis Across Sampling Rates
- 27 September 2026
- Published by Springer Nature
- p. 341-362
Closing the Gap: Huffman-Optimal and Stealthy Key-Mismatch Attacks on ML-KEM
- 27 September 2026
- Published by Springer Nature
- p. 341-362
Closing the Gap: Huffman-Optimal and Stealthy Key-Mismatch Attacks on ML-KEM
- 26 September 2026
- Published by Springer Nature
- p. 381-394
VeilSearch: Split-Vector Local Differential Privacy for Encrypted Cross-Modal Retrieval
- 26 September 2026
- Published by Springer Nature
- p. 381-394
VeilSearch: Split-Vector Local Differential Privacy for Encrypted Cross-Modal Retrieval
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
PD-Net: Learning Device-Invariant Representations for Heterogeneous Cross-Device Side-Channel Attacks
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessPD-Net: Learning Device-Invariant Representations for Heterogeneous Cross-Device Side-Channel Attacks
- Open Access
- 18 May 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (3) , 1-26
Loom: Weaving PCS-Preserving and Searchable Cloud Backups for Secure Messaging
Post-compromise security (PCS) ensures that exposure of the current secret state does not permanently compromise future security. Modern secure messaging protocols such as IETF Messaging Layer Security provide mature realizations of PCS through continuous key updates, ensuring that compromise of the current secret state does not endanger future communications. However, extending this protection to cloud backups often breaks PCS if data are encrypted under static key. While Dodis et al.'s Compact Key Storage (CKS) preserves PCS for encrypted backups, it supports only all-or-nothing retrieval, rendering keyword-based selective retrieval impractical. We present Loom, the first searchable encrypted cloud backup system that preserves PCS while supporting efficient multi-keyword conjunctive search. Loom embeds data keys into the secure searchable index, eliminating the need for separate key storage and ensuring that ''searchable-implies-decryptable''. For group scenarios, we introduce LoomRelay, which avoids redundant uploads and ensures consistent access control under dynamic group membership. Implemented on mlspp, an open-source IETF MLS reference, Loom and LoomRelay outperform prior schemes. Single-message backup completes in 3-15 ms across variable cipher suites, while searching 10 4 encrypted messages takes 9.06-28.97 s (RTT 10-100 ms, bandwidth 10-50 Mbps). Compared to CKS, which requires downloading the entire backup, Loom achieves 25×-87× faster keyword-based retrieval, with substantially lower communication and storage overhead.
- 18 May 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (3) , 1-26
Open AccessLoom: Weaving PCS-Preserving and Searchable Cloud Backups for Secure Messaging
Post-compromise security (PCS) ensures that exposure of the current secret state does not permanently compromise future security. Modern secure messaging protocols such as IETF Messaging Layer Security provide mature realizations of PCS through continuous key updates, ensuring that compromise of the current secret state does not endanger future communications. However, extending this protection to cloud backups often breaks PCS if data are encrypted under static key. While Dodis et al.'s Compact Key Storage (CKS) preserves PCS for encrypted backups, it supports only all-or-nothing retrieval, rendering keyword-based selective retrieval impractical. We present Loom, the first searchable encrypted cloud backup system that preserves PCS while supporting efficient multi-keyword conjunctive search. Loom embeds data keys into the secure searchable index, eliminating the need for separate key storage and ensuring that ''searchable-implies-decryptable''. For group scenarios, we introduce LoomRelay, which avoids redundant uploads and ensures consistent access control under dynamic group membership. Implemented on mlspp, an open-source IETF MLS reference, Loom and LoomRelay outperform prior schemes. Single-message backup completes in 3-15 ms across variable cipher suites, while searching 10 4 encrypted messages takes 9.06-28.97 s (RTT 10-100 ms, bandwidth 10-50 Mbps). Compared to CKS, which requires downloading the entire backup, Loom achieves 25×-87× faster keyword-based retrieval, with substantially lower communication and storage overhead.
- Open Access
- 15 May 2026
- Published by Springer Nature in Cybersecurity
- Vol. 9 (1) , 69
REACTS: robust encrypted search for dynamic spatial-textual data with permission control
The proliferation of spatial-textual data applications has created significant challenges in securely managing such data within untrusted cloud environments. Existing encrypted spatial-textual data retrieval schemes primarily focus on static data and overlook the complexities of practical data updates, particularly lacking robustness in managing irrational updates. In this paper, we introduce a novel robust dynamic encrypted spatial-textual data search scheme, called , that enhances existing systems by addressing the challenges of security and robustness in data dynamic settings. This is the first scheme to simultaneously achieve forward security, Type-I $$^-$$ backward security, and enhanced robustness for boolean range queries on spatial-textual data. We formally define the security model and classify three levels of robustness. Our customized Asymmetric Scalar-Product-Preserving Encryption (ASPE) design incorporates an “update check mechanism” can efficiently mitigate repeated and disruptive update attacks while supporting efficient search and update permission control. Experimental evaluations demonstrate that only maintains 100% precision and recall while showing practical search efficiency, even outperforming the existing static scheme with a similar ASPE-based approach.- 15 May 2026
- Published by Springer Nature in Cybersecurity
- Vol. 9 (1) , 69
Open AccessREACTS: robust encrypted search for dynamic spatial-textual data with permission control
The proliferation of spatial-textual data applications has created significant challenges in securely managing such data within untrusted cloud environments. Existing encrypted spatial-textual data retrieval schemes primarily focus on static data and overlook the complexities of practical data updates, particularly lacking robustness in managing irrational updates. In this paper, we introduce a novel robust dynamic encrypted spatial-textual data search scheme, called , that enhances existing systems by addressing the challenges of security and robustness in data dynamic settings. This is the first scheme to simultaneously achieve forward security, Type-I $$^-$$ backward security, and enhanced robustness for boolean range queries on spatial-textual data. We formally define the security model and classify three levels of robustness. Our customized Asymmetric Scalar-Product-Preserving Encryption (ASPE) design incorporates an “update check mechanism” can efficiently mitigate repeated and disruptive update attacks while supporting efficient search and update permission control. Experimental evaluations demonstrate that only maintains 100% precision and recall while showing practical search efficiency, even outperforming the existing static scheme with a similar ASPE-based approach.