Secure multiparty computations in floating-point arithmetic
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2020
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911829022736384 |
|---|---|
| author | Guo, Chuan Hannun, Awni Knott, Brian van der Maaten, Laurens Tygert, Mark Zhu, Ruiyu |
| author_facet | Guo, Chuan Hannun, Awni Knott, Brian van der Maaten, Laurens Tygert, Mark Zhu, Ruiyu |
| contents | Secure multiparty computations enable the distribution of so-called shares of sensitive data to multiple parties such that the multiple parties can effectively process the data while being unable to glean much information about the data (at least not without collusion among all parties to put back together all the shares). Thus, the parties may conspire to send all their processed results to a trusted third party (perhaps the data provider) at the conclusion of the computations, with only the trusted third party being able to view the final results. Secure multiparty computations for privacy-preserving machine-learning turn out to be possible using solely standard floating-point arithmetic, at least with a carefully controlled leakage of information less than the loss of accuracy due to roundoff, all backed by rigorous mathematical proofs of worst-case bounds on information loss and numerical stability in finite-precision arithmetic. Numerical examples illustrate the high performance attained on commodity off-the-shelf hardware for generalized linear models, including ordinary linear least-squares regression, binary and multinomial logistic regression, probit regression, and Poisson regression. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2001_03192 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | Secure multiparty computations in floating-point arithmetic Guo, Chuan Hannun, Awni Knott, Brian van der Maaten, Laurens Tygert, Mark Zhu, Ruiyu Cryptography and Security Information Theory Machine Learning Numerical Analysis Computation Secure multiparty computations enable the distribution of so-called shares of sensitive data to multiple parties such that the multiple parties can effectively process the data while being unable to glean much information about the data (at least not without collusion among all parties to put back together all the shares). Thus, the parties may conspire to send all their processed results to a trusted third party (perhaps the data provider) at the conclusion of the computations, with only the trusted third party being able to view the final results. Secure multiparty computations for privacy-preserving machine-learning turn out to be possible using solely standard floating-point arithmetic, at least with a carefully controlled leakage of information less than the loss of accuracy due to roundoff, all backed by rigorous mathematical proofs of worst-case bounds on information loss and numerical stability in finite-precision arithmetic. Numerical examples illustrate the high performance attained on commodity off-the-shelf hardware for generalized linear models, including ordinary linear least-squares regression, binary and multinomial logistic regression, probit regression, and Poisson regression. |
| title | Secure multiparty computations in floating-point arithmetic |
| topic | Cryptography and Security Information Theory Machine Learning Numerical Analysis Computation |
| url | https://arxiv.org/abs/2001.03192 |