TL;DR

The paper proposes a privacy-preserving federated learning (PPFL) protocol that applies a Dynamic Range Evaluation Layer-for-Layer (DREL) quantization to local model weights so they can be encrypted with the integer-friendly BFV scheme at 192-bit security, drastically reducing encryption, decryption, aggregation time and ciphertext size versus Paillier and CKKS while preserving FedAvg accuracy [Abstract][§I].

Problem and motivation

Federated learning protects raw data but local weight/gradient sharing is still vulnerable to reversal model and membership inference attacks [§I]. Existing PPFL-HE schemes either incur high communication overhead (gradient-based protocols), or use Paillier/CKKS which are computationally heavy on real-valued weights at high security levels [§I][§II]. The threat model assumes an honest-but-curious server interested in model and data, and honest clients with limited resources [§III-C].

Key contributions

FHE setup

ML setup

Datasets

Dataset Task Size (train/test) Modality Notes
CIFAR-10 Image classification Not reported in text Images 5 clients, equal split [§V-A][§V-C]
MNIST Image classification Not reported in text Images 5 clients [§V-A][§V-C]
Fashion MNIST (FMNIST) Image classification Not reported in text Images 5 clients [§V-A][§V-C]
SVHN Image classification Not reported in text Images 5 clients [§V-A][§V-C]
Sent140 (LEAF) Sentiment classification Not reported in text Text (tokenized) 10 clients [§V-A][§V-C]

Pipeline diagram

flowchart LR
    subgraph Clients
        T[Local training] --> R[Compute local range MR]
        Q[Quantize weights] --> E[BFV encrypt]
        D[BFV decrypt] --> DQ[De-quantize and update]
    end
    subgraph Server
        G[Aggregate global range MGR]
        A[FedAvg on ciphertexts]
    end
    R -. MR .-> G
    G -. MGR .-> Q
    E -. enc weights .-> A
    A -. enc global model .-> D

Pipeline steps (text)

  1. Key generation center distributes BFV public/secret keys and parameters to clients; server gets context only [§IV-C].
  2. Server selects clients to start the FL round [§IV-B].
  3. Each client trains its local model for E epochs on local data [§IV-C].
  4. Each client computes per-layer min/max ranges MR via DREL and sends them to the server [§IV-A][§IV-C].
  5. Server chains all MR into MGR and computes the global per-layer range [alpha_G, beta_G]; sends back to clients [§IV-A].
  6. Clients quantize weights to signed r-bit integers using the global range and encrypt with BFV [§IV-B][§IV-C].
  7. Clients send ciphertext weights to the server [§IV-C].
  8. Server aggregates ciphertexts with FedAvg under BFV homomorphism [§IV-C].
  9. Clients receive encrypted global model, decrypt, de-quantize, and update local model [§IV-B][§IV-C].
  10. Steps repeat for each FL round (number of communication rounds = 2*K because of the extra DREL exchange) [§V-D].

Architecture diagram

The paper uses several architectures; exact widths and parameter counts are listed in the paper’s Table 2 (not transcribed in source text). Schematic for the image-based CNN family:

flowchart LR
    I([Image input]) --> C1[Conv 3x3]
    C1 --> P1[MaxPool 2x2]
    P1 --> C2[Conv 3x3]
    C2 --> P2[MaxPool 2x2]
    P2 --> CN[Further Conv 3x3 + MaxPool 2x2]
    CN --> F[Flatten]
    F --> FC[Fully Connected]
    FC --> O([Softmax])

FNN (Sent140)

flowchart LR
    I([Tokenized text]) --> EMB[Embedding]
    EMB --> FL[Flatten]
    FL --> FC1[FC layer 1]
    FC1 --> FC2[FC layer 2]
    FC2 --> O([Sentiment label])

Results

Accuracy and overhead reported after 15 FL training rounds, 5 clients for image datasets, 10 for Sent140, 30 local epochs with early stopping patience 5 [§V-C][§V-D].

Metric This paper Baseline Hardware
Accuracy delta vs No-PPFL +0.24% (CIFAR-10), +0.08% (MNIST), +0.20% (Sent140), 0% (SVHN), +0.12% on FMNIST [§V-D] No-PPFL FedAvg AMD Threadripper 1920 8-core, Titan RTX 24GB, 64GB RAM [§V-C]
Worst-case accuracy loss vs CKKS 0.39% (FMNIST); best 0.01% (MNIST) [§V-D] CKKS-based PPFL-HE same
Encryption time reduction 72-76.62% vs CKKS; 99.92-99.98% vs Paillier [§V-D] CKKS / Paillier PPFL-HE same
Decryption time reduction 50.77-67.02% vs CKKS; 99.84-99.96% vs Paillier [§V-D] CKKS / Paillier same
Aggregation time reduction 73.08-80.34% vs CKKS; 89.92-94.16% vs Paillier [§V-D] CKKS / Paillier same
Average encryption time saving (Abstract/Conclusion) 99.95% vs Paillier; 73.79% vs CKKS [Abstract][§VI] Paillier / CKKS same
Average decryption time saving 99.90% vs Paillier; 55.13% vs CKKS [Abstract][§VI] Paillier / CKKS same
Ciphertext size reduction (CNN-3) 75.36% vs CKKS; 9.34% vs Paillier [§V-D][§VI] Paillier / CKKS same
Ciphertext size reduction (CNN-6) 74.98% vs CKKS; 2.11% vs Paillier [§V-D] Paillier / CKKS same
FL rounds to convergence High accuracy by round 4 (CIFAR-10), round 3 (SVHN), round 1 (MNIST/FMNIST/Sent140); communication rounds = 2*K [§V-D] Gradient-protection PPFL-HE (much higher) same
Quantization error rate ~1.94e-5 with r=16 [§IV-B]; lower median/IQR than no-DREL [§V-E] Fixed-range quantization [-1,1] same

Note: single-sample inference is not the workload — this is a federated training paper. Per-round latency components are reported but a single encrypted inference time is not applicable; comparison.single_inference_seconds is “N/A”.

Limitations and assumptions

Code and artifacts

Not released (no repository URL stated in the extracted text).

Extra diagrams (optional)

Threat model

flowchart LR
    C[Honest clients] -- enc(quantized weights), MR --> S[Honest-but-curious server]
    S -- enc(global model), MGR --> C

Federated round

sequenceDiagram
    participant C as Clients
    participant S as Server
    C->>C: Local plaintext training (E epochs)
    C->>S: Local range MR (per layer)
    S->>S: Compute global range MGR
    S->>C: MGR
    C->>C: Quantize weights, BFV encrypt
    C->>S: enc(Q(w_n))
    S->>S: FedAvg under BFV (ct_G)
    S->>C: ct_G
    C->>C: BFV decrypt, de-quantize, update

Activation approximation

Not applicable — the FHE workload is FedAvg-style weight summation, so no nonlinearities are evaluated under encryption.

Open questions