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

Menglun Zhou

dblp:342/5067 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
0000-0002-3936-5571ORCID · corroborated

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

Computer networks · 1 · 1 first-author · 1 since 2021Security and privacy · 1 · 1 since 2021Software engineering, systems software and programming languages · 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
2 papers
Privacy and data protection · 100%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%
Computer networks
1 paper
Internet of things and sensor networks · 100%

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

TopicWeightPapersLastEvidence papers
Privacy and data protection › privacy-preserving computation
privacy-preserving crowdsourcing
0.912025
Privacy-Preserving Competitive Detour Tasking in Spatial Crowdsourcing · IEEE Trans. Serv. Comput. 2025
Privacy and data protection › location privacy
spatial crowdsourcing
0.912025
Privacy-Preserving Competitive Detour Tasking in Spatial Crowdsourcing · IEEE Trans. Serv. Comput. 2025
Privacy and data protection
location privacy
0.812024
SecDR: Enabling Secure, Efficient, and Accurate Data Recovery for Mobile Crowdsensing · IEEE Trans. Dependable Secur. Comput. 2024
Algorithmic game theory and mechanism design › resource allocation
task allocation
0.312025
Privacy-Preserving Competitive Detour Tasking in Spatial Crowdsourcing · IEEE Trans. Serv. Comput. 2025
Internet of things and sensor networks
mobile crowdsensing
0.212024
SecDR: Enabling Secure, Efficient, and Accurate Data Recovery for Mobile Crowdsensing · IEEE Trans. Dependable Secur. Comput. 2024
Privacy and data protection › privacy-preserving data analysis
privacy-preserving data collection
0.212024
SecDR: Enabling Secure, Efficient, and Accurate Data Recovery for Mobile Crowdsensing · IEEE Trans. Dependable Secur. Comput. 2024

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

lightweight cryptography · 3.3compressive sensing · 1.5
YearPublicationVenuePosition
2025 Privacy-Preserving Competitive Detour Tasking in Spatial Crowdsourcing
abstract
Spatial crowdsourcing (SC) has recently emerged as a new crowdsourcing service paradigm, where workers move physically to designated locations to perform tasks. Most SC systems perform task assignment based on the spatial proximity between task locations and worker locations. Under such a strategy, workers can only perform tasks near them, which may result in low social welfare (i.e., the total profit of the platform and workers). In contrast, the newly emerging strategy of competitive task assignment (CTA) stimulates workers to compete for their preferred tasks, allowing optimization of the overall profit of SC systems. Among others, one novel CTA setting is competitive detour tasking, which allows workers to compete for tasks that need them to make detours from their original travel paths. However, it requires collecting each worker’s bidding profile which may expose private information. In light of this, in this article, we design, implement, and evaluate PrivCO, a new system framework enabling privacy-preserving competitive detour tasking services in SC. PrivCO delicately bridges state-of-the-art competitive detour tasking algorithms with lightweight cryptography, providing strong protections for workers’ bidding profiles. Extensive experiments over real-world datasets demonstrate that while offering strong security guarantees, PrivCO achieves social welfare comparable to the plaintext domain.
Yifeng Zheng 0001, Menglun Zhou, Songlei Wang, Zhongyun Hua, Jinghua Jiang, Yansong Gao 0001
IEEE Trans. Serv. Comput.2
2024 SecDR: Enabling Secure, Efficient, and Accurate Data Recovery for Mobile Crowdsensing
abstract
Mobile crowdsensing (MCS) has rapidly emerged as a popular paradigm for sensory data collection and benefited various location-based services and applications like road monitoring, smart transportation, and environmental monitoring. In practice, there often exist data-missing regions in the target sensing area, due to factors like limited budget, large area size, and scarcity of participants. This poses a demand for data recovery, which is commonly done based on the compressive sensing (CS) technique. However, CS-based data recovery requires access to sensory data tagged with locations, raising critical concerns on participants’ location privacy. While a plethora of location privacy techniques exist, most of them breach the data correlation inherently required by CS-based data recovery. Meanwhile, existing works mostly focus on protecting locations and overlook sensory data which may also indirectly lead to location leakages. In this paper, we propose SecDR, a new system design supporting secure, efficient, and accurate data recovery for location-based MCS applications. SecDR protects both locations and sensory data, and is built from a delicate synergy of CS-based data recovery and lightweight cryptography techniques. Extensive evaluations demonstrate that SecDR achieves promising performance and, even with stronger security guarantees, outperforms the state-of-the-art, with accuracy close to the plaintext domain.
Yifeng Zheng 0001, Menglun Zhou, Songlei Wang, Hejiao Huang, Xiaohua Jia, Xun Yi, Cong Wang 0001
IEEE Trans. Dependable Secur. Comput.2
2023 PPTA: A location privacy-preserving and flexible task assignment service for spatial crowdsourcing
Menglun Zhou, Yifeng Zheng 0001, Songlei Wang, Zhongyun Hua, Hejiao Huang, Yansong Gao 0001, Xiaohua Jia
Comput. Networks1