Breaking the Circuit Size Barrier for Secure Computation Under DDH

Explore a groundbreaking conference talk from Crypto 2016 that addresses the circuit size barrier in secure computation under the Decisional Diffie-Hellman (DDH) assumption. Delve into topics such as fully homomorphic encryption, function secret sharing, and homomorphic secret sharing. Learn about restricted multiplication, morphic evaluation, and share conversion procedures. Examine the implications for encryption, circular security, and secure two-party computation. Conclude with reflections on the research and consider open questions in the field of cryptography.

Intro
Circuit Size Barrier
Fully Homomorphic Encryption
Function Secret Sharing
Homomorphic Secret Sharing
Applications
Branching Programs
Outline
Restricted Multiplication
Warmup
Mmorphic Evaluation
Share Conversion Procedure
Encryption
Circular Security
Secret Sharing
Secure TwoParty Computation
Conclusion
Reflections
Open Questions