Rasmus Pagh
Professor
Algorithms and Complexity
Universitetsparken 1
2100 København Ø
ORCID: 0000-0002-1516-9306
11 - 12 out of 12Page size: 10
- 2021
- Published
Efficient differentially private F0 linear sketching
Pagh, Rasmus & Stausholm, N. M., 2021, 24th International Conference on Database Theory, ICDT 2021. Yi, K. & Wei, Z. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 1-19 18. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 186).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
On the Power of Multiple Anonymous Messages: Frequency Estimation and Selection in the Shuffle Model of Differential Privacy
Ghazi, B., Golowich, N., Kumar, R., Pagh, Rasmus & Velingker, A., 2021, Advances in Cryptology – EUROCRYPT 2021 - 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. Canteaut, A. & Standaert, F-X. (eds.). Springer, p. 463-488 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 12698 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
ID: 252282120
Most downloads
-
17
downloads
Efficient differentially private F0 linear sketching
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published