Главная
Study mode:
on
1
Intro
2
Circuit Size Barrier
3
Fully Homomorphic Encryption
4
Function Secret Sharing
5
Homomorphic Secret Sharing
6
Applications
7
Branching Programs
8
Outline
9
Restricted Multiplication
10
Warmup
11
Mmorphic Evaluation
12
Share Conversion Procedure
13
Encryption
14
Circular Security
15
Secret Sharing
16
Secure TwoParty Computation
17
Conclusion
18
Reflections
19
Open Questions
Description:
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.

Breaking the Circuit Size Barrier for Secure Computation Under DDH

TheIACR
Add to list