Efficient multiparty private simultaneous messages for symmetric functions
From MaRDI portal
Cites work
- A minimal model for secure computation (extended abstract)
- A note on the complexity of private simultaneous messages with many parties
- Ad hoc PSM protocols: secure computation without coordination
- Conditional disclosure of secrets via non-linear reconstruction
- Distribution design
- Explicit lower bounds for communication complexity of PSM for concrete functions
- How to share a secret
- Multi-party PSM, revisited: improved communication and unbalanced communication
- Non-interactive secure multiparty computation
- Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions
- On the communication complexity of secure computation
- On the Cryptographic Complexity of the Worst Functions
- On the Distribution of Quadratic Residues and Nonresidues Modulo a Prime Number
- Private simultaneous messages based on quadratic residues
- Robust non-interactive multiparty computation against constant-size collusion
- Secure computation on the web: computing without simultaneous interaction
- Secure computation with minimal interaction, revisited
- Secure multiparty computation with general interaction patterns
- Secure multiparty computation with minimal interaction
- The communication complexity of private simultaneous messages, revisited
- The complexity of multiparty PSM protocols and related models
- Towards breaking the exponential barrier for general secret sharing
This page was built for publication: Efficient multiparty private simultaneous messages for symmetric functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891254)
