Entangled Polynomial Codes for Secure, Private, and Batch Distributed Matrix Multiplication: Breaking the "Cubic" Barrier

Qian Yu, Amir Salman Avestimehr. Entangled Polynomial Codes for Secure, Private, and Batch Distributed Matrix Multiplication: Breaking the "Cubic" Barrier. In IEEE International Symposium on Information Theory, ISIT 2020, Los Angeles, CA, USA, June 21-26, 2020. pages 245-250, IEEE, 2020. [doi]

@inproceedings{YuA20-3,
  title = {Entangled Polynomial Codes for Secure, Private, and Batch Distributed Matrix Multiplication: Breaking the "Cubic" Barrier},
  author = {Qian Yu and Amir Salman Avestimehr},
  year = {2020},
  doi = {10.1109/ISIT44484.2020.9174167},
  url = {https://doi.org/10.1109/ISIT44484.2020.9174167},
  researchr = {https://researchr.org/publication/YuA20-3},
  cites = {0},
  citedby = {0},
  pages = {245-250},
  booktitle = {IEEE International Symposium on Information Theory, ISIT 2020, Los Angeles, CA, USA, June 21-26, 2020},
  publisher = {IEEE},
  isbn = {978-1-7281-6432-8},
}