The complexity of multiparty PSM protocols and related models

DOI10.1007/978-3-319-78375-8_10MaRDI QIDQ1648834zbMATH OpenOpenAlexFDO

Authors Amos Beimel, Eyal Kushilevitz, Pnina Nissim

Publication date 9 July 2018

Full work available at URL https://doi.org/10.1007/978-3-319-78375-8_10

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12)

Recommendations

• Multi-Party Protocols, Information Complexity and Privacy
• Multi-party protocols, information complexity and privacy
• On the message complexity of secure multiparty computation
• Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
• Theory and Practice of Multiparty Computation
• The broadcast message complexity of secure multiparty computation
• Multiparty communication complexity and very hard functions
• scientific article; zbMATH DE number 7559107
• The bottleneck complexity of secure multiparty computation
• Multi-party PSM, revisited: improved communication and unbalanced communication

Cited in

(18)

• Measuring, simulating and exploiting the head concavity phenomenon in BKZ
• Explicit lower bounds for communication complexity of PSM for concrete functions
• A 3-party simultaneous protocol for SUM-INDEX
• Placing conditional disclosure of secrets in the communication complexity universe
• On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate
• Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
• On abelian and homomorphic secret sharing schemes
• Cryptography from planted graphs: security with logarithmic-size messages
• Garbled circuit lookup tables with logarithmic number of ciphertexts
• Optimal linear multiparty conditional disclosure of secrets protocols
• Threshold garbled circuits and ad hoc secure computation
• 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
• Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions
• A note on the complexity of private simultaneous messages with many parties
• Ad hoc PSM protocols: secure computation without coordination
• Private simultaneous messages based on quadratic residues

This page was built for publication: The complexity of multiparty PSM protocols and related models

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