Efficient pseudorandom correlation generators over Z/p^kZ
From MaRDI portal
Publication:6863908
Cites work
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- Compressing unit-vector correlations via sparse pseudorandom generators
- Correlated pseudorandom functions from variable-density LPN
- Correlated pseudorandomness from expand-accumulate codes
- Correlated pseudorandomness from the hardness of quasi-abelian decoding
- Distributed Point Functions and Their Applications
- Efficient pseudorandom correlation generators for any finite field
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators: silent OT extension and more
- Expand-convolute codes for pseudorandom correlation generators from LPN
- FOLEAGE: \(\mathbb{F}_4\)OLE-based multi-party computation for Boolean circuits
- Function secret sharing
- Half-tree: halving the cost of tree expansion in COT and DPF
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- scientific article; zbMATH DE number 2002850 (Why is no real title available?)
- Lapin: an efficient authentication protocol based on ring-LPN
- Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP
- Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \)
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
- More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
- Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)
- Multiparty Computation from Somewhat Homomorphic Encryption
- Oblivious transfer with constant computational overhead
- Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption
- Semi-homomorphic encryption and multiparty computation
- Separable Algebras Over Commutative Rings
- The hardness of LPN over any integer ring and field for PCG applications
This page was built for publication: Efficient pseudorandom correlation generators over \(\mathbb{Z}/p^k\mathbb{Z} \)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6863908)
