Amortized NISC over Z₂^k from RMFE
From MaRDI portal
Publication:6595673
Recommendations
Cites work
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- scientific article; zbMATH DE number 2002850 (Why is no real title available?)
- scientific article; zbMATH DE number 2086626 (Why is no real title available?)
- scientific article; zbMATH DE number 7706037 (Why is no real title available?)
- A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity
- Actively secure garbled circuits with constant communication overhead in the plain model
- Amortized complexity of information-theoretically secure MPC revisited
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- Black-box reusable NISC with random oracles
- Degree-\(D\) reverse multiplication-friendly embeddings: constructions and applications
- Efficient non-interactive secure computation
- Extending oblivious transfer with low communication via key-homomorphic PRFs
- Fully homomorphic encryption using ideal lattices
- How to garble arithmetic circuits
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
- Non-interactive secure 2PC in the offline/online and batch settings
- Non-interactive secure computation based on cut-and-choose
- On interactive oracle proofs for Boolean R1CS statements
- Proof of a conjecture of S. Chowla
- Reusable non-interactive secure computation
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
This page was built for publication: Amortized NISC over \(\mathbb{Z}_{2^k}\) from RMFE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595673)
