Efficiency and accuracy improvements of secure floating-point addition over secret sharing

DOI10.1007/978-3-030-58208-1_5MaRDI QIDQ1995505zbMATH OpenOpenAlexFDO

Authors Kota Sasaki, Koji Nuida

Publication date 23 February 2021

Full work available at URL https://doi.org/10.1007/978-3-030-58208-1_5

zbMATH Keywords

secret sharingsecure multiparty computationfloating-point numbers

Mathematics Subject Classification ID

Cryptography (94A60) Roundoff error (65G50) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Optimizing secure floating-point arithmetic: sums, dot products, and polynomials
• The cost of IEEE arithmetic in secure computation
• Secure multiparty computations in floating-point arithmetic
• Communication-efficient (client-aided) secure two-party protocols and its application
• Improved primitives for secure multiparty integer computation

Cited in

(5)

• Complexity and performance of secure floating-point polynomial evaluation protocols
• Optimizing secure floating-point arithmetic: sums, dot products, and polynomials
• The cost of IEEE arithmetic in secure computation
• Secure multiparty computations in floating-point arithmetic
• A new approach to efficient and secure fixed-point computation

This page was built for publication: Efficiency and accuracy improvements of secure floating-point addition over secret sharing

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