The cost of IEEE arithmetic in secure computation
From MaRDI portal
Publication:2146109
Recommendations
- Efficiency and accuracy improvements of secure floating-point addition over secret sharing
- Optimizing secure floating-point arithmetic: sums, dot products, and polynomials
- Probabilistically correct secure arithmetic computation for modular conversion, zero test, comparison, MOD and exponentiation
- Secure multiparty computations in floating-point arithmetic
- Secure arithmetic computation with constant computational overhead
Cites work
- Benchmarking privacy preserving scientific operations
- Error detection in monotone span programs with application to communication-efficient multi-party computation
- Fast large-scale honest-majority MPC for malicious adversaries
- How to share a secret
- Improved primitives for secure multiparty integer computation
- Low cost constant round MPC combining BMR and oblivious transfer
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security
- Multiparty Computation from Somewhat Homomorphic Encryption
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Reducing communication channels in MPC
- Secure distributed computation of the square root and applications
- Secure multi-party computation made simple
- Semi-homomorphic encryption and multiparty computation
Cited in
(1)
This page was built for publication: The cost of IEEE arithmetic in secure computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2146109)
