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):

Displayed 16 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)
• \textsc{SuperPack}: dishonest majority MPC with constant online communication (Q6061359) ‎ (← links)
• Fast large-scale honest-majority MPC for malicious adversaries (Q6110373) ‎ (← links)
• Sharing transformation and dishonest majority MPC with packed secret sharing (Q6111539) ‎ (← links)
• Non-interactive zero-knowledge proofs to multiple verifiers (Q6135446) ‎ (← links)