A new approach to efficient and secure fixed-point computation

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Overdrive: making SPDZ great again
Fast distributed RSA key generation for semi-honest and malicious adversaries
\(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
Function secret sharing for mixed-mode and fixed-point secure computation
Actively secure setup for SPDZ
Improved primitives for MPC over mixed arithmetic-binary circuits
P2DEX: privacy-preserving decentralized cryptocurrency exchange
An efficient passive-to-active compiler for honest-majority MPC over rings
\( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation
MArBLed circuits: mixing arithmetic and Boolean circuits with active security
Security against covert adversaries: Efficient protocols for realistic adversaries
A Unified Approach to MPC with Preprocessing Using OT
Dishonest Majority Multi-Party Computation for Binary Circuits
Multiparty Computation from Somewhat Homomorphic Encryption
Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
CryptoComputing with Rationals
Improved Primitives for Secure Multiparty Integer Computation
LEGO for Two-Party Secure Computation
Secure Multiparty Computation Goes Live
Theory of Cryptography
Multiparty generation of an RSA modulus
Low cost constant round MPC combining BMR and oblivious transfer
Multiparty generation of an RSA modulus
Tight Error Analysis in Fixed-point Arithmetic
A new approach to efficient and secure fixed-point computation