The Boomerang protocol: A Decentralised Privacy-Preserving Verifiable Incentive Protocol (2401.01353v3)
Abstract: In the era of data-driven economies, incentive systems and loyalty programs, have become ubiquitous in various sectors, including advertising, retail, travel, and financial services. While these systems offer advantages for both users and companies, they necessitate the transfer and analysis of substantial amounts of sensitive data. Privacy concerns have become increasingly pertinent, necessitating the development of privacy-preserving incentive protocols. Despite the rising demand for secure and decentralised systems, the existing landscape lacks a comprehensive solution. In this work, we propose the BOOMERANG protocol, a novel decentralised privacy-preserving incentive protocol that leverages cryptographic black box accumulators to securely and privately store user interactions within the incentive system. Moreover, the protocol employs zero-knowledge proofs to transparently compute rewards for users, ensuring verifiability while preserving their privacy. To further enhance public verifiability and transparency, we utilise a smart contract on a Layer 1 blockchain to verify these zero-knowledge proofs. The careful combination of black box accumulators and zero-knowledge proofs makes the BOOMERANG protocol highly efficient.
- Anatoly Yakovenko. Sealevel — parallel processing thousands of smart contracts. https://medium.com/solana-labs/sealevel-parallel-processing-thousands-of-smart-contracts-d814b378192, 2019.
- Anonymous credentials light. pages 1087–1098, 2013.
- Barry Whitehat. roll_up token: Snark-based multi-erc20 side chain. https://github.com/barryWhiteHat/roll_up_token, 2019.
- Scalable, transparent, and post-quantum secure computational integrity. Cryptology ePrint Archive, Report 2018/046, 2018. https://eprint.iacr.org/2018/046.
- Zerocash: Decentralized anonymous payments from bitcoin. pages 459–474, 2014.
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. pages 326–349, 2012.
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. pages 327–357, 2016.
- Bulletproofs: Short proofs for confidential transactions and more. pages 315–334, 2018.
- Privacy-friendly incentives and their application to wikipedia (extended version). Cryptology ePrint Archive, Report 2010/401, 2010. https://eprint.iacr.org/2010/401.
- Curve trees: Practical and transparent zero-knowledge accumulators. Cryptology ePrint Archive, Report 2022/756, 2022. https://eprint.iacr.org/2022/756.
- Refereed delegation of computation. Information and Computation, 226:16–36, 2013. Special Issue: Information Security as a Resource.
- STAR: Secret sharing for private threshold aggregation reporting. pages 697–710, 2022.
- M. Enzmann and M. Schneider. A privacy-friendly loyalty system for electronic marketplaces. In IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE ’04. 2004, pages 385–393, 2004.
- P4TC – provably-secure yet practical privacy-preserving toll collection. Cryptology ePrint Archive, Report 2018/1106, 2018. https://eprint.iacr.org/2018/1106.
- Practical non-interactive publicly verifiable secret sharing with thousands of parties. pages 458–487, 2022.
- Jens Groth. On the size of pairing-based non-interactive arguments. pages 305–326, 2016.
- Efficient non-interactive proof systems for bilinear groups. pages 415–432, 2008.
- Serving ads from localhost for performance, privacy, and profit. In Proceedings of Hot Topics in Networking (HotNets), October 2009.
- BBA+: Improving the security and applicability of privacy-preserving point collection. pages 1925–1942, 2017.
- Black-box wallets: Fast anonymous two-way payments for constrained devices. 2020(1):165–194, January 2020.
- Black-box accumulation: Collecting incentives in a privacy-preserving way. 2016(3):62–82, July 2016.
- A scalable verification solution for blockchains. https://people.cs.uchicago.edu/~teutsch/papers/truebit.pdf, 2017.
- Constant-size commitments to polynomials and their applications. pages 177–194, 2010.
- Demystifying incentives in the consensus computer. pages 706–719, 2015.
- Preda Mihailescu. Dual elliptic primes and applications to cyclotomy primality proving, 2007.
- ucentive: An efficient, anonymous and unlinkable incentives scheme. In 2015 IEEE Trustcom/BigDataSE/ISPA, volume 1, pages 588–595, 2015.
- Anonymity, Unobservability, and Pseudonymity — A Proposal for Terminology, pages 1–9. Springer Berlin Heidelberg, Berlin, Heidelberg, 2001.
- Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression. Technical report, 1998.
- Amicable Pairs and Aliquot Cycles for Elliptic Curves. Experimental Mathematics, 20(3):329 – 357, 2011.
- Adnostic: Privacy preserving targeted advertising. 2010.