The following publications are possibly variants of this publication:
- Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/p^k ZMark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero 0001, Matthieu Rambaud, Chaoping Xing, Chen Yuan 0003. iacr, 2020:1256, 2020. [doi]
- Asymptotically-Good Arithmetic Secret Sharing over $\mathbb {Z}/p^{\ell }\mathbb {Z}$ with Strong Multiplication and Its Applications to Efficient MPCRonald Cramer, Matthieu Rambaud, Chaoping Xing. crypto 2021: 656-686 [doi]
- Asymptotically-Good Arithmetic Secret Sharing over Z/(p^\ell Z) with Strong Multiplication and Its Applications to Efficient MPCRonald Cramer, Matthieu Rambaud, Chaoping Xing. iacr, 2019:832, 2019. [doi]
- More Efficient Dishonest Majority Secure Computation over $\mathbb {Z}_{2^k}$ via Galois RingsDaniel Escudero 0001, Chaoping Xing, Chen Yuan 0003. crypto 2022: 383-412 [doi]
- k and some good negacyclic codes over $\mathbb {Z}_{4}+u\mathbb {Z}_{4}$" [Cryptogr. Commun. (2017) 9: 241-272]Yuan Cao 0001, Yonglin Cao, Ramakrishna Bandi, Fang-Wei Fu. ccds, 12(6):1107-1110, 2020. [doi]
- $${\pmb {{\mathbb {Z}}}}_p{\pmb {{\mathbb {Z}}}}_p[v]$$-additive cyclic codes are asymptotically goodXiaotong Hou, Jian Gao 0001. jamc, 66(1-2):871-884, June 2021. [doi]
- (σ, δ)-Skew quasi-cyclic codes over the ring $\mathbb {Z}_{4}+u\mathbb {Z}_{4}$Fanghui Ma, Jian Gao, Juan Li, Fang-Wei Fu 0001. ccds, 13(2):307-320, 2021. [doi]