TL;DR

PPFLHE is a federated learning framework that protects healthcare model updates with Paillier additive homomorphic encryption, combined with an Access Control identity check on clients and an ACK mechanism on the server to drop unresponsive clients. It reports 81.53% classification accuracy on APTOS 2019 Blindness Detection with MobileNetV2 [§5.2, abstract].

Problem and motivation

Healthcare data is sensitive and siloed, and plain federated learning can still leak private information through exchanged gradients/parameters via reconstruction or membership inference attacks [§1]. The paper considers two issues: (1) protecting user privacy without harming utility, and (2) reducing waiting delay and communication overhead caused by stragglers and dropouts [§1, §3.2]. The threat model assumes honest-but-curious aggregators, possibly malicious internal clients, and non-collusion between client and server [§4.5].

Key contributions

FHE setup

ML setup

Datasets

Dataset Task Size (train/test) Modality Notes
APTOS 2019 Blindness Detection DR severity (5-class) 3662 train / 1928 test Retinal images 20% of train used as validation, fivefold cross-validation [§5.1.2]
CIFAR-10 Object classification (10-class) 50000 train / 10000 test 32×32 RGB images Used as control to show transferability [§5.1.2]

Pipeline diagram

flowchart LR
    subgraph Clients
        A[Local training MobileNetV2] --> B[Encrypt WL with pk]
    end
    subgraph Server
        C[AC auth check] --> D[Aggregate ciphertexts]
        D --> E[Send ACK probe]
    end
    subgraph Clients_dec [Clients]
        F[Decrypt WG with sk] --> G[Update local model]
    end
    B -. enc(WL) .-> D
    D -. enc(WG) .-> F
    E -. ACK probe .-> A

Pipeline steps (text)

  1. Server randomly selects k clients and authenticates them via the AC mechanism using ⟨eU, eR⟩ against the ACL [§4.2].
  2. Each authenticated client generates Paillier key pair (pk, sk) and shares pk [§4.3].
  3. Server broadcasts the current encrypted global model W*_G to selected clients [§4.1].
  4. Clients decrypt with sk, train MobileNetV2 locally for E epochs with Momentum-SGD [§4.1, §5.2].
  5. Clients encrypt updated local model W*_L with pk and upload to server [§4.1].
  6. Server homomorphically aggregates ciphertexts to obtain new W*_G [§4.3].
  7. Server issues ACK probes; clients responding within timeout join the next round, slow/dropped clients are removed and the slowest client’s selection probability is reduced to 1/k [§4.4, Algorithm 3, Eq. 11].
  8. Repeat until each participant judges the model has converged [§4.3].

Architecture diagram

flowchart LR
    I([Input 224x224x3]) --> C1[conv2d 32, s=2]
    C1 --> B1[Bottleneck x1, c=16]
    B1 --> B2[Bottleneck x2, c=24]
    B2 --> B3[Bottleneck x3, c=32]
    B3 --> B4[Bottleneck x4, c=64]
    B4 --> B5[Bottleneck x3, c=96]
    B5 --> B6[Bottleneck x3, c=160]
    B6 --> B7[Bottleneck x1, c=320]
    B7 --> C2[conv2d 1x1, 1280]
    C2 --> P[avgpool 7x7]
    P --> C3[conv2d 1x1, k classes]
    C3 --> O([Softmax])

Results

Metric This paper Baseline Hardware
Accuracy on APTOS 2019 (MobileNetV2) 81.53% 80.0% [Ref 40]; 79.4% [Ref 17]; 72.9% [Ref 18]; 86.69% [Ref 39 — no security] 3080Ti GPU, 64 GB RAM, Ubuntu 18.04 [§5.1.1]
Accuracy on CIFAR-10 (MobileNetV2) 84.73% Resnet50: 86.11% (9× model size) [§5.2, Table 3] same [§5.1.1]
Per-user federated communication time at C=5 ~202.03 s non-PPFLHE higher by ~100 s; at C=11 reduction ~160 s [§5.4, §5.5, Fig. 7] same
Paillier key length used 512 bit 1024/2048/3072 evaluated; time grows with length [§5.3, Fig. 5] same
Communication overhead (Total) 2nm 2n·m_FHE (CKKS [19]); 2(nm+T) ([28],[41]); 3nm ([20]); 2nT ([40]) [§5.5, Table 5] analytical
Privacy vs DP (ε=1) at same training matches no-privacy accuracy DP accuracy lower due to noise [§5.6, Fig. 8] same

Single-sample encrypted inference latency is not reported (the paper measures FL round/communication time, not inference per image) [§5.4–§5.5].

Limitations and assumptions

CryptoNets-style HE FL works including Stripelis et al. CKKS scheme [Ref 19], Ku et al. HE re-encryption [Ref 20], Xu et al. VerifyNet [Ref 21], Truex et al. DP+MPC hybrid [Ref 22], BatchCrypt [Ref 25], Li et al. DP smart healthcare [Ref 17], Li et al. fMRI DP [Ref 18], Ngo et al. cerebellar ataxia FL [Ref 39], Malekzadeh et al. Dopamine [Ref 40], Singh et al. blockchain FL [Ref 41], Jia et al. blockchain+DP+HE IIoT [Ref 28] [§2, §5.2 Table 4, §5.5 Table 5, §5.6 Table 6].

Code and artifacts

Not released. The data availability statement says “No data was used for the research described in the article” — no public repository is provided [p. 9].

Extra diagrams (optional)

Threat model

flowchart LR
    C[Client] -- enc_pk(W_L) --> S[Server / Aggregator]
    S -- enc_pk(W_G) --> C
    S -- ACK probe --> C
    C -- ACK reply --> S
    AC[AC Mechanism] -- permit/deny --> S
    C -- eU,eR request --> AC

Federated round

sequenceDiagram
    participant C as Clients (authenticated)
    participant A as Aggregator
    A->>C: enc(W_G^t)
    C->>C: dec(sk), local train, enc(pk)
    C->>A: enc(W_L^t)
    A->>A: homomorphic sum -> enc(W_G^{t+1})
    A->>C: ACK probe
    C-->>A: ACK reply (drops slow clients)
    A->>C: enc(W_G^{t+1})

Activation approximation

The log-loss log(1 + e^{-θ}) is replaced by its second-order Taylor expansion about θ = 0: log 2 − (1/2)θ + (1/8)θ^2 + O(θ^2), giving a gradient linear in [[W]]^T x_i that is compatible with Paillier additive homomorphism [§4.3, Eqs. 7–10]. See Eqs. (8)–(10) for the closed form used.

Open questions