Pages that link to "Item:Q3457093"
From MaRDI portal
The following pages link to Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs (Q3457093):
Displaying 16 items.
- Perfectly secure oblivious parallel RAM (Q1631354) (← links)
- Sublinear-round Byzantine agreement under corrupt majority (Q2055693) (← links)
- A logarithmic lower bound for oblivious RAM (for all Parameters) (Q2139649) (← links)
- Secure multi-party computation in large networks (Q2401120) (← 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)
- Oblivious Parallel RAM and Applications (Q2799095) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- (Q5002694) (← links)
- On the Computational Overhead of MPC with Dishonest Majority (Q5738762) (← links)
- Better Two-Round Adaptive Multi-party Computation (Q5738763) (← links)
- Is there an oblivious RAM lower bound for online reads? (Q5915623) (← links)
- From fairness to full security in multiparty computation (Q5916285) (← links)
- Is there an oblivious RAM lower bound for online reads? (Q5918328) (← 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)
