Researchers have posted a new preprint on arXiv examining the complexity of symmetric Boolean functions in the multiparty private simultaneous messages (PSM) model. PSM, also referred to as decomposable randomized encoding or information-theoretic garbling, is a framework for non-interactive secure computation. In this model, each party encodes its own input, and the resulting encodings are combined to reveal only the intended output.
The abstract describes the setting: each party encodes its input using shared randomness, and the paper's focus is on symmetric Boolean functions — functions whose output depends only on the number of inputs that are equal to 1 — and on how their complexity behaves when more than two parties are involved.
The preprint is available on arXiv under identifier 2610.21216. Readers seeking the precise complexity bounds will need to consult the full paper.