Pages that link to "Item:Q5756646"
From MaRDI portal
The following pages link to Scalable Secure Multiparty Computation (Q5756646):
Displaying 42 items.
- Multi-party computation with conversion of secret sharing (Q664384) (← links)
- Efficient robust secret sharing from expander graphs (Q680925) (← links)
- Best possible information-theoretic MPC (Q1631330) (← links)
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme (Q1633440) (← links)
- Secure computation with low communication from cross-checking (Q1710664) (← links)
- Efficient asynchronous verifiable secret sharing and multiparty computation (Q2018817) (← 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)
- The price of active security in cryptographic protocols (Q2119012) (← links)
- Fluid MPC: secure multiparty computation with dynamic participants (Q2128557) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- Secure multi-party computation in large networks (Q2401120) (← links)
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? (Q2691585) (← links)
- On communication-efficient asynchronous MPC with adaptive security (Q2697849) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- On the Power of Secure Two-Party Computation (Q2829222) (← links)
- Secure Protocol Transformations (Q2829224) (← links)
- A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations (Q2947113) (← links)
- Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract) (Q2953816) (← links)
- Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (Q2954373) (← links)
- Binary AMD Circuits from Secure Multiparty Computation (Q3179363) (← links)
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs (Q3457093) (← links)
- Graph Design for Secure Multiparty Computation over Non-Abelian Groups (Q3600363) (← links)
- (Q5002694) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- On the Bottleneck Complexity of MPC with Correlated Randomness (Q5087257) (← links)
- OT-Combiners via Secure Computation (Q5445517) (← links)
- Counting Method for Multi-party Computation over Non-abelian Groups (Q5502759) (← links)
- From fairness to full security in multiparty computation (Q5916285) (← links)
- Round-optimal secure multi-party computation (Q5918346) (← links)
- Low cost constant round MPC combining BMR and oblivious transfer (Q5919016) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q6109074) (← links)
- Fast large-scale honest-majority MPC for malicious adversaries (Q6110373) (← links)
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs (Q6581781) (← links)
- Your reputation's safe with me: framing-free distributed zero-knowledge proofs (Q6581782) (← links)
- Ramp hyper-invertible matrices and their applications to MPC protocols (Q6595682) (← links)
- The price of active security in cryptographic protocols (Q6595846) (← links)
- Network-agnostic multi-party computation revisited (extended abstract) (Q6635768) (← links)
- Towards achieving asynchronous MPC with linear communication and optimal resilience (Q6653027) (← links)
- Scalable agreement protocols with optimal optimistic efficiency (Q6660395) (← links)
