DARTIC: Decentralized Anonymous Reputation at Scale for Trustworthy Crowdsourcing
Mouhamed Amine Bouchiha, Mourad Rabah, Ronan Champagnat, Abdelaziz Amara Korba, Yacine Ghamri-Doudane

TL;DR
DARTIC is a decentralized framework that ensures anonymous, scalable, and trustworthy reputation management for on-chain crowdsourcing using zkSNARKs and dual-ledger systems.
Contribution
It introduces a novel dual-ledger system with cryptographic proofs to achieve unlinkability, reputation binding, and scalability in decentralized crowdsourcing.
Findings
Proof generation takes less than 3 seconds per user.
Aggregation reduces verification time from 8.7s to 0.96s for 1024 proofs.
Gas costs are reduced by over 100x using zk-batching.
Abstract
On-chain crowdsourcing leverages blockchain's decentralization, transparency, and tamper-resistance to build trustworthy and verifiable Web3 crowdsourced services. However, existing decentralized reputation frameworks do not reconcile anonymity, reputation binding, and scalability. This paper demonstrates how on-chain crowdsourcing can simultaneously achieve these requirements under a trust-minimized model. We introduce DARTIC, a decentralized, anonymous, and scalable reputation-driven framework for crowdsourcing. DARTIC presents a dual-ledger system that enables requesters and workers to use distinct pseudonyms across interactions, ensuring unlinkability while maintaining accountability. To mitigate Sybil and reputation-reset attacks, we employ zkSNARK-based set membership proofs, cryptographically binding all user pseudonyms to a single access token without revealing the linkage. For…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
