REVIEW 3 minor 13 references
Differential Privacy over Hamming Codes
T0 review · 0 major / 3 minor · reviewed 2026-06-29 · grok-4.3
Pith's one-line read An optimal codeword arrangement for Hamming codes over BSC strictly improves differential privacy without added overhead or utility loss.
desk verdict The paper shows a codeword re-arrangement in Hamming codes tightens DP for counting queries over BSC with no extra cost or error penalty. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The optimal codeword arrangement that re-maps messages to codewords to extract more privacy from the existing channel noise.
What would settle it
Direct comparison of the differential privacy parameter achieved by the optimal arrangement versus a standard one, measured at identical end-to-end decoding error probability.
Extended reading notes
Core claim
Deriving an optimal codeword arrangement allows the transmission of counting query outputs over BSC with Hamming codes to achieve strictly better differential privacy guarantees while incurring no real-time computational overhead and no degradation in utility.
Load-bearing premise
An optimal codeword arrangement exists for Hamming codes over BSC that improves differential privacy without requiring additional real-time obfuscation or increasing end-to-end error probability.
Editorial extensions
If this is right
- Privacy level rises solely through the choice of how messages map to codewords.
- No additional real-time data obfuscation is required for the improvement.
- End-to-end error probability after decoding remains unchanged.
- The improvement applies to the transmission of counting query outputs.
Reading between the lines
- Code mapping choices may serve as an additional lever for privacy in other noisy-channel settings.
- The same rearrangement idea could be tested on different linear codes or channel models.
- Protocol designers might incorporate such static mappings to reduce reliance on separate privacy layers.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript considers transmission of counting-query outputs over a BSC using Hamming codes as channel encoders. It derives an optimal bijection from query outputs to codewords that strictly improves the resulting differential-privacy parameter while leaving the end-to-end block-error probability unchanged and incurring no additional real-time computation.
Significance. The result shows that the fixed geometry of a perfect code under ML decoding can be exploited to tighten the output likelihood ratios that govern DP without altering the per-codeword correct-decoding probability. This yields a parameter-free privacy improvement that is obtained solely by a static relabeling of codewords.
minor comments (3)
- [Abstract] The abstract states that the arrangement 'strictly improves differential privacy guarantees'; a concrete comparison of the resulting ε values (or the maximum likelihood ratio) for the optimal versus a random arrangement would make the improvement explicit.
- The proof that every codeword has identical correct-decoding probability under BSC and ML decoding relies on the sphere-packing property of the Hamming code; this should be stated as a short lemma with the explicit volume calculation.
- Notation for the mapping from neighboring count values to minimum-distance codeword pairs is introduced without an accompanying small example (e.g., the [7,4] Hamming code); adding one would clarify the construction.
Simulated Author's Rebuttal
We thank the referee for their careful reading, positive summary, and significance assessment of our manuscript on differential privacy over Hamming codes. The recommendation of minor revision is noted. No major comments were provided in the report, so we have no specific points to address point-by-point. We will incorporate any minor suggestions during revision.
Circularity Check
No significant circularity; derivation is self-contained
full rationale
The paper derives an optimal bijection from query outputs to Hamming codewords such that the induced BSC output distributions yield improved (ε,δ)-DP while preserving the fixed per-codeword decoding error probability that follows from the code being perfect. This follows directly from the geometry of the Hamming spheres and the fact that any permutation of codeword labels leaves the marginal error rate unchanged; the privacy improvement is obtained by minimizing the maximum likelihood ratio between neighboring assignments, which is a standard optimization over a finite set and does not reduce to any fitted parameter or self-referential definition. No load-bearing self-citation, ansatz smuggling, or renaming of known results is indicated in the provided text. The central claim therefore rests on independent properties of the channel and code rather than on its own outputs.
Assumptions & free parameters
Cite this review
Pith. "Pith review of Differential Privacy over Hamming Codes." pith.science (2026). https://pith.science/paper/VYOTYFZU
@misc{pith2026260627849,
author = {Pith},
title = {Pith review of: Differential Privacy over Hamming Codes},
year = {2026},
howpublished = {\url{https://pith.science/paper/VYOTYFZU}},
note = {Machine review of arXiv:2606.27849}
}
read the original abstract
We consider the transmission of the outputs of counting queries over a binary symmetric channel (BSC), where Hamming codes are employed as the channel encoder. Since the channel is inherently noisy, this transmission already provides a degree of privacy protection ``for free'', albeit at the cost of reduced utility in the form of decoding errors. A natural question is whether this privacy can be further improved (i) without any additional real-time obfuscation of the data, such as injecting artificial noise prior to transmission, and (ii) without increasing the end-to-end error probability. In this work, we answer this question in the affirmative by deriving an optimal codeword arrangement that strictly improves differential privacy guarantees while incurring no real-time computational overhead and no degradation in utility.
Reference graph
Works this paper leans on
-
[1]
C. Dwork and A. Roth, “The Algorithmic Foundations of Differential Privacy,”F ound. Trends Theor . Comput. Sci., vol. 9, no. 3–4, p. 211–407, aug 2014. [Online]. Available: https://doi.org/10.1561/0400000042
-
[2]
On the Privacy-Utility Trade-Off With and Without Direct Access to the Private Data,
A. Zamani, T. J. Oechtering, and M. Skoglund, “On the Privacy-Utility Trade-Off With and Without Direct Access to the Private Data,”IEEE Transactions on Information Theory, vol. 70, no. 3, pp. 2177–2200, 2024
2024
-
[3]
Privacy for Free: How Does Dataset Condensation Help Privacy?
T. Dong, B. Zhao, and L. Lyu, “Privacy for Free: How Does Dataset Condensation Help Privacy?” inInternational Conference on Machine Learning. PMLR, 2022, pp. 5378–5396
2022
-
[4]
Privacy for Free: Posterior Sampling and Stochastic Gradient Monte Carlo,
Y .-X. Wang, S. Fienberg, and A. Smola, “Privacy for Free: Posterior Sampling and Stochastic Gradient Monte Carlo,” inInternational Con- ference on Machine Learning. PMLR, 2015, pp. 2493–2502
2015
-
[5]
Differential Privacy for Free? Harnessing the Noise in Approximate Homomorphic Encryption,
T. Ogilvie, “Differential Privacy for Free? Harnessing the Noise in Approximate Homomorphic Encryption,” Cryptology ePrint Archive, Paper 2023/701, 2023, https://eprint.iacr.org/2023/701. [Online]. Available: https://eprint.iacr.org/2023/701
2023
-
[6]
Privacy for Free in the Overparameterized Regime,
S. Bombari and M. Mondelli, “Privacy for Free in the Overparameterized Regime,”Proceedings of the National Academy of Sciences, vol. 122, no. 15, p. e2423072122, 2025. [Online]. Available: https: //www.pnas.org/doi/abs/10.1073/pnas.2423072122
-
[7]
Privacy for Free: Communication- Efficient Learning with Differential Privacy Using Sketches,
T. Li, Z. Liu, V . Sekar, and V . Smith, “Privacy for Free: Communication- Efficient Learning with Differential Privacy Using Sketches,” 2019
2019
-
[8]
Privacy for Free: Wireless Federated Learning via Uncoded Transmission With Adaptive Power Control,
D. Liu and O. Simeone, “Privacy for Free: Wireless Federated Learning via Uncoded Transmission With Adaptive Power Control,”IEEE Journal on Selected Areas in Communications, vol. 39, no. 1, pp. 170–185, 2021
2021
Show all 13 references
-
[9]
Leveraging Channel Noise for Sam- pling and Privacy via Quantized Federated Langevin Monte Carlo,
Y . Zhang, D. Liu, and O. Simeone, “Leveraging Channel Noise for Sam- pling and Privacy via Quantized Federated Langevin Monte Carlo,” in 2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPA WC), 2022, pp. 1–5
2022
-
[10]
Federated Learning- Based Cell-Free Massive MIMO System for Privacy-Preserving,
J. Zhang, J. Zhang, D. W. K. Ng, and B. Ai, “Federated Learning- Based Cell-Free Massive MIMO System for Privacy-Preserving,”IEEE Transactions on Wireless Communications, vol. 22, no. 7, pp. 4449– 4460, 2023
2023
-
[11]
Towards Practical Differential Privacy for SQL Queries,
N. Johnson, J. P. Near, and D. Song, “Towards Practical Differential Privacy for SQL Queries,”Proc. VLDB Endow., vol. 11, no. 5, p. 526–539, Oct. 2018. [Online]. Available: https://doi.org/10.1145/ 3177732.3177733
2018
-
[12]
Error Detecting and Error Correcting Codes,
R. W. Hamming, “Error Detecting and Error Correcting Codes,”The Bell System Technical Journal, vol. 29, no. 2, pp. 147–160, 1950
1950
-
[13]
White paper: UNEXT – a unified networking experience,
A. Sefidcon, C. Vulk ´an, and M. Gruber, “White paper: UNEXT – a unified networking experience,” Nokia Bell Labs, Tech. Rep., 2023. [Online]. Available: https://www.bell-labs.com/institute/white-papers/ unext-a-unified-networking-experience/ 2Note thatk < 1 3 n 2 , which follo...
2023
Reviewed June 29, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.