R. Bassily, K. Nissim, U. Stemmer, and A. G. Thakurta, Practical locally private heavy hitters, NIPS, 2017.

G. Blom, Some properties of incomplete U -statistics, Biometrika, vol.63, issue.3, pp.573-580, 1976.

J. Champion, A. Shelat, and J. Ullman, Securely sampling biased coins with applications to differential privacy, IACR Cryptology ePrint Archive, p.823, 2019.

I. Damgård, V. Pastro, N. P. Smart, and S. Zakarias, Multiparty computation from somewhat homomorphic encryption, IACR Cryptology ePrint Archive, p.535, 2011.

C. Dwork, K. Kenthapadi, F. Mcsherry, I. Mironov, and M. Naor, Our data, ourselves: Privacy via distributed noise generation, EUROCRYPT, 2006.

D. Evans, V. Kolesnikov, and M. Rosulek, A pragmatic introduction to secure multi-party computation, Foundations and Trends in Privacy and Security, vol.2, issue.2-3, pp.70-246, 2018.

O. Goldreich, The Foundations of Cryptography, Basic Applications, vol.2, 2004.

O. Goldreich, S. Micali, and A. Wigderson, How to play any mental game or A completeness theorem for protocols with honest majority, STOC, pp.218-229, 1987.

T. Kulkarni, G. Cormode, and D. Srivastava, Answering range queries under local differential privacy, SIGMOD, 2019.

Y. Lindell and B. Pinkas, A proof of security of yao's protocol for two-party computation, Journal of Cryptology, vol.22, issue.2, pp.161-188, 2009.

A. C. Yao, How to generate and exchange secrets (extended abstract), FOCS, 1986.