Pages that link to "Item:Q2096542"

The following pages link to Guaranteed output delivery comes free in honest majority MPC (Q2096542):

Displaying 16 items.

• Order-C secure multiparty computation for highly repetitive circuits (Q2056761) (← links)
• Constant-overhead unconditionally secure multiparty computation over binary fields (Q2056769) (← links)
• Guaranteed output delivery comes free in honest majority MPC (Q2096542) (← links)
• Efficient compiler to covert security with public verifiability for honest majority MPC (Q2096640) (← 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)
• ATLAS: efficient and scalable MPC in the honest majority setting (Q2128563) (← links)
• Unconditional communication-efficient MPC via Hall's marriage theorem (Q2128564) (← links)
• Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC (Q2129015) (← links)
• Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) (Q2691584) (← links)
• Efficient fully secure computation via distributed zero-knowledge proofs (Q2691587) (← links)
• Information-theoretically secure MPC against mixed dynamic adversaries (Q2695650) (← links)
• On the communication efficiency of statistically secure asynchronous MPC with optimal resilience (Q2697681) (← links)
• On communication-efficient asynchronous MPC with adaptive security (Q2697849) (← links)
• Fast large-scale honest-majority MPC for malicious adversaries (Q6110373) (← links)
• MPClan: protocol suite for privacy-conscious computations (Q6110388) (← links)