Author of the publication

Private Aggregation from Fewer Anonymous Messages.

, , , and . EUROCRYPT (2), volume 12106 of Lecture Notes in Computer Science, page 798-827. Springer, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Improved Lower Bound for Differentially Private Facility Location.. CoRR, (2024)Even 1×n Edge-Matching and Jigsaw Puzzles are Really Hard., , , , , and . CoRR, (2017)Almost-Polynomial Ratio ETH-Hardness of Approximating Densest k-Subgraph.. Electron. Colloquium Comput. Complex., (2016)The Price of Justified Representation., , , , , and . AAAI, page 4983-4990. AAAI Press, (2022)A Note on Max k-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and Improved Approximation.. SOSA, volume 69 of OASIcs, page 15:1-15:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Improved Inapproximability of VC Dimension and Littlestone's Dimension via (Unbalanced) Biclique.. ITCS, volume 251 of LIPIcs, page 85:1-85:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Algorithms with More Granular Differential Privacy Guarantees., , , and . ITCS, volume 251 of LIPIcs, page 54:1-54:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Private Robust Estimation by Stabilizing Convex Relaxations., , and . COLT, volume 178 of Proceedings of Machine Learning Research, page 723-777. PMLR, (2022)Cryptographic Hardness of Learning Halfspaces with Massart Noise., , , and . NeurIPS, (2022)Deep Learning with Label Differential Privacy., , , , and . NeurIPS, page 27131-27145. (2021)