Perfectly Private Over-the-Air Computation
Abstract
This paper studies a key research question: how to achieve perfect privacy in over-the-air computation (AirComp)? The problem is particularly intriguing due to a dilemma. Real-field operations can ensure invertibility but generally introduce statistical dependence, resulting in inevitable privacy leakage. In contrast, modulo operations can decorrelate the output from the original message, but suffer from the ill-posed invertibility when applied over non-prime groups (e.g., the real field). This raises a subtle yet fundamental question: Does perfect privacy intrinsically conflict with AirComp? We show that the answer is no. By carefully leveraging the interplay between real-field and modulo operations, perfect privacy and accurate computation can, in fact, be achieved simultaneously, enabling perfectly private aggregation.
Cite
@article{arxiv.2604.28080,
title = {Perfectly Private Over-the-Air Computation},
author = {Shudi Weng and Ming Xiao and Mikael Skoglund},
journal= {arXiv preprint arXiv:2604.28080},
year = {2026}
}