Explicit lower bounds for communication complexity of PSM for concrete functions

DOI10.1007/978-3-031-56235-8_3MaRDI QIDQ6623345zbMATH OpenFDO

Authors Kazumasa Shinagawa, Koji Nuida

Publication date 23 October 2024

Full work available at URL https://doi.org/10.1007/978-3-031-56235-8_3

zbMATH Keywords

communication complexityconcrete functionslower boundsprivate simultaneous messagessecure multiparty computation

Mathematics Subject Classification ID

Communication theory (94A05) Cryptography (94A60)

Recommendations

• The communication complexity of private simultaneous messages, revisited
• The communication complexity of private simultaneous messages, revisited
• Multi-party PSM, revisited: improved communication and unbalanced communication
• A note on the complexity of private simultaneous messages with many parties
• The complexity of multiparty PSM protocols and related models

Cites work

• A minimal model for secure computation (extended abstract)
• A note on the complexity of private simultaneous messages with many parties
• scientific article; zbMATH DE number 7650434 (Why is no real title available?)
• Multi-party PSM, revisited: improved communication and unbalanced communication
• On the communication complexity of secure computation
• On the Cryptographic Complexity of the Worst Functions
• Private simultaneous messages based on quadratic residues
• Some open problems in information-theoretic cryptography
• The communication complexity of private simultaneous messages, revisited
• The complexity of multiparty PSM protocols and related models

Cited in

(2)

• A note on the complexity of private simultaneous messages with many parties
• Efficient multiparty private simultaneous messages for symmetric functions

This page was built for publication: Explicit lower bounds for communication complexity of PSM for concrete functions

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