Shaorui Song
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Shaorui Song has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Lei Xu
Beijing Institute of Technology
2 shared publications - Liehuang Zhu
Beijing Institute of Technology
2 shared publications - Yuewei Zhang
School of Cyberspace Science and Technology, Beijing Institute of Technology, China
1 shared publication
Latest Publications
- 15 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 18 (15566013) , 5506-5521
Efficient Defenses Against Output Poisoning Attacks on Local Differential Privacy
Local differential privacy (LDP) is a promising technique to realize privacy-preserving data aggregation without a trusted aggregator. Normally, an LDP protocol requires each user to locally perturb his raw data and submit the perturbed data to the aggregator. Consequently, LDP is vulnerable to output poisoning attacks. Malicious users can skip the perturbation and submit carefully crafted data to the aggregator, altering the data aggregation results. Existing verifiable LDP protocols, which can verify the perturbation process and prevent output poisoning attacks, usually incur significant computation and communication costs, due to the use of zero-knowledge proofs. In this paper, we analyze the attacks on two classic LDP protocols for frequency estimation, namely GRR and OUE, and propose two verifiable LDP protocols. The proposed protocols are based on an interactive framework, where the user and the aggregator complete the perturbation together. By providing some additional information, which reveals nothing about the raw data but helps the verification, the user can convince the aggregator that he is incapable of launching an output poisoning attack. Simulation results demonstrate that the proposed protocols have good defensive performance and outperform existing approaches in terms of efficiency.
- 15 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 18 (15566013) , 5506-5521
Efficient Defenses Against Output Poisoning Attacks on Local Differential Privacy
Local differential privacy (LDP) is a promising technique to realize privacy-preserving data aggregation without a trusted aggregator. Normally, an LDP protocol requires each user to locally perturb his raw data and submit the perturbed data to the aggregator. Consequently, LDP is vulnerable to output poisoning attacks. Malicious users can skip the perturbation and submit carefully crafted data to the aggregator, altering the data aggregation results. Existing verifiable LDP protocols, which can verify the perturbation process and prevent output poisoning attacks, usually incur significant computation and communication costs, due to the use of zero-knowledge proofs. In this paper, we analyze the attacks on two classic LDP protocols for frequency estimation, namely GRR and OUE, and propose two verifiable LDP protocols. The proposed protocols are based on an interactive framework, where the user and the aggregator complete the perturbation together. By providing some additional information, which reveals nothing about the raw data but helps the verification, the user can convince the aggregator that he is incapable of launching an output poisoning attack. Simulation results demonstrate that the proposed protocols have good defensive performance and outperform existing approaches in terms of efficiency.
- Open Access
- 26 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 833-841
Blockchain-based Privacy-Preserving Reputation Management for Crowdsensing
The performance of mobile crowdsensing systems heavily depends on individuals’ participation and the quality of sensing data, because of which the reputation mechanism is of great necessity. However, the mechanism cannot function well if the workers in a crowdsensing system do not behave properly. In this paper, we propose a blockchain-based crowdsensing framework that can resist against the threats to data quality without compromising workers’ privacy. In the proposed framework, a worker is allowed to use different pseudonyms to protect privacy. While the use of pseudonyms will obstruct service providers from evaluating the worker’s reputation. To deal with this issue, we treat reputation as a special type of token, and design a ring signature-based method to anonymously transfer a worker’s reputation score from one pseudonym to another. Moreover, to prevent a malicious worker from taking the advantage of pseudonyms to alter his reputation score, we propose two authentication methods that can verify the legitimacy of a worker’s pseudonym in a privacy-preserving way. The effectiveness of the proposed methods is analyzed theoretically and experimentally.
- 26 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 833-841
Open AccessBlockchain-based Privacy-Preserving Reputation Management for Crowdsensing
The performance of mobile crowdsensing systems heavily depends on individuals’ participation and the quality of sensing data, because of which the reputation mechanism is of great necessity. However, the mechanism cannot function well if the workers in a crowdsensing system do not behave properly. In this paper, we propose a blockchain-based crowdsensing framework that can resist against the threats to data quality without compromising workers’ privacy. In the proposed framework, a worker is allowed to use different pseudonyms to protect privacy. While the use of pseudonyms will obstruct service providers from evaluating the worker’s reputation. To deal with this issue, we treat reputation as a special type of token, and design a ring signature-based method to anonymously transfer a worker’s reputation score from one pseudonym to another. Moreover, to prevent a malicious worker from taking the advantage of pseudonyms to alter his reputation score, we propose two authentication methods that can verify the legitimacy of a worker’s pseudonym in a privacy-preserving way. The effectiveness of the proposed methods is analyzed theoretically and experimentally.