Pages that link to "Item:Q2691586"
From MaRDI portal
The following pages link to Circuit amortization friendly encodingsand their application to statistically secure multiparty computation (Q2691586):
Displaying 11 items.
- A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity (Q2119064) (← links)
- Efficient information-theoretic multi-party computation over non-commutative rings (Q2128567) (← links)
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices (Q2128574) (← links)
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC (Q2129015) (← links)
- An isogeny-based ID protocol using structured public keys (Q2149792) (← links)
- Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) (Q2170012) (← links)
- Field instruction multiple data (Q2170023) (← links)
- Rinocchio: SNARKs for ring arithmetic (Q6070447) (← links)
- Doubly efficient interactive proofs over infinite and non-commutative rings (Q6169369) (← links)
- CSI-SharK: CSI-FiSh with sharing-friendly keys (Q6535498) (← links)
- VSS from distributed ZK proofs and applications (Q6595689) (← links)
