Practical and efficient FHE-based MPC

DOI10.1007/978-3-031-47818-5_14MaRDI QIDQ6595949zbMATH OpenFDO

Authors N. P. Smart

Publication date 30 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-47818-5_14

zbMATH Keywords

UC frameworkreactive MPC protocol

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Between a rock and a hard place: interpolating between MPC and FHE
• Multiparty computation with low communication, computation and interaction via threshold FHE
• Secure MPC: laziness leads to GOD
• Two round multiparty computation via multi-key FHE
• scientific article; zbMATH DE number 1808209

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• Actively secure setup for SPDZ
• Between a rock and a hard place: interpolating between MPC and FHE
• Compilation of function representations for secure computing paradigms
• Complexity and performance of secure floating-point polynomial evaluation protocols
• FHEW: bootstrapping homomorphic encryption in less than a second
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Fully homomorphic encryption using ideal lattices
• Homomorphic encryption for arithmetic of approximate numbers
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• Improved primitives for secure multiparty integer computation
• Multiparty Computation from Somewhat Homomorphic Encryption
• Multiparty computation with low communication, computation and interaction via threshold FHE
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
• TFHE: fast fully homomorphic encryption over the torus
• The algebraic group model and its applications
• Theory of Cryptography
• Trivium: A Stream Cipher Construction Inspired by Block Cipher Design Principles
• Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
• Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection

Cited in

(2)

• Rerandomizable garbling, revisited
• Drifting towards better error probabilities in fully homomorphic encryption schemes

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)