Pages that link to "Item:Q1653077"
From MaRDI portal
The following pages link to Efficient maliciously secure multiparty computation for RAM (Q1653077):
Displaying 14 items.
- Constant-round maliciously secure two-party computation in the RAM model (Q2010585) (← links)
- Gradual GRAM and secure computation for RAM programs (Q2106643) (← links)
- Adaptively secure computation for RAM programs (Q2170045) (← links)
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security (Q2179391) (← links)
- Improved building blocks for secure multi-party computation based on secret sharing with honest majority (Q2229285) (← links)
- Efficient constant-round multi-party computation combining BMR and SPDZ (Q2318094) (← links)
- Forward secret encrypted RAM: lower bounds and applications (Q2697886) (← links)
- Approximate shared-memory counting despite a strong adversary (Q2930301) (← links)
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs (Q3457093) (← links)
- Distributed Oblivious RAM for Secure Two-Party Computation (Q4910289) (← links)
- Collusion-resistant functional encryption for RAMs (Q6135396) (← links)
- Maliciously secure massively parallel computation for all-but-one corruptions (Q6155275) (← links)
- Multi-client Oblivious RAM Secure Against Malicious Servers (Q6487224) (← links)
- Doubly efficient cryptography: commitments, arguments and RAM MPC (Q6653029) (← links)