Pages that link to "Item:Q2119064"
From MaRDI portal
The following pages link to A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity (Q2119064):
Displaying 13 items.
- Amortized complexity of information-theoretically secure MPC revisited (Q775982) (← links)
- Masked triples. Amortizing multiplication triples across conditionals (Q2061960) (← links)
- Sublinear GMW-style compiler for MPC with preprocessing (Q2128572) (← links)
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC (Q2129015) (← links)
- Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) (Q2170012) (← links)
- Circuit amortization friendly encodingsand their application to statistically secure multiparty computation (Q2691586) (← links)
- On interactive oracle proofs for Boolean R1CS statements (Q6045202) (← links)
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings (Q6155261) (← links)
- Amortized NISC over \(\mathbb{Z}_{2^k}\) from RMFE (Q6595673) (← links)
- Degree-\(D\) reverse multiplication-friendly embeddings: constructions and applications (Q6595675) (← links)
- The price of active security in cryptographic protocols (Q6595846) (← 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)
