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

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

Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Hendrik Waldner

In this work we study the problem of minimizing the round complexity for securely evaluating multiparty functionalities while making black-box use of polynomial time assumptions. In Eurocrypt 2016, Garg et al. showed that, assuming all parties have access to a broadcast channel, then at least four rounds of communication are required to securely realize non-trivial functionalities in the plain …

applications box complexity eprint report eurocrypt list making oblivious problem report study transfer work