Shiyuan Xu

Dr. Shiyuan Xu

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-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.

4 June 2025 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
GXGang Xu
Gang Xu
SXShiyuan Xu
Shiyuan Xu
XFXinyu Fan
Xinyu Fan
YCYibo Cao
Yibo Cao
YMYanhui Mao
Yanhui Mao
XCXiu-Bo Chen
Xiu-Bo Chen
The Industrial Internet of Things (IIoT) has been widely studied, which dramatically enhanced the manufacturing efficiency and service elasticity. However, how to ensure the data confidentiality and security in the event-driven publish/subscribe communication model becomes a cumbersome problem. To address this concern, ring signatures have been researched deeply. Nevertheless, existing solutions have large computational burdens and neglect to incorporate reporting and tracing features, which makes it impractical for IIoT. In this way, research focus on designing an efficient report and traceable ring signature is still far-reaching. In this article, we propose RAT ring, a novel report and traceable ring signature, which provides publisher authentication, anonymous communication, reporting, and tracing. To achieve this, we adopt the zero knowledge proof to verify the authenticity of publisher data, and the signature of knowledge to trace the signature. Then, we formalize and prove the security of our scheme. Eventually, through comprehensive performance evaluation, our scheme outperforms prior works by approximately up to 51 times in terms of total computational overhead. These results demonstrate that our design is practical and effective for data privacy-preserving in IIoT.

1 July 2022 in Computer Networks
Verified
Journal Article
Closed access
YCYibo Cao
Yibo Cao
SXShiyuan Xu
Shiyuan Xu
XCXue Chen
Xue Chen
YHYunhua He
Yunhua He
SJShuo Jiang
Shuo Jiang

26 September 2024 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
GXGang Xu
Gang Xu
DKDe-Lun Kong
De-Lun Kong
KZKejia Zhang
Kejia Zhang
SXShiyuan Xu
Shiyuan Xu
YCYibo Cao
Yibo Cao
XCXiu-Bo Chen
Xiu-Bo Chen
Introduced by Google in 2016, federated learning (FL) is a distributed machine learning framework to ensure data privacy amid the surge in big data. FL enables secure data sharing without accessing local data. Despite its advantages, it faces challenges due to the limited participation of the data owner. To address this, this article proposes the model value transfer incentive (MVTI) to enhance FL incentives for Artificial Intelligence of Things (AIoT). MVTI allows active participation of data requesters in FL training, addressing limited data owner engagement, and facilitating personalized model construction. The integrated model bail and contribution assessment mechanism ensures fair benefit redistribution. Using smart contracts (SCs) and interplanetary file system (IPFS) enhances security and reliability, ensuring transparent and tamper-resistant execution for secure transactions and data integrity. Our experiments highlight MVTI’s superiority in addressing FL incentive challenges for AIoT compared to state-of-the-art baselines on real-world datasets. We also demonstrate the compatibility of multiple gradient protections with incentive mechanisms, especially with gradient compression. The proposed SC-MVTI scheme is resilient and demonstrates the potential to significantly improve the overall efficacy of the FL system within incentive frameworks.

18 December 2024 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Open access
SXShiyuan Xu
Shiyuan Xu
XCXue Chen
Xue Chen
YGYu Guo
Yu Guo
SYSiu Ming Yiu
Siu Ming Yiu
SGShang Gao
Shang Gao
BXBin XIAO
Bin XIAO
Internet of Medical Things (IoMT) has gained significant research focus in both academic and medical institutions. Nevertheless, the sensitive data involved in IoMT raises concerns regarding user validation and data privacy. To address these concerns, certificateless signcryption (CLSC) has emerged as a promising solution, offering authenticity, confidentiality, and unforgeability. Unfortunately, most existing CLSC schemes are impractical for IoMT due to their heavy computational and storage requirements. Additionally, these schemes are vulnerable to quantum computing attacks. Therefore, research focusing on designing an efficient post-quantum CLSC scheme is still farreaching. In this work, we propose PQ-CLSCL, a novel post-quantum CLSC scheme with linkability for IoMT. Our proposed design facilitates secure transmission of medical data between physicians and patients, effectively validating user legitimacy and minimizing the risk of private information leakage. To achieve this, we leverage lattice sampling algorithms and hash functions to generate the partial secret key, and then employ the sign-then-encrypt method as well as design link label. We also formalize and prove the security of our design, including indistinguishability against chosen-ciphertext attacks (IND-CCA2), existential unforgeability against chosen-message attacks (EU-CMA), and linkability. Finally, through comprehensive performance evaluation, our computation overhead is just 5% of some other existing schemes. The evaluation results demonstrate that our solution is practical and efficient.

18 September 2024 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
XCXue Chen
Xue Chen
SXShiyuan Xu
Shiyuan Xu
SGShang Gao
Shang Gao
YGYu Guo
Yu Guo
SYSiu Ming Yiu
Siu Ming Yiu
BXBin XIAO
Bin XIAO
Ring signatures have been extensively researched for Cloud-assisted Electronic Medical Records (EMRs) sharing, aiming to address the challenge of “medical information silos” while safeguarding the privacy of patients’ personal information and the security of EMRs. However, most existing EMRs sharing systems that utilize ring signatures are vulnerable to quantum attacks, posing a severe challenge for the e-health scenario. To alleviate this issue, some studies have been conducted on latticebased ring signatures. Nevertheless, there still exist two challenges. Firstly, current schemes fail to verify if multiple EMRs come from the same signer, undermining e-health reliability. Additionally, adversaries can exploit weaknesses in the network security of signers’ secret keys to forge signatures. In this paper, we propose an efficient lattice-based linkable ring signature (LLRS) for EMRs sharing to ensure patient privacy through anonymity, EMRs security through unforgeability, and checking the linkability for multiple signatures. We then present an enhancement scheme, called FS-LLRS, to additionally offer forward security, ensuring the security of previous ring signatures even if the current key has been compromised. To achieve this, we introduce a binary tree structure to divide time periods and leverage lattice basis algorithms for one-way secret key evolution, allowing users to update the secret keys periodically. Ultimately, we conduct a rigorous security analysis and compare our primitives with prior arts. In computational cost, the best performance of our LLRS and FS-LLRS schemes are just 0.17 and 0.34 times compared to others, respectively. Our LLRS scheme only incurs 0.08 times the communication overhead of others.