SYSYApr 23

Privacy-Preserving Distributed Stochastic Optimization with Homomorphic Encryption and Heterogeneous Stepsizes

arXiv:2604.2138123.9h-index: 1
Predicted impact top 42% in SY · last 90 daysOriginality Incremental advance
AI Analysis

For multi-agent systems requiring privacy in distributed optimization, this work addresses the trade-off between privacy and accuracy without relying on trusted neighbors.

The paper proposes a distributed stochastic gradient descent algorithm that integrates Paillier homomorphic encryption with heterogeneous stepsizes to achieve privacy preservation against honest-but-curious agents and eavesdroppers, while ensuring almost sure convergence to the optimal solution.

Distributed stochastic optimization enables multi-agent collaboration in applications such as distributed learning and sensor networks, but also raises critical privacy concerns due to the involvement of sensitive data. While existing privacy-preserving approaches often face limitations in balancing accuracy with efficiency, we propose a novel distributed stochastic gradient descent algorithm that integrates Paillier homomorphic encryption with heterogeneous and time-varying random stepsizes. The proposed algorithm provides inherent privacy protection against both internal honest-but-curious agents and external eavesdroppers, without relying on any trusted neighbors. Furthermore, we incorporate an attenuation factor to effectively mitigate quantization error induced by the encryption process, ensuring almost sure convergence to the optimal solution while maintaining privacy preservation. Numerical simulations demonstrate the effectiveness and efficiency of the proposed approach.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes