On the Complexity of Symmetric Boolean Functions in Multiparty Private Simultaneous Messages
Paper proves superlinear PSM lower bounds for symmetric Boolean functions and near-linear support-private upper bounds.
2 stories, newest first · one card per story
Paper proves superlinear PSM lower bounds for symmetric Boolean functions and near-linear support-private upper bounds.
Cryptographers construct explicit highly nonlinear maps over finite fields that beat the classical Fourier agreement bound.
Today 1.6K readers · 2.5K views · 778 reads · all time 189K views