Pages that link to "Item:Q1784115"
From MaRDI portal
The following pages link to \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority (Q1784115):
Displaying 44 items.
- Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption (Q785020) (← links)
- Compilation of function representations for secure computing paradigms (Q826238) (← links)
- Yet another compiler for active security or: efficient MPC over arbitrary rings (Q1784116) (← links)
- High-performance multi-party computation for binary circuits based on oblivious transfer (Q2044760) (← links)
- Secure multi-party quantum computation with a dishonest majority (Q2055679) (← links)
- Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \) (Q2055698) (← links)
- Large scale, actively secure computation from LPN and free-XOR garbled circuits (Q2056780) (← links)
- Masked triples. Amortizing multiplication triples across conditionals (Q2061960) (← links)
- Actively secure setup for SPDZ (Q2072211) (← links)
- Improved primitives for MPC over mixed arithmetic-binary circuits (Q2096551) (← links)
- P2DEX: privacy-preserving decentralized cryptocurrency exchange (Q2117034) (← links)
- An efficient passive-to-active compiler for honest-majority MPC over rings (Q2117048) (← links)
- Sumcheck arguments and their applications (Q2120101) (← links)
- Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP (Q2128571) (← 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)
- Full-threshold actively-secure multiparty arithmetic circuit garbling (Q2146106) (← links)
- Honest majority MPC with abort with minimal online communication (Q2146110) (← links)
- Secure multiparty computation with free branching (Q2170008) (← links)
- Secure multiparty computation with sublinear preprocessing (Q2170009) (← links)
- Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) (Q2170012) (← links)
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings (Q2175924) (← links)
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security (Q2179391) (← links)
- An efficient secure division protocol using approximate multi-bit product and new constant-round building blocks (Q2229283) (← links)
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) (Q2691584) (← links)
- Improved Multiplication Triple Generation over Rings via RLWE-Based AHE (Q3297630) (← links)
- Sok: vector OLE-based zero-knowledge protocols (Q6063131) (← links)
- MPClan: protocol suite for privacy-conscious computations (Q6110388) (← links)
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) (Q6132407) (← 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)
- Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\) (Q6166955) (← links)
- Vector commitments over rings and compressed \(\varSigma \)-protocols (Q6169352) (← links)
- Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic (Q6176271) (← links)
- A new approach to efficient and secure fixed-point computation (Q6547972) (← 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)
- MPC for \(\mathcal{Q}_2\) access structures over rings and fields (Q6618586) (← links)
- Privacy-preserving edit distance computation using secret-sharing two-party computation (Q6619924) (← links)
- The hardness of LPN over any integer ring and field for PCG applications (Q6637566) (← 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)
