Aggregate Measurement via Oblivious Shuffling

Erik Anderson; Melissa Chase; Wei Dai; F.  Betul Durak; Kim Laine; Siddhart Sharma; Chenkai Weng

Paper 2021/1490

Aggregate Measurement via Oblivious Shuffling

Erik Anderson, Microsoft

Melissa Chase, Microsoft

Wei Dai, Microsoft

F. Betul Durak, Microsoft

Kim Laine, Microsoft

Siddhart Sharma, Microsoft

Chenkai Weng, Northwestern University

Abstract

We introduce a new secure aggregation method for computing aggregate statistics over secret shared data in a client-server setting. Our protocol is particularly suitable for ad conversion measurement computations, where online advertisers and ad networks want to measure the performance of ad campaigns without requiring privacy-invasive techniques, such as third-party cookies. Our protocol has linear complexity in the number of data points and guarantees differentially private outputs. We formally analyze the security and privacy of our protocol and present a performance evaluation with comparison to other approaches proposed for a similar task.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
Keywords: secure computing secure aggregation
Contact author(s): erikan @ microsoft com
mellisac @ microsoft com
wei dai @ microsoft com
betuldurak @ microsoft com
kim laine @ microsoft com
siddhash @ microsoft com
ckweng @ u northwestern edu
History: 2022-08-08: revised; 2021-11-15: received; See all versions
Short URL: https://ia.cr/2021/1490
License: CC BY

BibTeX

@misc{cryptoeprint:2021/1490,
      author = {Erik Anderson and Melissa Chase and Wei Dai and F.  Betul Durak and Kim Laine and Siddhart Sharma 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}
}