Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > PETER CRAWFORD-KAHRL:
All reports by Author Peter Crawford-Kahrl:

TR26-325 | 21st November 2026
Marshall Ball, Peter Crawford-Kahrl, Vladimir Podolskii, Morgan Prior

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

Multiparty Private Simultaneous Messages (PSM), also known as Decomposable Randomized Encoding (DRE) or information-theoretic garbling, is a model for non-interactive secure computation. Each party encodes its input using shared randomness and sends a message to an evaluator who does not know that randomness. The evaluator must recover the function output ... more >>>




ISSN 1433-8092 | Imprint