Yibo Cao

Yibo Cao

Auto-generated profile, based on publicly available information

Yibo Cao

Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 May 2025 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
GXGang Xu
Gang Xu
XFXinyu Fan
Xinyu Fan
SXShiyuan Xu
Shiyuan Xu
YCYibo Cao
Yibo Cao
XCXiu-Bo Chen
Xiu-Bo Chen
SYShui Yu
Shui Yu
Internet of Medical Things (IoMT) has garnered significant research attention from both academic and medical institutions. However, the sensitive medical data involved in IoMT raises security and privacy concerns. To mitigate these, ring signature has surfaced as a proper solution, which offers unforgeability and anonymity. Unfortunately, most multi-signer ring signature schemes require a predetermined number of signers and are difficult to adjust dynamically. Additionally, traditional ring signatures have limited adaptability for IoMT due to their reliance on a single entity. It is challenging to effectively define different signature permissions for users of various entities, such as patients and doctors. Therefore, research focusing on constructing a dynamic multi-signer ring signature for multi-party participation remains a critical and ongoing challenge. In this paper, we present ASMR, an anonymity-enhanced sequential multi-signer ring signature scheme for secure medical data sharing in IoMT. ASMR contains two different rings, PR and DR, for patients and doctors, respectively. It allows patients in PR to anonymously sign their electronic healthcare record (EHR) owned by doctors in DR, overcoming the reliance on a single entity in existing approaches while enhancing the anonymity of the signature. Meanwhile, ASMR introduces the concept of signature chaining, allowing multiple users in DR to co-sign information in sequence. In addition, it ensures that each generated signature is traceable, offering a transparent system. We also formally prove the security of ASMR in the random oracle model. Comprehensive performance evaluations indicate that ASMR excels in both computational and storage overhead. In the best case, computational overhead is reduced by approximately 4.7×-61.7×, while storage overhead is reduced by approximately 26.7×-212.8× compared to prior arts.

30 October 2025 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
GXGang Xu
Gang Xu
XFXinyu Fan
Xinyu Fan
SXShiyuan Xu
Shiyuan Xu
YCYibo Cao
Yibo Cao
KZKejia Zhang
Kejia Zhang
DNDusit Niyato
Dusit Niyato
Mobile cloud computing has become widely adopted for its convenience in data storage and sharing, but it also introduces challenges related to data privacy and security. To address these issues, public key authenticated encryption with keyword search (PAEKS) has emerged as a potential solution that ensures data privacy while resisting internal keyword guessing attacks (IKGAs). Unfortunately, most existing PAEKS schemes have limited adaptability to multi-user scenarios. Specifically, in PAEKS, ciphertext generation requires the participation of users’ secret keys, which results in ciphertexts being unique, even when the same keywords are encrypted by different users. Consequently, the number of trapdoors used to match the ciphertexts grows linearly with the amount of senders. Designing an efficient PAEKS scheme for multiple users remains an open challenge. In this paper, we propose CT-PAEKS, a lattice-based PAEKS scheme with constant trapdoor for data privacy-preserving in mobile cloud computing. CT-PAEKS introduces an additional administrator, enabling the receiver to generate a unified search trapdoor for ciphertexts from multiple senders. Additionally, it allows multiple senders to generate a single ciphertext for the same keyword encryption, thus avoiding ciphertext duplication. Furthermore, CT-PAEKS supports fast search during ciphertext matching, allowing all corresponding ciphertexts to be identified with a single match. We also formalize and prove the security of CT-PAEKS in the random oracle model. Comprehensive performance evaluations indicate that our scheme outperforms prior arts, achieving the 1.7 × −2.7× and 2.0×−4.4× reduction in terms of computational and communication overhead, respectively.

21 October 2024
Verified
Conference Paper
Open access
SXShiyuan Xu
Shiyuan Xu
YCYibo Cao
Yibo Cao
XCXue Chen
Xue Chen
YGYu Guo
Yu Guo
YYYuer Yang
Yuer Yang
SYSiu Ming Yiu
Siu Ming Yiu
With the widespread development of database systems, data security has become crucial when it comes to sharing among users and servers. A straightforward approach involves using searchable encryption to ensure the confidentiality of shared data. However, in certain scenarios, varying user tiers are granted disparate data searching privileges, and administrators need to restrict the searchability of ciphertexts to select users exclusively. To address this issue, public key encryption with authorized keyword search (PEAKS) was proposed, wherein solely authorized users possess the ability to conduct targeted keyword searches. Nonetheless, it is vulnerable to resist quantum computing attacks. As a result, research focusing on authorizing users to search for keywords while achieving quantum security is far-reaching. In this paper, we propose a lattice-based variant of PEAKS (L-PEAKS) that enables keyword dataset authorization for outsourced data management. Unlike existing schemes, our design incorporates identity-based encryption (IBE) to overcome the bottleneck of public key management. Besides, we utilize several lattice sampling algorithms to defend against attacks from quantum adversaries. Specifically, each authorized user must obtain a search privilege from an authority. The authority distributes an authorized token to the user within a specific time period, and the user generates a trapdoor for any authorized keywords. Our scheme is proven to be secure against IND-sID-CKA and T-EUF security in a quantum setting. We also conduct comprehensive evaluations on a commodity machine to assess completeness and provide theoretical complexity comparisons with existing state-of-the-art schemes.

30 October 2025 in Journal of Network and Computer Applications
Verified
Journal Article
Closed access
XFXinyu Fan
Xinyu Fan
SXShiyuan Xu
Shiyuan Xu
YCYibo Cao
Yibo Cao
XCXue Chen
Xue Chen
YCYu Chen
Yu Chen
TXTianrun Xu
Tianrun Xu

20 November 2025 in Computer Networks
Verified
Journal Article
Closed access
YCYibo Cao
Yibo Cao
SXShiyuan Xu
Shiyuan Xu
GXGang Xu
Gang Xu
XCXiu-Bo Chen
Xiu-Bo Chen
YCYuling Chen
Yuling Chen
SYSiu Ming Yiu
Siu Ming Yiu

1 January 2026 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
YCYibo Cao
Yibo Cao
SXShiyuan Xu
Shiyuan Xu
GXGang Xu
Gang Xu
XCXiu-Bo Chen
Xiu-Bo Chen
ZLZongpeng Li
Zongpeng Li
DNDusit Niyato
Dusit Niyato