The Round Complexity of B
The Round Complexity of Black-Box Post-Quantum Secure Computation
The Round Complexity of Black-Box Post-Quantum Secure Computation
arXiv:2502.13830v1 Announce Type: cross
Abstract: We study the round complexity of secure multi-party computation (MPC) in the post-quantum regime. Our focus is on the fully black-box setting, where both the construction and security reduction are black-box. Chia, Chung, Liu, and Yamakawa [FOCS’22]…
