Robust and Secure Cache-aided Private Linear Function Retrieval from Coded Servers

Qifa Yan, Daniela Tuninetti. Robust and Secure Cache-aided Private Linear Function Retrieval from Coded Servers. In IEEE International Symposium on Information Theory, ISIT 2021, Melbourne, Australia, July 12-20, 2021. pages 78-83, IEEE, 2021. [doi]

@inproceedings{YanT21-1,
  title = {Robust and Secure Cache-aided Private Linear Function Retrieval from Coded Servers},
  author = {Qifa Yan and Daniela Tuninetti},
  year = {2021},
  doi = {10.1109/ISIT45174.2021.9518207},
  url = {https://doi.org/10.1109/ISIT45174.2021.9518207},
  researchr = {https://researchr.org/publication/YanT21-1},
  cites = {0},
  citedby = {0},
  pages = {78-83},
  booktitle = {IEEE International Symposium on Information Theory, ISIT 2021, Melbourne, Australia, July 12-20, 2021},
  publisher = {IEEE},
  isbn = {978-1-5386-8209-8},
}