A note on the complexity of private simultaneous messages with many parties

DOI10.4230/LIPICS.ITC.2022.7MaRDI QIDQ6561687zbMATH OpenFDO

Authors Marshall Ball, Timothy W. Randolph

Publication date 25 June 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ITC.2022.7

zbMATH Keywords

private simultaneous messagessecure computation

Mathematics Subject Classification ID

Distributed systems (68M14) Communication theory (94A05) Cryptography (94A60)

Recommendations

• Multi-party PSM, revisited: improved communication and unbalanced communication
• The complexity of multiparty PSM protocols and related models
• The communication complexity of private simultaneous messages, revisited
• The communication complexity of private simultaneous messages, revisited
• Explicit lower bounds for communication complexity of PSM for concrete functions

Cited in

(4)

• Explicit lower bounds for communication complexity of PSM for concrete functions
• Efficient multiparty private simultaneous messages for symmetric functions
• Card-based protocols imply PSM protocols
• On the communication complexity of PSM and CDS for symmetric functions

This page was built for publication: A note on the complexity of private simultaneous messages with many parties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561687)