Efficient and Secure Multiparty Computation from Fixed-Key Block Ciphers

Explore a 17-minute IEEE conference talk on efficient and secure multiparty computation using fixed-key block ciphers. Delve into the comprehensive study of utilizing fixed-key block ciphers for secure computation, particularly in OT extension and circuit garbling. Learn about various notions of pseudorandomness for hash functions and their provably secure schemes for different applications. Discover provably secure constructions of hash functions in the random-permutation model. Gain insights into end-to-end security proofs for secure-computation protocols based on fixed-key block ciphers, which surprisingly also offer performance improvements. Understand the importance of correlation robustness, fixed-key AES, and the random permutation model in constructing efficient and secure hash functions for multiparty computation.

Intro
Secure Multi-Party Computation (MPC)
Research/Development Stack for MPC
Focus of This Paper
Why hash functions?
Performance to hash short strings (128 bits)
Understand the security provided by MPC implementations
Our Results Give "end-to-end" security proofs for protocols based on fixed-key block ciphers
Correlation robustness (informal)
Fixed-key AES and the RPM
Constructing a CR hash function
Efficiency
Follow-up work