Minimax Binary Counting under Shuffle Privacy: Poisson Limits and Randomized-Response Optimality

We study estimation of a deterministic binary count from the shuffled outputs of a common single-message local channel. Privacy is required for every neighboring composition at fixed global parameters $(\varepsilon,δ)$, and estimators may be biased. We obtain uniform critical Poisson and Skellam app