Dominik Bojko ; Krzysztof Grining ; Marek Klonowski - Probabilistic Counters for Privacy Preserving Data Aggregation

dmtcs:11614 - Discrete Mathematics & Theoretical Computer Science, February 19, 2026, vol. 28:2 - https://doi.org/10.46298/dmtcs.11614
Probabilistic Counters for Privacy Preserving Data AggregationArticle

Authors: Dominik Bojko ; Krzysztof Grining ; Marek Klonowski

    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 the 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. Therefore, they can be used safely without violating the privacy of individuals. However, it turned out, that providing a precise, formal analysis of the privacy parameters of probabilistic counters is surprisingly difficult and needs advanced techniques and a very careful approach.
    We demonstrate that probabilistic counters can be used as a privacy protection mechanism without extra randomization. Namely, the inherent randomization from the protocol is sufficient for protecting privacy, even if the probabilistic counter is used multiple times. In particular, we present a specific privacy-preserving data aggregation protocol based on Morris Counter and MaxGeo Counter. Some of the presented results are devoted to counters that have not been investigated so far from the perspective of privacy protection. Another part is an improvement of previous results. We show how our results can be used to perform distributed surveys and compare the properties of counter-based solutions and a standard Laplace method.


    Volume: vol. 28:2
    Section: Combinatorics
    Published on: February 19, 2026
    Accepted on: February 12, 2026
    Submitted on: July 20, 2023
    Keywords: Cryptography and Security