Pages that link to "Item:Q775982"
From MaRDI portal
The following pages link to Amortized complexity of information-theoretically secure MPC revisited (Q775982):
Displaying 29 items.
- Constant-overhead unconditionally secure multiparty computation over binary fields (Q2056769) (← links)
- An efficient passive-to-active compiler for honest-majority MPC over rings (Q2117048) (← links)
- Unconditional communication-efficient MPC via Hall's marriage theorem (Q2128564) (← links)
- Efficient information-theoretic multi-party computation over non-commutative rings (Q2128567) (← links)
- Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP (Q2128571) (← links)
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC (Q2129015) (← links)
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions (Q2139630) (← links)
- Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms (Q2146105) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) (Q2170012) (← links)
- Field instruction multiple data (Q2170023) (← links)
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings (Q2175924) (← links)
- Insured MPC: efficient secure computation with financial penalties (Q2226602) (← links)
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) (Q2691584) (← links)
- Circuit amortization friendly encodingsand their application to statistically secure multiparty computation (Q2691586) (← links)
- The quadratic hull of a code and the geometric view on multiplication algorithms (Q5043439) (← links)
- On interactive oracle proofs for Boolean R1CS statements (Q6045202) (← links)
- Sharing transformation and dishonest majority MPC with packed secret sharing (Q6111539) (← links)
- Leakage-resilient linear secret-sharing against arbitrary bounded-size leakage family (Q6114238) (← links)
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings (Q6155261) (← links)
- Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials (Q6157516) (← links)
- Amortized NISC over \(\mathbb{Z}_{2^k}\) from RMFE (Q6595673) (← links)
- Degree-\(D\) reverse multiplication-friendly embeddings: constructions and applications (Q6595675) (← links)
- Ramp hyper-invertible matrices and their applications to MPC protocols (Q6595682) (← links)
- The price of active security in cryptographic protocols (Q6595846) (← links)
- Stochastic secret sharing with 1-bit shares and applications to MPC (Q6652972) (← links)
- Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions (Q6653026) (← links)
- More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings (Q6653054) (← links)
- Scalable agreement protocols with optimal optimistic efficiency (Q6660395) (← links)
