Overview
Explore a 26-minute conference talk presented at Eurocrypt 2017 that delves into group-based secure computation techniques for optimizing rounds, communication, and computation. Examine the classical secure computation methods and homomorphic secret sharing before diving into the crypto framework and communication complexity. Analyze the paper's encoding approach, key takeaways, and homomorphic evaluation techniques. Discover optimizations for communication cost and understand the bottom line of this research. Conclude by considering open questions in the field of secure computation.
Syllabus
Introduction
Classical Secure Computation
Homomorphic Secret Sharing
Crypto Framework
Communication Complexity
Crypto Paper
Encoding
Takeaways
Homomorphic Evaluation
Optimizing Communication
Cost
Optimizations
Bottom Line
Open Questions
Taught by
TheIACR