An Efficient Private Set Frequency Query Scheme Under Local Differential Privacy

Crowdsourcing has become a widely utilized method for data collection and analysis; however, privacy concerns remain a significant challenge. In this paper, we introduce a novel and efficient private set frequency (PSF) query scheme designed for crowdsourcing scenarios. Our proposed scheme is based on edge computing and leverages local differential privacy (LDP) and Bloom filter techniques to ensure both query privacy and high communication efficiency. Specifically, we employ two non-colluding edge devices to assist the server in achieving highaccuracy query result estimation while preserving the privacy of both the server's query set and users' sensitive data. A comprehensive security analysis confirms that the query value remains confidential, and users' privacy is guaranteed under <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\varepsilon$</tex>-LDP. Additionally, performance evaluations demonstrate the efficiency and improved accuracy of our proposed scheme.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/icc52391.2025.11161185
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Efficient Private Set Frequency Query Scheme Under Local Differential Privacy

Ellen Z. Zhang, Yunguo Guan, Rongxing Lu, Harry Zhang
Cryptography and Data Security
article

An Efficient Private Set Frequency Query Scheme Under Local Differential Privacy

Ellen Z. Zhang, Yunguo Guan, Rongxing Lu, Harry Zhang
article en

Abstract

Crowdsourcing has become a widely utilized method for data collection and analysis; however, privacy concerns remain a significant challenge. In this paper, we introduce a novel and efficient private set frequency (PSF) query scheme designed for crowdsourcing scenarios. Our proposed scheme is based on edge computing and leverages local differential privacy (LDP) and Bloom filter techniques to ensure both query privacy and high communication efficiency. Specifically, we employ two non-colluding edge devices to assist the server in achieving highaccuracy query result estimation while preserving the privacy of both the server's query set and users' sensitive data. A comprehensive security analysis confirms that the query value remains confidential, and users' privacy is guaranteed under <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\varepsilon$</tex>-LDP. Additionally, performance evaluations demonstrate the efficiency and improved accuracy of our proposed scheme.

University of New Brunswick (CA), Eastern Michigan University (US), Queen's University (CA)
Openalex Percentile: Top 86%
Cryptography and Data Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

An Efficient Private Set Frequency Query Scheme Under Local Differential Privacy — Ellen Z. Zhang, Yunguo Guan, et al. · (2025) | TGRS Research Map | TGRS