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

Daniel Escudero 0001, Chaoping Xing, Chen Yuan 0003. More Efficient Dishonest Majority Secure Computation over $\mathbb {Z}_{2^k}$ via Galois Rings. In Yevgeniy Dodis, Thomas Shrimpton, editors, Advances in Cryptology - CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15-18, 2022, Proceedings, Part I. Volume 13507 of Lecture Notes in Computer Science, pages 383-412, Springer, 2022. [doi]

@inproceedings{EscuderoXY22,
  title = {More Efficient Dishonest Majority Secure Computation over $\mathbb {Z}_{2^k}$ via Galois Rings},
  author = {Daniel Escudero 0001 and Chaoping Xing and Chen Yuan 0003},
  year = {2022},
  doi = {10.1007/978-3-031-15802-5_14},
  url = {https://doi.org/10.1007/978-3-031-15802-5_14},
  researchr = {https://researchr.org/publication/EscuderoXY22},
  cites = {0},
  citedby = {0},
  pages = {383-412},
  booktitle = {Advances in Cryptology - CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15-18, 2022, Proceedings, Part I},
  editor = {Yevgeniy Dodis and Thomas Shrimpton},
  volume = {13507},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-031-15802-5},
}