Probabilistic Counters for Privacy Preserving Data Aggregation release_x6eazya2wvbadoyxhoygbbryl4

by Dominik Bojko, Krzysztof Grining, Marek Klonowski

Released as a article .

2022  

Abstract

Probabilistic counters are well known tools often used for space-efficient set cardinality estimation. In this paper we investigate probabilistic counters from the perspective of preserving privacy. We use standard, rigid differential privacy notion. The intuition is that the probabilistic counters do not reveal too much information about individuals, but provide only general information about the population. Thus they can be used safely without violating privacy of individuals. It turned out however that providing a precise, formal analysis of privacy parameters of probabilistic counters is surprisingly difficult and needs advanced techniques and a very careful approach. We demonstrate also that probabilistic counters can be used as a privacy protecion mechanism without any extra randomization. That is, the inherit randomization from the protocol is sufficient for protecting privacy, even if the probabilistic counter is used many times. In particular we present a specific privacy-preserving data aggregation protocol based on a probabilistic counter. Our results can be used for example in performing distributed surveys.
In text/plain format

Archived Files and Locations

application/pdf  640.8 kB
file_kfokopdx6naald67vgdape2nru
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2022-01-14
Version   v2
Language   en ?
arXiv  2003.11446v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 3f294a42-6822-4a47-ad17-3c54363f51bb
API URL: JSON