Paper 2021/1490

Aggregate Measurement via Oblivious Shuffling

Erik Anderson, Melissa Chase, F. Betul Durak, Esha Ghosh, Kim Laine, and Chenkai Weng

Abstract

We introduce a secure histogram aggregates method which is suitable for many applications such as ad conversion measurements. Our solution relies on three-party computation with linear complexity and guarantees differentially private histogram outputs. We formally analyse the security and privacy of our method and compare it with existing proposals. Finally, we conclude our report with a performance analysis.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint. Minor revision.
Contact author(s)
betuldurak @ microsoft com
car1ckweng @ gmail com
melissac @ microsoft com
History
2021-11-15: received
Short URL
https://ia.cr/2021/1490
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2021/1490,
      author = {Erik Anderson and Melissa Chase and F.  Betul Durak and Esha Ghosh and Kim Laine and Chenkai Weng},
      title = {Aggregate Measurement via Oblivious Shuffling},
      howpublished = {Cryptology ePrint Archive, Paper 2021/1490},
      year = {2021},
      note = {\url{https://eprint.iacr.org/2021/1490}},
      url = {https://eprint.iacr.org/2021/1490}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.