Limits of Practical Sublinear Secure Computation

Explore the boundaries of practical sublinear secure computation in this 25-minute conference talk presented at Crypto 2018. Delve into the research findings of Elette Boyle, Yuval Ishai, and Antigoni Polychroniadou as they discuss their paper on the limitations and possibilities of efficient secure multiparty computation protocols. Gain insights into the challenges and potential solutions for achieving sublinear communication complexity in secure computation, and understand the implications for privacy-preserving distributed computations.

Limits of Practical Sublinear Secure Computation