Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Probabilistic Counte ...
Article

Probabilistic Counters for Privacy Preserving Data Aggregation

Dominik Bojko (1), Krzysztof Grining, Marek Klonowski (1)
(1) Wrocław University of Science and Technology
Download article
Open on arXiv
Submitted on
July 19, 2023
Accepted on
February 12, 2026
Published on
February 19, 2026
Last modified on
February 19, 2026
Volume 28
vol. 28:2
Combinatorics
DOI
10.46298/dmtcs.11614
License
arXiv.org - Non-exclusive license to distribute
Indicators
390
Views
386
Downloads

Probabilistic Counters for Privacy Preserving Data Aggregation

Dominik Bojko (1), Krzysztof Grining, Marek Klonowski (1)
(1) Wrocław University of Science and Technology
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 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.
Keywords
  • Cryptography and Security
Mathematics Subject Classification 2020
  • 68P15 - Database theory
  • 94A60 - Cryptography
Preview
Loading PDF preview...