Lecture notes in computer science

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

Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Hendrik Waldner

Published Jan 1, 2025• 2 citations

Related papers

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

Arpita Patra, Akshayaram Srinivasan

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

Ivan Damgård, Yuval Ishai

Round Optimal Secure Multiparty Computation from Minimal Assumptions

Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal +2 more

Round-Optimal Black-Box Two-Party Computation

Rafail Ostrovsky, Silas Richelson, Alessandra Scafuro

List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing

Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi +1 more

Active Security in Multiparty Computation over Black-Box Groups

Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld