The cost of IEEE arithmetic in secure computation
From MaRDI portal
Publication:2146109
DOI10.1007/978-3-030-88238-9_21zbMath1491.94035OpenAlexW3210219361MaRDI QIDQ2146109
Shahla Atapoor, David W. Archer, Nigel P. Smart
Publication date: 15 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-88238-9_21
Uses Software
Cites Work
- Fast large-scale honest-majority MPC for malicious adversaries
- Reducing communication channels in MPC
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security
- Error detection in monotone span programs with application to communication-efficient multi-party computation
- Benchmarking privacy preserving scientific operations
- Secure multi-party computation made simple
- Secure Distributed Computation of the Square Root and Applications
- Multiparty Computation from Somewhat Homomorphic Encryption
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- Semi-homomorphic Encryption and Multiparty Computation
- How to share a secret
- Improved Primitives for Secure Multiparty Integer Computation
- Low cost constant round MPC combining BMR and oblivious transfer
This page was built for publication: The cost of IEEE arithmetic in secure computation
