An introduction to local differential privacy protocols using block designs
This paper introduces Local Differential Privacy (LDP) protocols and their relationship with block designs, specifically Balanced Incomplete Block Designs (BIBDs). It proves that pure LDP protocols are equivalent to $(r, ext{l})$-designs. The paper shows that optimal estimators for these BIBD-based LDP schemes are derived from the Moore-Penrose inverse of the transition probability matrix.