A new approach to efficient and secure fixed-point computation
From MaRDI portal
Publication:6547972
Recommendations
- Efficiency and accuracy improvements of secure floating-point addition over secret sharing
- Improved primitives for secure multiparty integer computation
- An efficient secure division protocol using approximate multi-bit product and new constant-round building blocks
- Optimizing secure floating-point arithmetic: sums, dot products, and polynomials
Cites work
- \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- A new approach to efficient and secure fixed-point computation
- A Unified Approach to MPC with Preprocessing Using OT
- Actively secure setup for SPDZ
- An efficient passive-to-active compiler for honest-majority MPC over rings
- Cryptocomputing with rationals
- Dishonest majority multi-party computation for binary circuits
- Fast distributed RSA key generation for semi-honest and malicious adversaries
- Function secret sharing for mixed-mode and fixed-point secure computation
- scientific article; zbMATH DE number 1942435 (Why is no real title available?)
- scientific article; zbMATH DE number 1759770 (Why is no real title available?)
- scientific article; zbMATH DE number 3269473 (Why is no real title available?)
- Improved primitives for MPC over mixed arithmetic-binary circuits
- Improved primitives for secure multiparty integer computation
- LEGO for Two-Party Secure 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
- Multiparty generation of an RSA modulus
- Multiparty generation of an RSA modulus
- Overdrive: making SPDZ great again
- P2DEX: privacy-preserving decentralized cryptocurrency exchange
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Secure multiparty computation goes live
- Security against covert adversaries: Efficient protocols for realistic adversaries
- Theory of Cryptography
- Tight Error Analysis in Fixed-point Arithmetic
Cited in
(2)
This page was built for publication: A new approach to efficient and secure fixed-point computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547972)
