activity
20182026
most citedComparison of two combinatorial models of global network dynamics

5 citations · 7 across the 4 of their papers we have counts for

collaborators
Showing cs.CRShow all

1 paper · 1 filter

cs.CR2026

On the Complexity of Symmetric Boolean Functions in Multiparty Private Simultaneous Messages

Marshall Ball, Peter Crawford-Kahrl, Vladimir Podolskii +1

Multiparty Private Simultaneous Messages (PSM), also known as Decomposable Randomized Encoding (DRE) or information-theoretic garbling, is a model for non-interactive secure comput…