Before revision:  We obtain lower bounds on the minimax sample complexity of interactive protocols under local information constraints, a broad family of resource constraints which captures communication constraints , local differential privacy , and noisy binary queries as special cases .
After revision:  We obtain lower bounds on the minimax sample complexity of interactive protocols under local information constraints, e.g., communication constraints and local differential privacy , and noisy binary queries as special cases .