Concurrent Secure Computation with Optimal Query Complexity

Explore the intricacies of concurrent secure computation in this 27-minute conference talk. Delve into the Concurrent Self-Composition model and learn how to circumvent impossibility results. Examine the Multiple Ideal Query (MIQ) model and its significance in quantifying security loss. Investigate prior work on upper bounds and the challenges of applying the GMW paradigm to concurrent settings. Understand the core problems of concurrent simulation and how MIQ offers a solution. Discover techniques for improving query complexity, including recursive rewinds and precise simulation strategies. Gain insights into concurrent zero knowledge and approaches for handling static adversaries. This talk provides a comprehensive overview of cutting-edge research in secure computation, offering valuable knowledge for cryptography enthusiasts and researchers alike.

Intro
Concurrent Self-Composition
Circumventing Impossibility Results
Quantifying Security Loss
Multiple Ideal Query (MIQ) Model
Meaningfulness of MIQ Model
Prior Work: Upper Bound
Apply GMW Paradigm to Concurrent Setting?
How Simulators Work
Core Problem of Concurrent Simulation
MIQ to the Rescue
Improving Query Complexity k
Concurrent Zero Knowledge
Solution: Recursive Rewinds
Precise Simulation
Our Strategy
Static Adversaries