Federated learning is a promising collaborative learning system from the perspective of training data privacy preservation; however, there is a risk of privacy leakage from individual local models of users. Secure aggregation protocols based on local model masking are a promising solution to prevent privacy leakage. Existing secure aggregation protocols sacrifice either computation or communication costs to tolerate user dropouts. A naive secure aggregation protocol achieves a small communication cost by secretly sharing random seeds instead of random masks. However, it requires that a server incurs a substantial computation cost to reconstruct the random masks from the random seeds of dropout users. To avoid such a reconstruction, a state-of-the-art secure aggregation protocol secretly shares random masks. Although this approach avoids the computation cost of mask reconstruction, it incurs a large communication cost due to secretly sharing random masks. In this paper, we design a secure aggregation protocol to mitigate the tradeoff between the computation cost and the communication cost by complementing both types of secure aggregation protocols. In our experiments, our protocol achieves up to 11.41 times faster while achieving the same level of privacy preservation and dropout tolerance as the existing protocols.

Programmable switches are promising platforms for fast and flexible in-network computation; however, a standard mechanism, packet recirculation, degrades throughput due to bandwidth consumption caused by the loopback of not only packet headers but also cumbersome payloads. This paper proposes P4QRS, a mechanism for retaining payloads within the switch, reducing payload recirculations. Specifically, P4QRS bifurcates packets into headers and payloads, which undergo the computation process through pipelines and the buffering process leveraging the switch’s queue behavior, respectively; they then rendezvous for reassembly into complete packets to be sent out. To validate its effectiveness, we evaluated P4QRS using an analytical model and implementation on state-of-the-art hardware programmable switches. Our evaluation shows that P4QRS operates stably and intrinsically boosts complex in-switch computations. © 2024 IEEE.