Practical and efficient FHE-based MPC
From MaRDI portal
Publication:6595949
DOI10.1007/978-3-031-47818-5_14zbMATH Open1546.94102MaRDI QIDQ6595949
Publication date: 30 August 2024
Could not fetch data.
Cites Work
- Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
- Compilation of function representations for secure computing paradigms
- The algebraic group model and its applications
- Actively secure setup for SPDZ
- Complexity and performance of secure floating-point polynomial evaluation protocols
- TFHE: fast fully homomorphic encryption over the torus
- Homomorphic encryption for arithmetic of approximate numbers
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Between a Rock and a Hard Place: Interpolating between MPC and FHE
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Multiparty Computation from Somewhat Homomorphic Encryption
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Trivium: A Stream Cipher Construction Inspired by Block Cipher Design Principles
- Improved Primitives for Secure Multiparty Integer Computation
- Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression
- Fully homomorphic encryption using ideal lattices
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Theory of Cryptography
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
This page was built for publication: Practical and efficient FHE-based MPC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595949)
