Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zihan Wu 0003

dblp:189/6845-3 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2026
0000-0003-2961-4615ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Privacy and data protection · 46% Cryptographic primitives and cryptanalysis · 46% Blockchain and cryptocurrency security · 7%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › functional encryption
attribute-based encryption
1.012026
BFCrowd: Federated Crowdsourcing With Privacy-Aware and Fine-Grained Task Matching via Blockchain · IEEE Trans. Dependable Secur. Comput. 2026
Cryptographic primitives and cryptanalysis › functional encryption › attribute-based encryption
ciphertext-policy attribute-based encryption
1.012026
BFCrowd: Federated Crowdsourcing With Privacy-Aware and Fine-Grained Task Matching via Blockchain · IEEE Trans. Dependable Secur. Comput. 2026
Privacy and data protection › privacy-preserving computation
privacy-preserving crowdsourcing
1.012026
BFCrowd: Federated Crowdsourcing With Privacy-Aware and Fine-Grained Task Matching via Blockchain · IEEE Trans. Dependable Secur. Comput. 2026
Privacy and data protection › privacy-preserving computation › privacy-preserving matching
privacy-preserving task matching
1.012026
BFCrowd: Federated Crowdsourcing With Privacy-Aware and Fine-Grained Task Matching via Blockchain · IEEE Trans. Dependable Secur. Comput. 2026
Blockchain and cryptocurrency security › permissioned blockchain
consortium blockchain
0.312026
BFCrowd: Federated Crowdsourcing With Privacy-Aware and Fine-Grained Task Matching via Blockchain · IEEE Trans. Dependable Secur. Comput. 2026

Methods — techniques the papers use, named apart from their topics

smart contract · 1.0blockchain · 1.0attribute-based encryption · 1.0
YearPublicationVenuePosition
2026 BFCrowd: Federated Crowdsourcing With Privacy-Aware and Fine-Grained Task Matching via Blockchain
abstract
Nowadays, crowdsourcing has evolved into a cost-efficient and scalable task execution paradigm that benefits both task requesters and workers. Task matching is a crucial crowdsourcing procedure for deciding the task execution quality, but security and privacy concerns arise as the crowdsourcing platform cannot be fully trusted. Existing privacy-aware task-matching schemes are limited to intra-platform central matching in the semi-honest model and coarse-grained keyword/location-based matching over one single attribute. Solutions supporting secure cross-platform and fine-grained task matching in the malicious model are urgently needed. In this paper, we first formally defined BFCrowd, a federated crowdsourcing system built on a consortium blockchain. BFCrowd aggregates multi-platform resources and enables decentralized and reliable cross-platform task matching using smart contracts, in the presence of malicious workers and platforms. Notably, we design a fully secure ciphertext-policy attribute-based encryption scheme with concealed access policies and user-side lightweight decryption, which thoroughly caters to the dual-side privacy demand and resource-limited workers and serves for fine-grained expressive task matching over multiple attributes. Moreover, it supports comparison over numerical attributes. Formal security analysis proves the desirable privacy guarantees in the standard model and collusion resistance. Extensive experiments implemented atop Hyperledger Fabric demonstrate both on-chain and off-chain performance.
Haiqin Wu, Boris Düdder, Zihan Wu 0003, Shunrong Jiang, Liangmin Wang 0001
IEEE Trans. Dependable Secur. Comput.3
2025 GAM: A scalable and efficient multi-chain data sharing scheme
Zihan Wu 0003, Liangmin Wang 0001
Inf. Process. Manag.1
2024 Co-Sharding: A Sharding Scheme for Large-Scale Internet of Things Application
abstract
Blockchain technology finds widespread application in the management of Internet of Things (IoT) devices. In response to the challenges posed by performance scalability and the convergence of multiple ledgers stemming from an expanding network, this study introduces the concept of Co-Sharding . Within this framework, the ledger maintained by sub-chains overseeing IoT operations in distinct geographic regions is conceptualized as a shard within the Large-scale Internet of Things (LIoT) ledger. Meanwhile, elected nodes within each region assume responsibility for maintaining a coordinating shard, facilitating cross-regional communication and data interaction. Furthermore, our work presents a multi-objective optimization algorithm grounded in the multi-shard paradigm to enact a scheduling strategy that spans various regions. We undertake a series of pertinent experiments and conduct a comparative analysis of scheduling algorithms within the context of a real-world cross-regional agricultural IoT system, utilizing actual operational data. The comparative results demonstrate that, in comparison to intra-sub-region scheduling, the Co-Sharding approach enhances machine utilization rates by approximately 30% and reduces scheduling time by around 18% when confronted with a task count of 12. In terms of performance, Co-Sharding also exhibits the capability to reduce the storage requirements of lightweight nodes within each region by approximately 39% while concurrently improving throughput by approximately 1.5 times when contrasted with a single-chain architecture.
Zihan Wu 0003, Liangmin Wang 0001, Xiao Chen 0003, Lu Liu 0001
Distributed Ledger Technol. Res. Pract.3