no code implementations • 28 Sep 2020 • Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer
Combining this primitive with the two-round semi-honest protocol of Applebaun et al. [TCC 2018], we obtain that every randomized functionality can be computed in the shuffle model with an honest majority, in merely two rounds.
