Pages that link to "Item:Q775948"
From MaRDI portal
The following pages link to Fast large-scale honest-majority MPC for malicious adversaries (Q775948):
Displaying 42 items.
- Compilation of function representations for secure computing paradigms (Q826238) (← links)
- Multi-party revocation in sovrin: performance through distributed trust (Q826287) (← links)
- Minimising communication in honest-majority MPC by batchwise multiplication verification (Q1656048) (← links)
- Robust multiparty computation with faster verification time (Q1784445) (← links)
- 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)
- 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)
- The price of active security in cryptographic protocols (Q2119012) (← 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)
- The cost of IEEE arithmetic in secure computation (Q2146109) (← links)
- Honest majority MPC with abort with minimal online communication (Q2146110) (← links)
- High throughput secure MPC over small population in hybrid networks (extended abstract) (Q2152069) (← links)
- Secure multiparty computation with free branching (Q2170008) (← links)
- An efficient secure division protocol using approximate multi-bit product and new constant-round building blocks (Q2229283) (← links)
- PC-SyncBB: a privacy preserving collusion secure DCOP algorithm (Q2238607) (← 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)
- Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation (Q2697852) (← links)
- Efficient perfectly secure computation with optimal resilience (Q5918515) (← links)
- Efficient perfectly secure computation with optimal resilience (Q5925697) (← links)
- Le Mans: dynamic and fluid MPC for dishonest majority (Q6097268) (← links)
- Fast large-scale honest-majority MPC for malicious adversaries (Q6110373) (← links)
- MPClan: protocol suite for privacy-conscious computations (Q6110388) (← links)
- Sharing transformation and dishonest majority MPC with packed secret sharing (Q6111539) (← links)
- Attaining GOD beyond honest majority with friends and foes (Q6135412) (← links)
- Non-interactive zero-knowledge proofs to multiple verifiers (Q6135446) (← links)
- Privacy preserving solution of DCOPs by mediation (Q6161505) (← links)
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead (Q6581801) (← links)
- 3-party secure computation for RAMs: optimal and concretely efficient (Q6581802) (← links)
- MPC with delayed parties over star-like networks (Q6595681) (← links)
- Ramp hyper-invertible matrices and their applications to MPC protocols (Q6595682) (← links)
- Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity (Q6595687) (← links)
- The price of active security in cryptographic protocols (Q6595846) (← links)
- MPC for \(\mathcal{Q}_2\) access structures over rings and fields (Q6618586) (← links)
- On information-theoretic secure multiparty computation with local repairability (Q6635769) (← links)
- Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions (Q6653026) (← links)
- Scalable agreement protocols with optimal optimistic efficiency (Q6660395) (← links)
