Explore a conference talk from Eurocrypt 2012 on multiparty computation techniques with reduced communication and computational requirements. Delve into the authors' innovative approach using fully homomorphic encryption (FHE) and threshold FHE for secure multi-party computation. Learn about the advantages of FHE in 2-party computation, including input encryption, homomorphic evaluation, and cloud delegation. Examine the Learning with Errors (LWE) assumption and its key-homomorphic properties. Discover the intricacies of threshold key generation, basic LWE-based encryption homomorphism, and evaluation keys. Understand the multi-round process of threshold key generation and its application in threshold FHE. Investigate the proposed MPC protocol and its extension to malicious adversaries. Gain insights into cutting-edge cryptographic techniques for secure multiparty computation with enhanced efficiency.
Overview
Syllabus
2-Party Computation Using FHE (semi-honest)
Advantages
Input Encryption
Homomorphic Evaluation
Delegate to a Cloud
MPC with Threshold FHE
MPC with TFHE
Related Work
The LWE Assumption Rev
Key-Homomorphic Properties of the Basic Scheme
Threshold Key Generation
Basic LWE-Based Encryption - Homomorphism
Evaluation Key
Threshold KeyGen-Round 2
Threshold KeyGen - End Of Round 2
Threshold KeyGen - Round 3
Threshold KeyGen - End Of Round 3
Threshold FHE - KeyGen
The MPC Protocol
Malicious
Conclusion
Taught by
TheIACR
Related Courses
-
Two Round Multiparty Computation via Multi-key FHE
-
Fully Homomorphic Encryption and Multi-Party Computation Session
-
Simple Threshold Fully Homomorphic Encryption From LWE With Polynomial Modulus - Asiacrypt 2023
-
Threshold Cryptosystems From Threshold Fully Homomorphic Encryption
-
Succinct Non-Interactive Secure Computation
-
Security and Encoding in Fully Homomorphic Encryption - Rachel Player, Sorbonne Université
