More Efficient Dishonest Majority Secure Computation over $\mathbb {Z}_{2^k}$ via Galois Rings.

Daniel Escudero, Chaoping Xing, Chen Yuan

Browse the full CRYPTO paper archive.