PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
April 30, 2026Mathematics0 citationsOpen Access

TD-RCRF: A Privacy-Preserving Truth Discovery Resistant to Collusion and Reputation Fraud in Mobile Crowdsensing

View Full Paper
LBLibo BanLWLei WuWWWei Wu

Key Points

  • This study aims to develop a privacy-preserving truth discovery framework (TD-RCRF) that can resist collusion and reputation fraud in mobile crowdsensing.
  • Proposed a new framework TD-RCRF to protect sensing data and weights using additive secret sharing.
  • Developed a privacy-preserving reputation verification algorithm combining Pedersen commitment and zero-knowledge proof.
  • Established a homomorphic strategy for lightweight truth discovery that improves accuracy by utilizing reputation values.
  • TD-RCRF demonstrated high resistance to collusion and reputation fraud, ensuring privacy.
  • The security analysis confirmed that TD-RCRF remains effective under the non-colluding dual-server model.
  • Theoretical and experimental evaluations indicate TD-RCRF's practicality and efficiency in real-world applications.

Abstract

Privacy-preserving truth discovery (PPTD) has garnered significant attention in mobile crowdsensing (MCS). However, existing research lacks sufficient privacy protection and is often vulnerable to collusion attacks among malicious participants. Moreover, incorrect data submitted by unreliable users and their weights may reduce the accuracy of truth discovery. To address these issues, this paper proposes a privacy-preserving truth discovery framework resistant to collusion and reputation fraud (TD-RCRF) that is highly resistant to collusion and reputation fraud. The scheme employs additive secret sharing to protect sensing data, weights, intermediate results, and ground truth. To screen trustworthy users who meet reputation requirements under the non-colluding dual-server model, we propose a privacy-preserving reputation verification algorithm that combines Pedersen commitment and zero-knowledge proof to verify the validity of mobile users’ reputation values. Additionally, we propose a homomorphic strategy that converts shares between multiplication and addition and use it to design a lightweight truth discovery algorithm that further improves the accuracy of the “truth” using reputation values. Security analysis proves that TD-RCRF is privacy-preserving and secure under the non-colluding dual-server assumption. Theoretical analysis and experiments show that it is practical and efficient.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Ban et al. (2026) studied this question.

synapsesocial.com/papers/69f2f1dc1e5f7920c63877f2https://doi.org/10.3390/math14091474
Ask AI
Helpful
Bookmark
Share
View Full Paper