Complexity and performance of secure floating-point polynomial evaluation protocols

DOI10.1007/978-3-030-88428-4_18MaRDI QIDQ2148764zbMATH OpenOpenAlexFDO

Authors Octavian Catrina

Publication date 24 June 2022

Full work available at URL https://doi.org/10.1007/978-3-030-88428-4_18

zbMATH Keywords

polynomial evaluationsecret sharingsecure floating-point arithmeticsecure multiparty computation

Mathematics Subject Classification ID

Roundoff error (65G50) Numerical algorithms for computer arithmetic, etc. (65Y04) Computer security (68M25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Optimizing secure floating-point arithmetic: sums, dot products, and polynomials
• Improved primitives for secure multiparty integer computation
• Secure multiparty computation and secret sharing
• Efficient and Secure Evaluation of Multivariate Polynomials and Applications
• Efficiency and accuracy improvements of secure floating-point addition over secret sharing

Cites work

• Benchmarking privacy preserving scientific operations
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• Non-interactive Proofs for Integer Multiplication
• Optimizing secure floating-point arithmetic: sums, dot products, and polynomials
• Secure multiparty computation and secret sharing
• Theory of Cryptography

Cited in

(7)

• Monomial evaluation of polynomial functions protected by threshold implementations -- with an illustration on AES -- extended version
• Securely solving classical network flow problems
• Efficient and Secure Evaluation of Multivariate Polynomials and Applications
• Improved primitives for secure multiparty integer computation
• Optimizing secure floating-point arithmetic: sums, dot products, and polynomials
• An Efficient and Provably Secure Private Polynomial Evaluation Scheme
• Practical and efficient FHE-based MPC

Describes a project that uses

Uses Software

• Rmind

This page was built for publication: Complexity and performance of secure floating-point polynomial evaluation protocols

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