Pages that link to "Item:Q2056769"
From MaRDI portal
The following pages link to Constant-overhead unconditionally secure multiparty computation over binary fields (Q2056769):
Displaying 9 items.
- Constant-overhead unconditionally secure multiparty computation over binary fields (Q2056769) (← links)
- Unconditional communication-efficient MPC via Hall's marriage theorem (Q2128564) (← 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)
- On interactive oracle proofs for Boolean R1CS statements (Q6045202) (← links)
- Sharing transformation and dishonest majority MPC with packed secret sharing (Q6111539) (← 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)
