Pages that link to "Item:Q2175924"

The following pages link to Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings (Q2175924):

Displaying 21 items.

• An efficient passive-to-active compiler for honest-majority MPC over rings (Q2117048) (← links)
• Sumcheck arguments and their applications (Q2120101) (← 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)
• Honest majority MPC with abort with minimal online communication (Q2146110) (← links)
• Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) (Q2691584) (← links)
• Circuit amortization friendly encodingsand their application to statistically secure multiparty computation (Q2691586) (← links)
• An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption (Q2697678) (← links)
• (Q3840514) (← links)
• Rinocchio: SNARKs for ring arithmetic (Q6070447) (← links)
• MPClan: protocol suite for privacy-conscious computations (Q6110388) (← links)
• Attaining GOD beyond honest majority with friends and foes (Q6135412) (← links)
• More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings (Q6155261) (← links)
• Vector commitments over rings and compressed \(\varSigma \)-protocols (Q6169352) (← links)
• Doubly efficient interactive proofs over infinite and non-commutative rings (Q6169369) (← links)
• Lightweight asynchronous verifiable secret sharing with optimal resilience (Q6570529) (← 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)
• On sigma-protocols and (packed) black-box secret sharing schemes (Q6635779) (← links)
• Scalable multiparty computation from non-linear secret sharing (Q6653034) (← links)