Skip to content
Open access

VeriDP: Verifiable Differentially Private Training

Jul 2026 · Proceedings on Privacy Enhancing Technologies · 0 citations

TL;DR

VeriDP is presented, a framework for verifiable differentially private training that cryptographically enforces and proves the correct execution of differentially private stochastic gradient descent (DP-SGD) in zero knowledge, uniting differential privacy and verifiable computation for secure and auditable ML.

Abstract

Stochastic Gradient Descent (SGD) is the foundation of modern machine learning (ML). In privacy-sensitive settings, gradients can reveal details about individual data points. Differential Privacy (DP) protects sensitive data during ML training by clipping gradients and adding calibrated Gaussian noise. However, existing frameworks assume semi-honest participants, which fails in adversarial or federated environments where malicious actors can bypass or alter the noise addition process, breaking privacy guarantees. We present VeriDP, a framework for verifiable differentially private training that cryptographically enforces and proves the correct execution of differentially private stochastic gradient descent (DP-SGD) in zero knowledge. VeriDP integrates Zero-Knowledge Proofs (ZKPs) with polynomial commitments, sumcheck and GKR-based proofs, and incrementally verifiable computation (IVC) to generate compact proofs of correct gradient computation, clipping, averaging, and Gaussian noise generation—without revealing private data or randomness. Unlike previous systems that only verify the final privacy budget, VeriDP enables per-iteration verifiability of each model update, providing strong privacy assurances even in adversarial settings. This establishes a novel and complete Zero-Knowledge Proof of Differentially Private Stochastic Gradient Descent (ZK-DPSGD), uniting differential privacy and verifiable computation for secure and auditable ML. Our evaluation shows that prover time increases linearly with the number of input samples, while both verifier time (2–5 ms) and proof size (3–4 KB) remain compact and effectively constant.

Read PDF

Similar papers

Preprint Jul 2026

PRoVeFL: Private Robust and Verifiable Aggregation in Federated Learning

This work proposes PRoVeFL-a novel, modular FL framework that is Privacy-preserving, Byzantine-Robust, and ensures Verifiable aggregation, and improves runtime over the prior works, Prio and ELSA, based on distributed trust with comparable security guarantees, up to 100x and 10x, respectively.

Harsh Kasyap, Anil Kumar Pradhan, U. Atmaca et al. · 0 citations
Preprint Jul 2026

Privacy-Preserving and Verifiable Approximate Distributed Coded Computing

This paper proposes a model-agnostic framework for adversary-resistant distributed learning that jointly addresses privacy preservation and malicious behavior across both federated and decentralized settings and empirically demonstrates that the combination of GPBACC with robust aggregation and verification mechanisms significantly reduces privacy leakage and improves resilience against active adversaries.

Xavier Martínez-Luaña, Alba Gude-Santos, Manuel Fernández-Veiga et al. · 0 citations
Open access Aug 2026

Adversarial Training and Differential Privacy-Style Noise Injection for Privacy-Preserving Vertical Federated Learning

An improved defense mechanism that combines adversarial training and differential-privacy-style noise injection to collectively enhance the robustness of the existing KDk defense mechanism with marginal model utility trade-off is introduced.

N. Azeez, Oluwatobi Sunday Malomo, Omotolani Mary Okerinde et al. · 0 citations
Open access 2026

SURGE: Sparse Updates With Randomized Guarding and Selective Encryption for Secure Federated Learning

Model updates in federated learning can expose sensitive information, while existing defenses often trade off privacy protection, communication efficiency, and training stability. This paper presents SURGE, which stands for Sparse Updates with Randomized Guarding and Selective Encryption. SURGE targets empirical attack resistance under the honest-but-curious server model, rather than a formal privacy guarantee. SURGE builds a unified sparse coordinate set from Top-k accumulated updates and uses Layered Risk-guided Mask Selection (LRMS) to allocate a limited homomorphic-encryption budget according to leakage risk, plaintext exposure history, and residual cost. It then applies random sign flipping to the remaining plaintext coordinates and uses residual feedback to compensate for sparsification and perturbation errors across rounds. Experiments cover IID and label-skew non-IID partitions on MNIST and CIFAR-10, as well as a natural-split FEMNIST benchmark. On MNIST and CIFAR-10, SURGE reduces communication overhead by 87% to 88% relative to FedPHE and MaskCrypt, averaged over the two datasets and the two selective-encryption baselines, and reaches high accuracy sooner under the same simulated wall-clock budget. SURGE also drives membership inference performance close to random guessing and substantially degrades the quality of gradient inversion reconstructions.

Xuanchi Li, Yiting Tan, Jing Wen et al. · 0 citations
Open access Aug 2026

Adversarial Latency Watermarking: Covertly Encoding Zero Bit Keys in Federated Learning Model Updates

These findings expose time as a first class security primitive in FL systems and recommend integrating timing randomization, lightweight monitoring, and scheduler level defenses into frameworks such as Tensor Flow Federated.

Barakat Saad Ibrahim, Ahmed Hameed Shakir, Hasan Jameel · 0 citations