Pages that link to "Item:Q4910288"

The following pages link to Communication Locality in Secure Multi-party Computation (Q4910288):

Displaying 17 items.

• The more the merrier: reducing the cost of large scale MPC (Q2056763) (← links)
• Spreading the privacy blanket: differentially oblivious shuffling for differential privacy (Q2096625) (← links)
• Is information-theoretic topology-hiding computation possible? (Q2175925) (← links)
• Secure multi-party computation in large networks (Q2401120) (← links)
• High-capacity quantum summation with single photons in both polarization and spatial-mode degrees of freedom (Q2444090) (← links)
• Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs (Q2687034) (← links)
• Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? (Q2691585) (← links)
• Network-Hiding Communication and Applications to Multi-party Protocols (Q2829220) (← links)
• Network Oblivious Transfer (Q2829221) (← links)
• Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs (Q3457093) (← links)
• Secure Multi-party Shuffling (Q3460735) (← links)
• (Q5002694) (← links)
• On the Bottleneck Complexity of MPC with Correlated Randomness (Q5087257) (← links)
• Three-party quantum summation without a trusted third party (Q5258462) (← links)
• From fairness to full security in multiparty computation (Q5916285) (← links)
• Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
• Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)