Pages that link to "Item:Q6155261"
From MaRDI portal
The following pages link to More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings (Q6155261):
Displaying 10 items.
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority (Q1784115) (← links)
- Circuit amortization friendly encodingsand their application to statistically secure multiparty computation (Q2691586) (← links)
- (Q3840514) (← links)
- Lightweight asynchronous verifiable secret sharing with optimal resilience (Q6570529) (← links)
- Amortized NISC over \(\mathbb{Z}_{2^k}\) from RMFE (Q6595673) (← links)
- Degree-\(D\) reverse multiplication-friendly embeddings: constructions and applications (Q6595675) (← links)
- ZK-for-Z2K: MPC-in-the-head zero-knowledge proofs for \(\mathbb{Z}_{2^k}\) (Q6595940) (← links)
- Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions (Q6653026) (← links)
- Scalable multiparty computation from non-linear secret sharing (Q6653034) (← links)
- More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings (Q6653054) (← links)