BBA+: Improving the Security and Applicability of Privacy-Preserving Point Collection
Gunnar Hartung, Max Hoffmann, Matthias Nagel, Andy Rupp
Abstract
Black-box accumulation (BBA) has recently been introduced as a building-block for a variety of user-centric protocols such as loyalty, refund, and incentive systems. Loosely speaking, this building block may be viewed as a cryptographic "piggy bank" that allows a user to collect points (aka incentives, coins, etc.) in an anonymous and unlinkable way. A piggy bank may be "robbed" at some point by a user, letting her spend the collected points, thereby only revealing the total amount inside the piggy bank and its unique serial number. In this paper we present BBA+, a definitional framework extending the BBA model in multiple ways: (1) We support offline systems in the sense that there does not need to be a permanent connection to a serial number database to check whether a presented piggy bank has already been robbed. (2) We enforce the collection of "negative points" which users may not voluntarily collect, as this is, for example, needed in pre-payment or reputation systems. (3) The security property formalized for BBA+ schemes is stronger and more natural than for BBA: Essentially, we demand that the amount claimed to be inside a piggy bank must be exactly the amount legitimately collected with this piggy bank. As piggy bank transactions need to be unlinkable at the same time, defining
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 78cd3c6d-682d-4ecc-ba0c-35051cb676e8Cited by top-tier papers2
- Sharp: Short Relaxed Range ProofsGeoffroy Couteau, Dahmun Goudarzi, Michael Klooß, Michael ReichleCCS 2022 · 14 citations
- ANONYCALL: Enabling Native Private Calling in Mobile NetworksHexuan Yu, Chaoyu Zhang, Yang Xiao, Angelos D. Keromytis et al.NDSS 2026
Builds on1
Related papers
- Updatable Anonymous Credentials and Applications to Incentive SystemsJohannes Blömer, Jan Bobolz, Denis Diemert, Fabian EidensCCS 2019 · 52 citations
- Device-Bound Anonymous Credentials With(out) Trusted HardwareKarla Friedrichs, Franklin Harding, Anja Lehmann, Anna LysyanskayaEUROCRYPT 2026 · 1 citation
- Revisiting BBS SignaturesStefano Tessaro, Chenzhi ZhuEUROCRYPT 2023 · 58 citations
- Batching, Aggregation, and Zero-Knowledge Proofs in Bilinear AccumulatorsShravan Srinivasan, Ioanna Karantaidou, Foteini Baldimtsi, Charalampos PapamanthouCCS 2022 · 21 citations
- RSA-Based Dynamic Accumulator without Hashing into PrimesVictor Youdom Kemmoe, Anna LysyanskayaCCS 2024 · 4 citations
