Can Adaptive Communication Graphs Lower the Bottleneck Complexity of (Secure) Multiparty Computation?

Lisa Kohl, Pierre Meyer, Divya Ravi 0001, Nicolas Resch. Can Adaptive Communication Graphs Lower the Bottleneck Complexity of (Secure) Multiparty Computation?. IACR Cryptology ePrint Archive, 2026:608, 2026. [doi]

Abstract

Abstract is missing.