Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore the optimal round complexity of secure multi-party computation with unanimous abort security in the plain model through this 30-minute conference talk by Luisa Siniscalchi from the Technical University of Denmark. Examine scenarios where adversaries may corrupt a majority of parties and discover the main challenges involved in achieving optimal efficiency. Learn about key techniques for constructing secure protocols using cryptographic primitives in a black-box manner, gaining insights into the theoretical foundations and practical considerations of multi-party computation security. Understand how unanimous abort security works in plain model settings and the implications for protocol design when dealing with majority corruption scenarios.
