Complexity and performance of secure floating-point polynomial evaluation protocols

DOI10.1007/978-3-030-88428-4_18zbMath1498.68050OpenAlexW3202062587MaRDI QIDQ2148764

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

secret sharingpolynomial evaluationsecure multiparty computationsecure floating-point arithmetic

Mathematics Subject Classification ID

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

Uses Software

• Rmind

Cites Work

• Unnamed Item
• Unnamed Item
• Benchmarking privacy preserving scientific operations
• Non-interactive Proofs for Integer Multiplication
• Secure Multiparty Computation and Secret Sharing
• Theory of Cryptography

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