Pages that link to "Item:Q1749308"
From MaRDI portal
The following pages link to On the message complexity of secure multiparty computation (Q1749308):
Displaying 14 items.
- Two-round MPC: information-theoretic and black-box (Q1629402) (← links)
- The complexity of multiparty PSM protocols and related models (Q1648834) (← links)
- The price of low communication in secure multi-party computation (Q1675733) (← links)
- Minimal complete primitives for secure multi-party computation (Q1777285) (← links)
- A note on secure multiparty computation via higher residue symbols (Q2040551) (← links)
- Secure multiparty computation with general interaction patterns (Q2800562) (← links)
- A minimal model for secure computation (extended abstract) (Q2817650) (← links)
- On the complexity of verifiable secret sharing and multiparty computation (Q3192000) (← links)
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography (Q3563850) (← links)
- Communication complexity of secure distributed computation in the presence of noise (Q4014135) (← links)
- On the Bottleneck Complexity of MPC with Correlated Randomness (Q5087257) (← links)
- Multi-Party Protocols, Information Complexity and Privacy (Q5205794) (← links)
- Advances in Cryptology - EUROCRYPT 2004 (Q5307268) (← links)
- Theory of Cryptography (Q5898371) (← links)