Pages that link to "Item:Q3457092"

The following pages link to Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits (Q3457092):

Displaying 19 items.

• Going beyond dual execution: MPC for functions with efficient verification (Q2055697) (← links)
• Order-C secure multiparty computation for highly repetitive circuits (Q2056761) (← links)
• The more the merrier: reducing the cost of large scale MPC (Q2056763) (← links)
• Guaranteed output delivery comes free in honest majority MPC (Q2096542) (← links)
• An efficient passive-to-active compiler for honest-majority MPC over rings (Q2117048) (← links)
• Fluid MPC: secure multiparty computation with dynamic participants (Q2128557) (← links)
• Unconditional communication-efficient MPC via Hall's marriage theorem (Q2128564) (← links)
• Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? (Q2691585) (← links)
• Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing (Q2827715) (← links)
• On the Communication Required for Unconditionally Secure Multiplication (Q2829225) (← links)
• Binary AMD Circuits from Secure Multiparty Computation (Q3179363) (← links)
• Round-optimal secure multi-party computation (Q5918346) (← links)
• Fast large-scale honest-majority MPC for malicious adversaries (Q6110373) (← links)
• 3-party secure computation for RAMs: optimal and concretely efficient (Q6581802) (← links)
• Ramp hyper-invertible matrices and their applications to MPC protocols (Q6595682) (← links)
• The price of active security in cryptographic protocols (Q6595846) (← links)
• Stochastic secret sharing with 1-bit shares and applications to MPC (Q6652972) (← links)
• Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions (Q6653026) (← links)
• Scalable multiparty computation from non-linear secret sharing (Q6653034) (← links)