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

DOI10.4230/LIPICS.ITC.2022.7zbMATH Open1542.94008MaRDI QIDQ6561687FDOQ6561687

Authors: Marshall Ball, Timothy W. Randolph 

Publication date: 25 June 2024

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

zbMATH Keywords

secure computationprivate simultaneous messages

Mathematics Subject Classification ID

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

Cited In (1)

• Explicit lower bounds for communication complexity of PSM for concrete 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)