Pages that link to "Item:Q2874538"
From MaRDI portal
The following pages link to On the Communication Complexity of Secure Computation (Q2874538):
Displaying 4 items.
- On the (in)efficiency of non-interactive secure multiparty computation (Q1650437) (← links)
- Optimality of a protocol by Feige-Kilian-Naor for three-party secure computation (Q2179390) (← links)
- On the Communication Required for Unconditionally Secure Multiplication (Q2829225) (← links)
- Some Open Problems in Information-Theoretic Cryptography (Q5136294) (← links)
