Wenyi Tang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Wenyi Tang has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Changhao Chenli
Indiana Institute of Technology, USA
3 shared publications - Taeho Jung
Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, USA
3 shared publications - Hyeonbum Lee
Hanyang University
2 shared publications - Akis Linardos
Indiana University School of Medicine, USA
1 shared publication - Avery Hughes
Indiana Institute of Technology
1 shared publication - Bo Qin
Renmin University of China
1 shared publication
Latest Publications
- Open Access
- 24 September 2026
- Published by MDPI AG in Preprints.org
Federated Learning Aggregation (FLAg) Strategies in Healthcare: A Systematic Survey and Taxonomy Based on Technical and Data Challenges
Federated learning (FL) has emerged as a promising novel paradigm for enabling multi-institutional collaborations and expediting data access for training and benchmarking Healthcare AI models, without the need for data centralization. During FL, each collaborator performs local computations on their own data and sends model updates to a central server, which collects and aggregates all model updates into a global consensus model. Several FL aggregation (FLAg) strategies have been developed, each focusing on improving the effectiveness of FL, while addressing distinct technical and data-related challenges – from handling varying resource environments, to patient privacy, and to data imbalance across collaborators. In this article, we provide a systematic survey and taxonomy of FLAg strategies designed for healthcare, paired with their relation to known FL challenges, in our attempt to guide readers navigate and interpret the current scattered body of relevant literature. Our analysis reveals that significant progress has been made in improving model utility and privacy guarantees, while mitigating stragglers, system heterogeneity, fairness and biases, uncertainty, security, and data imbalance. We also touch upon current research gaps between current methodological advances and real-world deployment in healthcare, including limitations in i) evaluation beyond model utility, ii) clinical risk assessment, and iii) governance requirements for transparent and accountable FL.
- 24 September 2026
- Published by MDPI AG in Preprints.org
Open AccessFederated Learning Aggregation (FLAg) Strategies in Healthcare: A Systematic Survey and Taxonomy Based on Technical and Data Challenges
Federated learning (FL) has emerged as a promising novel paradigm for enabling multi-institutional collaborations and expediting data access for training and benchmarking Healthcare AI models, without the need for data centralization. During FL, each collaborator performs local computations on their own data and sends model updates to a central server, which collects and aggregates all model updates into a global consensus model. Several FL aggregation (FLAg) strategies have been developed, each focusing on improving the effectiveness of FL, while addressing distinct technical and data-related challenges – from handling varying resource environments, to patient privacy, and to data imbalance across collaborators. In this article, we provide a systematic survey and taxonomy of FLAg strategies designed for healthcare, paired with their relation to known FL challenges, in our attempt to guide readers navigate and interpret the current scattered body of relevant literature. Our analysis reveals that significant progress has been made in improving model utility and privacy guarantees, while mitigating stragglers, system heterogeneity, fairness and biases, uncertainty, security, and data imbalance. We also touch upon current research gaps between current methodological advances and real-world deployment in healthcare, including limitations in i) evaluation beyond model utility, ii) clinical risk assessment, and iii) governance requirements for transparent and accountable FL.
- Open Access
- 10 September 2026
- Published by Association for Computing Machinery (ACM) in Distributed Ledger Technologies: Research and Practice
\(\text{Trac}^{2}\) ZChain: Trackability and Traceability of Graph Data in Blockchain with Linkage PrivacyBlockchain's tamper-proof, decentralized qualities make it perfect for running shared provenance applications in a distributed setting, such as auditing data sharing or monitoring supply chains. However, blockchain presents challenges when it comes to storing sensitive provenance data, including the data records themselves and their connection, because (1) records cannot be modified due to tamper-proofness, (2) efficient graph tracking/tracing is required for a provenance system on the blockchain, and (3) the linkages between records should be kept from unauthorized users, including the blockchain maintainers. Existing methods either lack sufficient privacy protection, only support simple structures, or inadvertently reveal linkage volume with the UTXO model. We present \(\text{Trac}^{2}\) ZChain, which is based on our previous work Trac \({}^{2}\) Chain[57], a framework that provides complete linkage privacy (i.e., no leakages from record sizes) and full tracking/tracing functions for blockchain-stored provenance graphs. The innovative graph storage architecture presented in [57] enables the generation of provenance dependencies for arbitrary graph structures while maintaining the tamper-proofness of blockchain. However, the previous work does not provide the blockchain with the ability to verify the authenticity of the provenance record, which should be an essential property of any blockchain-based system. In \(\text{Trac}^{2}\) ZChain, we modified the original Trac \({}^{2}\) Chain protocols to make it feasible to apply zero-knowledge proof, which allows blockchain peers to verify the correctness of the on-chain provenance functions without learning private information. The evaluation and comparison demonstrate that \(\text{Trac}^{2}\) ZChain achieves efficient provenance functions, verification of records, and linkage privacy protections, and has reasonable overhead compared to the state-of-the-art approaches.- 10 September 2026
- Published by Association for Computing Machinery (ACM) in Distributed Ledger Technologies: Research and Practice
Open Access\(\text{Trac}^{2}\) ZChain: Trackability and Traceability of Graph Data in Blockchain with Linkage PrivacyBlockchain's tamper-proof, decentralized qualities make it perfect for running shared provenance applications in a distributed setting, such as auditing data sharing or monitoring supply chains. However, blockchain presents challenges when it comes to storing sensitive provenance data, including the data records themselves and their connection, because (1) records cannot be modified due to tamper-proofness, (2) efficient graph tracking/tracing is required for a provenance system on the blockchain, and (3) the linkages between records should be kept from unauthorized users, including the blockchain maintainers. Existing methods either lack sufficient privacy protection, only support simple structures, or inadvertently reveal linkage volume with the UTXO model. We present \(\text{Trac}^{2}\) ZChain, which is based on our previous work Trac \({}^{2}\) Chain[57], a framework that provides complete linkage privacy (i.e., no leakages from record sizes) and full tracking/tracing functions for blockchain-stored provenance graphs. The innovative graph storage architecture presented in [57] enables the generation of provenance dependencies for arbitrary graph structures while maintaining the tamper-proofness of blockchain. However, the previous work does not provide the blockchain with the ability to verify the authenticity of the provenance record, which should be an essential property of any blockchain-based system. In \(\text{Trac}^{2}\) ZChain, we modified the original Trac \({}^{2}\) Chain protocols to make it feasible to apply zero-knowledge proof, which allows blockchain peers to verify the correctness of the on-chain provenance functions without learning private information. The evaluation and comparison demonstrate that \(\text{Trac}^{2}\) ZChain achieves efficient provenance functions, verification of records, and linkage privacy protections, and has reasonable overhead compared to the state-of-the-art approaches. - Open Access
A Decentralized Retrieval Augmented Generation System with Source Reliabilities Secured on Blockchain
Existing retrieval-augmented generation (RAG) systems typically use a centralized architecture, causing a high cost of data collection, integration, and management, as well as privacy concerns. There is a great need for a decentralized RAG system that enables foundation models to utilize information directly from data owners who maintain full control over their sources. However, decentralization brings a challenge: the numerous independent data sources vary significantly in reliability, which can diminish retrieval accuracy and response quality. To address this, our decentralized RAG system has a novel reliability scoring mechanism that dynamically evaluates each source based on the quality of responses it contributes to generate and prioritizes high-quality sources during retrieval. To ensure transparency and trust, the scoring process is securely managed through blockchain-based smart contracts, creating verifiable and tamper-proof reliability records without relying on a central authority. We evaluate our decentralized system with two Llama models (3B and 8B) in two simulated environments where six data sources have different levels of reliability. Our system achieves a +10.7\% performance improvement over its centralized counterpart in the real world-like unreliable data environments. Notably, it approaches the upper-bound performance of centralized systems under ideally reliable data environments. The decentralized infrastructure enables secure and trustworthy scoring management, achieving approximately 56\% marginal cost savings through batched update operations. Our code and system are open-sourced at github.com/yining610/Reliable-dRAG.
Open AccessA Decentralized Retrieval Augmented Generation System with Source Reliabilities Secured on Blockchain
Existing retrieval-augmented generation (RAG) systems typically use a centralized architecture, causing a high cost of data collection, integration, and management, as well as privacy concerns. There is a great need for a decentralized RAG system that enables foundation models to utilize information directly from data owners who maintain full control over their sources. However, decentralization brings a challenge: the numerous independent data sources vary significantly in reliability, which can diminish retrieval accuracy and response quality. To address this, our decentralized RAG system has a novel reliability scoring mechanism that dynamically evaluates each source based on the quality of responses it contributes to generate and prioritizes high-quality sources during retrieval. To ensure transparency and trust, the scoring process is securely managed through blockchain-based smart contracts, creating verifiable and tamper-proof reliability records without relying on a central authority. We evaluate our decentralized system with two Llama models (3B and 8B) in two simulated environments where six data sources have different levels of reliability. Our system achieves a +10.7\% performance improvement over its centralized counterpart in the real world-like unreliable data environments. Notably, it approaches the upper-bound performance of centralized systems under ideally reliable data environments. The decentralized infrastructure enables secure and trustworthy scoring management, achieving approximately 56\% marginal cost savings through batched update operations. Our code and system are open-sourced at github.com/yining610/Reliable-dRAG.
- 22 September 2025
- Published by Springer Nature
- p. 115-124
SecLog: Atomic-Swap Based Secure Logging for Decentralized Data Sharing
- 22 September 2025
- Published by Springer Nature
- p. 115-124
SecLog: Atomic-Swap Based Secure Logging for Decentralized Data Sharing
- 5 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 21 (5) , 4827-4842
Fair2Trade: Digital Trading Platform Ensuring Exchange and Distribution Fairness
Online data trading is increasingly prevalent as data are becoming valuable assets. In most common conventional data trading scenarios, three parties (seller, broker, and buyer) exist, and fairness in trading is essential. This paper discusses and solves the fairness problem in two aspects. First, we consider exchange fairness , which requires payments and data exchanged correctly between buyers and the broker. In existing solutions, keys of encrypted data are traded. However, these solutions failed to provide a complete and secure design for validating keys' correctness unless they used generic theoretical but expensive methods, e.g., zk-SNARK. We address this security issue by designing a new key verification mechanism. We also present a novel atomic exchange protocol based on Hashed Timelock Contracts on Ethereum, reducing gas consumption compared to the existing approach. Second, we consider distribution fairness , which requires correctly splitting income between the broker and sellers. Straightforward solutions are impractical, i.e., sellers participating in every transaction or traversing the blockchain. Therefore, we design a verifiable statement protocol for sellers to verify the income split efficiently. Further, analysis and experimental results indicate that extra fairness properties are securely achieved, and our protocol reduces users' on-chain participation compared to state-of-the-art protocols.
- 5 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 21 (5) , 4827-4842
Fair2Trade: Digital Trading Platform Ensuring Exchange and Distribution Fairness
Online data trading is increasingly prevalent as data are becoming valuable assets. In most common conventional data trading scenarios, three parties (seller, broker, and buyer) exist, and fairness in trading is essential. This paper discusses and solves the fairness problem in two aspects. First, we consider exchange fairness , which requires payments and data exchanged correctly between buyers and the broker. In existing solutions, keys of encrypted data are traded. However, these solutions failed to provide a complete and secure design for validating keys' correctness unless they used generic theoretical but expensive methods, e.g., zk-SNARK. We address this security issue by designing a new key verification mechanism. We also present a novel atomic exchange protocol based on Hashed Timelock Contracts on Ethereum, reducing gas consumption compared to the existing approach. Second, we consider distribution fairness , which requires correctly splitting income between the broker and sellers. Straightforward solutions are impractical, i.e., sellers participating in every transaction or traversing the blockchain. Therefore, we design a verifiable statement protocol for sellers to verify the income split efficiently. Further, analysis and experimental results indicate that extra fairness properties are securely achieved, and our protocol reduces users' on-chain participation compared to state-of-the-art protocols.