{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:06:45Z","timestamp":1758845205053},"reference-count":0,"publisher":"Privacy Enhancing Technologies Symposium Advisory Board","issue":"3","license":[{"start":{"date-parts":[[2016,5,6]],"date-time":"2016-05-06T00:00:00Z","timestamp":1462492800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,7,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>We formalize and construct black-box accumulation (BBA), a useful building block for numerous important user-centric protocols including loyalty systems, refund systems, and incentive systems (as, e.g., employed in participatory sensing and vehicle-to-grid scenarios). A core requirement all these systems share is a mechanism to let users collect and sum up values (call it incentives, bonus points, reputation points, etc.) issued by some other parties in a privacy-preserving way such that curious operators may not be able to link the different transactions of a user. At the same time, a group of malicious users may not be able to cheat the system by pretending to have collected a higher amount than what was actually issued to them.<\/jats:p>\n               <jats:p>As a first contribution, we fully formalize the core functionality and properties of this important building block. Furthermore, we present a generic and non-interactive construction of a BBA system based on homomorphic commitments, digital signatures, and non-interactive zero-knowledge proofs of knowledge. For our construction, we formally prove security and privacy properties. Finally, we propose a concrete instantiation of our construction using Groth-Sahai commitments and proofs as well as the optimal structure-preserving signature scheme of Abe et al. and analyze its efficiency.<\/jats:p>","DOI":"10.1515\/popets-2016-0016","type":"journal-article","created":{"date-parts":[[2016,5,6]],"date-time":"2016-05-06T10:01:38Z","timestamp":1462528898000},"page":"62-82","source":"Crossref","is-referenced-by-count":12,"title":["Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way"],"prefix":"10.56553","volume":"2016","author":[{"given":"Tibor","family":"Jager","sequence":"first","affiliation":[{"name":"Ruhr-University Bochum"}]},{"given":"Andy","family":"Rupp","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology"}]}],"member":"35752","published-online":{"date-parts":[[2016,5,6]]},"container-title":["Proceedings on Privacy Enhancing Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/content.sciendo.com\/view\/journals\/popets\/2016\/3\/article-p62.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.sciendo.com\/article\/10.1515\/popets-2016-0016","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T16:29:21Z","timestamp":1658334561000},"score":1,"resource":{"primary":{"URL":"https:\/\/petsymposium.org\/popets\/2016\/popets-2016-0016.php"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,6]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2016,5,6]]},"published-print":{"date-parts":[[2016,7,1]]}},"alternative-id":["10.1515\/popets-2016-0016"],"URL":"https:\/\/doi.org\/10.1515\/popets-2016-0016","relation":{},"ISSN":["2299-0984"],"issn-type":[{"value":"2299-0984","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,6]]}}}