Amortized Complexity of Information Theoretically Secure MPC Revisited

Amortized Complexity of Information Theoretically Secure MPC Revisited

Explore a comprehensive analysis of the amortized complexity in information-theoretically secure multiparty computation (MPC) presented at Crypto 2018. Delve into the research findings of Ignacio Cascudo, Ronald Cramer, Chaoping Xing, and Chen Yuan as they revisit and expand upon this crucial topic in cryptography. Gain insights into the latest developments and theoretical advancements in secure multiparty computation protocols, focusing on their efficiency and scalability in real-world applications.