Pith. sign in

REVIEW 1 cited by

CodedPrivateML: A Fast and Privacy-Preserving Framework for Distributed Machine Learning

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 1902.00641 v2 pith:GRSBC6ZD submitted 2019-02-02 cs.LG cs.CRcs.ITmath.ITstat.ML

classification cs.LGcs.CRcs.ITmath.ITstat.ML
keywords codedprivatemldatadistributedfastlearningmachinemodelprivate
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

How to train a machine learning model while keeping the data private and secure? We present CodedPrivateML, a fast and scalable approach to this critical problem. CodedPrivateML keeps both the data and the model information-theoretically private, while allowing efficient parallelization of training across distributed workers. We characterize CodedPrivateML's privacy threshold and prove its convergence for logistic (and linear) regression. Furthermore, via extensive experiments on Amazon EC2, we demonstrate that CodedPrivateML provides significant speedup over cryptographic approaches based on multi-party computing (MPC).

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. Secure Coded Multi-Party Computation for Massive Matrix Operations

    cs.IT 2019-08 reject novelty 6.0 of 10

    A secure multi-party computation scheme for matrix polynomials uses polynomial sharing and claims large worker savings, but its transpose procedure is wrong, breaking the arbitrary-polynomial result.

Pith tools