Secure multiparty computations in floating-point arithmetic

DOI10.1093/IMAIAI/IAAA038MaRDI QIDQ5073886zbMATH OpenOpenAlexFDO

Authors

Publication date 4 May 2022

Published in Information and Inference: A Journal of the IMA (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2001.03192

zbMATH Keywords

perfect privacyprivacy-preserving multiparty computations

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Privacy of data (68P27) Cryptography (94A60)

Abstract: 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.

Recommendations

• Optimizing secure floating-point arithmetic: sums, dot products, and polynomials
• Theory of Cryptography
• Efficiency and accuracy improvements of secure floating-point addition over secret sharing
• High-precision privacy-preserving real-valued function evaluation
• Applying secure multi-party computation in practice

Cited in

(10)

• Secure computation with horizontally partitioned data using adaptive regression splines
• Efficiency and accuracy improvements of secure floating-point addition over secret sharing
• The cost of IEEE arithmetic in secure computation
• Benchmarking privacy preserving scientific operations
• High-precision secure computation of satellite collision probabilities
• Applying secure multi-party computation in practice
• Optimizing secure floating-point arithmetic: sums, dot products, and polynomials
• Theory of Cryptography
• Secure Multiparty Computation
• Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic

This page was built for publication: Secure multiparty computations in floating-point arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5073886)