On the round complexity of the shuffle model

DOI10.1007/978-3-030-64378-2_24zbMath1485.94054arXiv2009.13510OpenAlexW3088385610MaRDI QIDQ2119066

Iftach Haitner, Kobbi Nissim, Amos Beimel, Uri Stemmer

Publication date: 23 March 2022

Full work available at URL: https://arxiv.org/abs/2009.13510

zbMATH Keywords

differential privacysecure multiparty computationshuffle model

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

This page was built for publication: On the round complexity of the shuffle model