11 citations · 20 across the 6 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.CR2023
Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited
Ran Cohen, Pouyan Forghani, Juan Garay +2
It is well known that without randomization, Byzantine agreement (BA) requires a linear number of rounds in the synchronous setting, while it is flat out impossible in the asynchro…
cs.CR2023
Communication Lower Bounds for Cryptographic Broadcast Protocols
Erica Blum, Elette Boyle, Ran Cohen +1
Broadcast protocols enable a set of parties to agree on the input of a designated sender, even facing attacks by malicious parties. In the honest-majority setting, randomizatio…
cs.CR2023★ 1 cited
Must the Communication Graph of MPC Protocols be an Expander?
Elette Boyle, Ran Cohen, Deepesh Data +1
Secure multiparty computation (MPC) on incomplete communication networks has been studied within two primary models: (1) Where a partial network is fixed a priori, and thus corrupt…