Scalable Secure Multiparty Computation
From MaRDI portal
Recommendations
Cited in
(60)- Actively secure garbled circuits with constant communication overhead in the plain model
- Rate-1 zero-knowledge proofs from one-way functions
- Adaptive security, erasures, and network assumptions in communication-local MPC
- A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
- On communication-efficient asynchronous MPC with adaptive security
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- Your reputation's safe with me: framing-free distributed zero-knowledge proofs
- Best possible information-theoretic MPC
- Round-optimal secure multi-party computation
- Fluid MPC: secure multiparty computation with dynamic participants
- Efficient asynchronous verifiable secret sharing and multiparty computation
- Network oblivious transfer
- Binary AMD circuits from secure multiparty computation
- Ramp hyper-invertible matrices and their applications to MPC protocols
- scientific article; zbMATH DE number 1303136 (Why is no real title available?)
- Garbled circuits as randomized encodings of functions: a primer
- Your reputation's safe with me: framing-free distributed zero-knowledge proofs
- Proximity gaps for Reed-Solomon codes
- Secure protocol transformations
- OT-Combiners via Secure Computation
- On the bottleneck complexity of MPC with correlated randomness
- Ligero: lightweight sublinear arguments without a trusted setup
- Scalable rational secret sharing
- Network-agnostic security comes (almost) for free in DKG and MPC
- Size-Hiding Computation for Multiple Parties
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- The price of active security in cryptographic protocols
- The bottleneck complexity of secure multiparty computation
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
- Secure \(k\)-skyband computation framework in distributed multi-party databases
- On the Power of Secure Two-Party Computation
- Network-agnostic multi-party computation revisited (extended abstract)
- Secure multiparty computation with free branching
- Order-C secure multiparty computation for highly repetitive circuits
- The more the merrier: reducing the cost of large scale MPC
- Actively secure MPC in the dishonest majority setting: achieving constant complexity in online communication, computation per gate, rounds, and private input size
- Low cost constant round MPC combining BMR and oblivious transfer
- Recent results in scalable multi-party computation
- The price of active security in cryptographic protocols
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Efficient generic zero-knowledge proofs from commitments (extended abstract)
- Fast large-scale honest-majority MPC for malicious adversaries
- Counting Method for Multi-party Computation over Non-abelian Groups
- Secure multi-party computation in large networks
- Scalable multiparty computation from non-linear secret sharing
- Towards achieving asynchronous MPC with linear communication and optimal resilience
- On the power of secure two-party computation
- Scalable agreement protocols with optimal optimistic efficiency
- Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation?
- Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic
- Secure multiparty computation goes live
- SCALES. MPC with small clients and larger ephemeral servers
- Multi-party computation with conversion of secret sharing
- Encoding functions with constant online rate, or how to compress garbled circuit keys
- Graph Design for Secure Multiparty Computation over Non-Abelian Groups
- Secure computation with low communication from cross-checking
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Efficient robust secret sharing from expander graphs
This page was built for publication: Scalable Secure Multiparty Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756646)
