Pith. sign in

REVIEW 1 cited by

Training Differentially Private Models with Secure Multiparty Computation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2202.02625 v4 pith:X3LAXZCE submitted 2022-02-05 cs.CR cs.LG

classification cs.CRcs.LG
keywords modeltrainingaccuracydataprivacysecureapproachcomputation
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We address the problem of learning a machine learning model from training data that originates at multiple data owners while providing formal privacy guarantees regarding the protection of each owner's data. Existing solutions based on Differential Privacy (DP) achieve this at the cost of a drop in accuracy. Solutions based on Secure Multiparty Computation (MPC) do not incur such accuracy loss but leak information when the trained model is made publicly available. We propose an MPC solution for training DP models. Our solution relies on an MPC protocol for model training, and an MPC protocol for perturbing the trained model coefficients with Laplace noise in a privacy-preserving manner. The resulting MPC+DP approach achieves higher accuracy than a pure DP approach while providing the same formal privacy guarantees. Our work obtained first place in the iDASH2021 Track III competition on confidential computing for secure genome analysis.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. ByzSFL: Achieving Byzantine-Robust Secure Federated Learning with Zero-Knowledge Proofs

    cs.CR 2025-01 reject novelty 5.0 of 10

    ByzSFL combines partial homomorphic encryption with zk-SNARKs to let clients prove FLTrust aggregation weights in secure federated learning, claiming large speedups, but the protocol math and evaluation are not yet coherent.

Pith tools