Explore MPC-friendly symmetric key primitives in this 25-minute conference talk presented at CCS 2016. Delve into interesting problems, secure sharing techniques, and preprocessing phases for circuit evaluation. Examine public exponentiation, constant round protocols, and offline phases. Investigate large PRFs and their applications in secure multi-party computation. Gain insights into the latest advancements in cryptographic primitives and their implications for computer and communications security.
Overview
Syllabus
Introduction
Interesting Problems
TakeHome Message
PRF
Secure Sharing
Preprocessing Phase
Circuit Evaluation
Deny wrangled BRF
Public exponentiation
Constant round
Offline
Cyclists
Minzy
Offline Phase
Latency
Large PRF
Conclusion
Other PRFs
Taught by
ACM CCS
