Connor Wagaman

Oblivious differential privacy can achieve exponential accuracy under continual observation, while adaptive differential privacy provably fails after a constant number of releases, revealing a stark separation.

Local node differential privacy can achieve accuracy comparable to centralized node privacy for some graph problems, challenging the conventional wisdom that local privacy always implies a significant accuracy loss.