Papers › Multi-Message Secure Aggregation with Demand Privacy
Multi-Message Secure Aggregation with Demand Privacy
Chenyi Sun, Ziting Zhang, Kai Wan, Giuseppe Caire
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This paper considers a multi-message secure aggregation with privacy problem, in which a server aims to compute K_c≥1 linear combinations of local inputs from K distributed users. The problem addresses two tasks: (1) security, ensuring that the server can only obtain the desired linear combinations without any else information about the users' inputs, and (2) privacy, preventing users from learning about the server's computation task. In addition, the effect of user dropouts is considered, where at most K-U users can drop out and the identity of these users cannot be predicted in advance. We propose two schemes for K_c is equal to (1) and 2≤K_c≤U-1, respectively. For K_c is equal to (1), we introduce multiplicative encryption of the server's demand using a random variable, where users share coded keys offline and transmit masked models in the first round, followed by aggregated coded keys in the second round for task recovery. For 2≤K_c ≤U-1, we use robust symmetric private computation to recover linear combinations of keys in the second round. The objective is to minimize the number of symbols sent by each user during the two rounds. Our proposed schemes have achieved the optimal rate region when K_c is equal to (1) and the order optimal rate (within 2) when 2≤K_c ≤U-1.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections