Pages that link to "Item:Q2914294"
From MaRDI portal
The following pages link to Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority (Q2914294):
Displayed 28 items.
- Efficient asynchronous verifiable secret sharing and multiparty computation (Q2018817) (← links)
- Constant-overhead unconditionally secure multiparty computation over binary fields (Q2056769) (← 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)
- ATLAS: efficient and scalable MPC in the honest majority setting (Q2128563) (← links)
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC (Q2129015) (← links)
- Honest majority MPC with abort with minimal online communication (Q2146110) (← links)
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings (Q2175924) (← links)
- Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities (Q2229260) (← 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)
- Better Preprocessing for Secure Multiparty Computation (Q2822679) (← links)
- Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing (Q2827715) (← links)
- Proactive Secret Sharing with a Dishonest Majority (Q2827737) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- Secure Protocol Transformations (Q2829224) (← links)
- On the Communication Required for Unconditionally Secure Multiplication (Q2829225) (← links)
- Broadcast (and Round) Efficient Verifiable Secret Sharing (Q2948264) (← links)
- Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits (Q3457092) (← links)
- On the Computational Overhead of MPC with Dishonest Majority (Q5738762) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time (Q6061361) (← links)
- Fast large-scale honest-majority MPC for malicious adversaries (Q6110373) (← links)
- Prio+: privacy preserving aggregate statistics via Boolean shares (Q6134840) (← links)
- Network-agnostic security comes (almost) for free in DKG and MPC (Q6186588) (← links)
