On the Complexity of Arithmetic Secret Sharing

Ronald Cramer, Chaoping Xing, Chen Yuan 0003. On the Complexity of Arithmetic Secret Sharing. In Rafael Pass, Krzysztof Pietrzak, editors, Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, Proceedings, Part III. Volume 12552 of Lecture Notes in Computer Science, pages 444-469, Springer, 2020. [doi]

@inproceedings{CramerX020,
  title = {On the Complexity of Arithmetic Secret Sharing},
  author = {Ronald Cramer and Chaoping Xing and Chen Yuan 0003},
  year = {2020},
  doi = {10.1007/978-3-030-64381-2_16},
  url = {https://doi.org/10.1007/978-3-030-64381-2_16},
  researchr = {https://researchr.org/publication/CramerX020},
  cites = {0},
  citedby = {0},
  pages = {444-469},
  booktitle = {Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, Proceedings, Part III},
  editor = {Rafael Pass and Krzysztof Pietrzak},
  volume = {12552},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-64381-2},
}