Optimal communication and key rate region for hierarchical secure aggregation with user collusion

X Zhang, K Wan, H Sun, S Wang, M Ji… - arXiv preprint arXiv …, 2024 - arxiv.org
Secure aggregation is concerned with the task of securely uploading the inputs of multiple
users to an aggregation server without letting the server know the inputs beyond their …

Weakly secure summation with colluding users

Z Li, Y Zhao, H Sun - 2023 IEEE International Symposium on …, 2023 - ieeexplore.ieee.org
In secure summation, K users, each holds an input, wish to compute the sum of the inputs at
a server without revealing any information about all the inputs even if the server may collude …

Secure Aggregation with an Oblivious Server

H Sun - arXiv preprint arXiv:2307.13474, 2023 - arxiv.org
Secure aggregation usually aims at securely computing the sum of the inputs from $ K $
users at a server. Noticing that the sum might inevitably reveal information about the inputs …

Optimal Rate Region for Key Efficient Hierarchical Secure Aggregation with User Collusion

X Zhang, K Wan, H Sun, S Wang, M Ji… - 2024 IEEE Information …, 2024 - ieeexplore.ieee.org
Secure aggregation is concerned with the task of securely uploading the inputs associated
with multiple users to an aggregation server without revealing the user inputs to the server …

The Optimal Rate of MDS Variable Generation

Y Zhao, H Sun - 2023 IEEE International Symposium on …, 2023 - ieeexplore.ieee.org
A collection of K random variables are called (K, n)-MDS if any n of the K variables are
independent and determine all remaining variables. In the MDS variable generation …

Secure Summation with User Selection and Collusion

Y Zhao, H Sun - 2024 IEEE Information Theory Workshop (ITW), 2024 - ieeexplore.ieee.org
The secure summation problem is studied with user selection and collusion, where a server
may select any U out of K users and compute the sum of the inputs from the selected users …