Lecture notes in computer science

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

Ivan Damgård, Yuval Ishai

Published Jan 1, 2005• 178 citations

Related papers

Round-Optimal Black-Box Multiparty Computation from Polynomial-Time Assumptions

Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi +1 more

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

Arpita Patra, Akshayaram Srinivasan

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

Susumu Kiyoshima, Yoshifumi Manabe, Tatsuaki Okamoto

Secure Multiparty RAM Computation in Constant Rounds

Sanjam Garg, Divya Gupta, Peihan Miao +1 more

Active Security in Multiparty Computation over Black-Box Groups

Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld

Round-Optimal Black-Box Two-Party Computation

Rafail Ostrovsky, Silas Richelson, Alessandra Scafuro