Lecture notes in computer science

Black-Box Constant-Round Secure 2PC with Succinct Communication

Michele Ciampi, Ankit Kumar Misra, Rafail Ostrovsky, Akash Shah

Published Jan 1, 2025• 4 citations

Related papers

Round-Optimal Black-Box Commit-and-Prove with Succinct Communication

Susumu Kiyoshima

Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol

Susumu Kiyoshima, Yoshifumi Manabe, Tatsuaki Okamoto

On the Round Complexity of Black-Box Secure MPC

Yuval Ishai, Dakshita Khurana, Amit Sahai +1 more

Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer

Arpita Patra, Akshayaram Srinivasan

Round-Optimal Black-Box Secure Computation from Two-Round Malicious OT

Yuval Ishai, Dakshita Khurana, Amit Sahai +1 more

Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator

Ivan Damgård, Yuval Ishai