Explore a groundbreaking paper on private aggregation techniques presented at Eurocrypt 2020. Delve into the innovative algorithm proposed by Ghazi, Manurangsi, Pagh, and Velingker that achieves efficient aggregation from fewer anonymous messages. Examine the uniform distribution approach, variance analysis, and lower bound considerations that form the core of this research. Gain insights into how this work contributes to advancing privacy-preserving data aggregation methods in cryptography and data science.
Overview
Syllabus
Introduction
Algorithm
Uniform Distribution
Variance
Lower Bound
Taught by
TheIACR