Interactive LEDP improves subgraph counting accuracy by factor of sqrt n
A two-round interactive algorithm for subgraph counting under local edge differential privacy improves additive error by a factor of sqrt n compared to noninteractive approaches.