Efficient multi-party computation over rings
From MaRDI portal
Recommendations
- Efficient information-theoretic multi-party computation over non-commutative rings
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- Perfectly-Secure MPC with Linear Communication Complexity
- An efficient passive-to-active compiler for honest-majority MPC over rings
- Round-optimal secure multi-party computation
Cited in
(30)- Best possible information-theoretic MPC
- Towards breaking the exponential barrier for general secret sharing
- On compiling Boolean circuits optimized for secure multi-party computation
- Graph coloring applied to secure computation in non-abelian groups
- On abelian and homomorphic secret sharing schemes
- Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes
- Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \)
- An efficient passive-to-active compiler for honest-majority MPC over rings
- Sumcheck arguments and their applications
- Efficient information-theoretic multi-party computation over non-commutative rings
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- Uncovering algebraic structures in the MPC landscape
- Efficient integer span program for hierarchical threshold access structure
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \)
- Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces
- Encoding functions with constant online rate, or how to compress garbled circuit keys
- Generic constant-round oblivious sorting algorithm for MPC
- scientific article; zbMATH DE number 5972643 (Why is no real title available?)
- Communication lower bounds via critical block sensitivity
- Garbled circuits as randomized encodings of functions: a primer
- \textsc{Hide} \& \textsc{Seek}: privacy-preserving rebalancing on payment channel networks
- Private simultaneous messages based on quadratic residues
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
- Doubly efficient interactive proofs over infinite and non-commutative rings
- Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions
- Compressing unit-vector correlations via sparse pseudorandom generators
- Scalable multiparty computation from non-linear secret sharing
- Actively secure polynomial evaluation from shared polynomial encodings
- Robustness for space-bounded statistical zero knowledge
- Key-dependent message security: generic amplification and completeness
This page was built for publication: Efficient multi-party computation over rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4434901)
