Daily Arxiv

This is a page that curates AI-related papers published worldwide.
All content here is summarized using Google Gemini and operated on a non-profit basis.
Copyright for each paper belongs to the authors and their institutions; please make sure to credit the source when sharing.

Fundamental Limits of Hierarchical Secure Aggregation with Cyclic User Association

Created by
  • Haebom

Author

Xiang Zhang, Zhou Li, Kai Wan, Hua Sun, Mingyue Ji, Giuseppe Caire

Outline

In this paper, we propose an efficient aggregation scheme that considers the cyclic connection pattern between users and relays in hierarchical secure aggregation (HSA). While existing HSA studies assume that each user is connected to only one relay, in this paper, we propose a scheme where each user is cyclically connected to B consecutive relays. To this end, we present an efficient aggregation scheme that includes a message design inspired by gradient coding and a complex secure key design, and we derive a new inverse theorem for minimum communication and key rate using information-theoretic arguments. The core of the research is to improve the efficiency of communication and key generation by applying the gradient coding technique for efficient communication in distributed computing to HSA.

Takeaways, Limitations

•
Takeaways:
◦
Overcomes the limitations of existing HSA, enabling more efficient communication and key generation through cyclical connections between users and repeaters.
◦
We present a novel message design and security key design that improves the efficiency of HSA by utilizing gradient coding techniques.
◦
We present new inverse theorems for minimum communication and key rates through information-theoretic analysis, thereby providing a theoretical basis for optimal system design.
•
Limitations:
◦
Assumptions about circular connectivity patterns may limit applicability in real-world settings.
◦
The performance of the proposed method may vary depending on certain parameters (such as B value), and performance evaluation in various environments is required.
◦
Information theoretic analysis assumes ideal conditions, so there may be differences in performance from actual systems.
👍
Made with Slashpage