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