2 citations · 3 across the 8 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.DC2023
Near-Optimal Communication Byzantine Reliable Broadcast under a Message Adversary
Timothé Albouy, Davide Frey, Ran Gelles +5
We address the problem of Reliable Broadcast in asynchronous message-passing systems with nodes, of which up to are malicious (faulty), in addition to a message adversary t…
cs.CR2023
The Normal Distributions Indistinguishability Spectrum and its Application to Privacy-Preserving Machine Learning
Yu Wei, Yun Lu, Malik Magdon-Ismail +1
We investigate the privacy of {\em any} algorithm whose outputs have Gaussian distribution. This work is motivated by the prevalence of such algorithms in several useful (ML) appli…