Cryptology ePrint Archive: Report 2021/1490

Aggregate Measurement via Oblivious Shuffling

Erik Anderson and Melissa Chase and F. Betul Durak and Esha Ghosh and 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.

Category / Keywords: cryptographic protocols /

Date: received 9 Nov 2021

Contact author: betuldurak at microsoft com, car1ckweng at gmail com, melissac at microsoft com

Available format(s): PDF | BibTeX Citation

Version: 20211115:124845 (All versions of this report)

Short URL: ia.cr/2021/1490


[ Cryptology ePrint archive ]