Perfectly-Secure Multiparty Computation with Linear Communication Complexity over Any Modulus

Daniel Escudero 0001, Yifan Song, Wenhao Wang. Perfectly-Secure Multiparty Computation with Linear Communication Complexity over Any Modulus. IACR Cryptology ePrint Archive, 2024:370, 2024. [doi]

@article{EscuderoSW24,
  title = {Perfectly-Secure Multiparty Computation with Linear Communication Complexity over Any Modulus},
  author = {Daniel Escudero 0001 and Yifan Song and Wenhao Wang},
  year = {2024},
  url = {https://eprint.iacr.org/2024/370},
  researchr = {https://researchr.org/publication/EscuderoSW24},
  cites = {0},
  citedby = {0},
  journal = {IACR Cryptology ePrint Archive},
  volume = {2024},
  pages = {370},
}