Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

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

Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Hendrik Waldner

Published Jan 1, 2023• 4 citations
Publisher
DOI
10.1007/978-3-031-38557-5_15

Related papers

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

Arpita Patra, Akshayaram Srinivasan

Lecture notes in computer science•Jan 1, 2021•11 citations

On the Black-Box Complexity of Optimally-Fair Coin Tossing

Dana Dachman-Soled, Yehuda Lindell, Mohammad Mahmoody +1 more

Lecture notes in computer science•Jan 1, 2011•60 citations

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

Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi +1 more

Lecture notes in computer science•Jan 1, 2025•2 citations

Oblivious-Transfer Complexity of Noisy Coin-Toss via Secure Zero Communication Reductions

Saumya Goyal, Varun Narayanan, Manoj Prabhakaran

Lecture notes in computer science•Jan 1, 2022•2 citations

Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious

Bar Alon, Eran Omri

Journal of Cryptology•Jun 7, 2023•3 citations

Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious

Bar Alon, Eran Omri

Lecture notes in computer science•Jan 1, 2016•32 citations