00:00:00 / 00:00:00

Almost there: capacity of private information retrieval from coded and colluding servers

By Camilla Hollanti

Appears in collection : ALCOCRYPT - ALgebraic and combinatorial methods for COding and CRYPTography

Private information retrieval (PIR) addresses the question of how to retrieve data items from a database or cloud without disclosing information about the identity of the data items retrieved. The area has received renewed attention in the context of PIR from coded storage. Here, the f iles are distributed over the servers according to a storage code instead of mere replication. Alongside with the basic principles of PIR, we will review recent capacity results and demonstrate the usefulness of the socalled star product PIR scheme. The talk is based on joint work with Ragnar Freij-Hollanti, Oliver Gnilke, Lukas Holzbaur, David Karpuk, and Jie Li.

Information about the video

Citation data

  • DOI 10.24350/CIRM.V.20006203
  • Cite this video Hollanti, Camilla (21/02/2023). Almost there: capacity of private information retrieval from coded and colluding servers. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.20006203
  • URL https://dx.doi.org/10.24350/CIRM.V.20006203



  • SAARELA, Perttu, ALLAIX, Matteo, FREIJ-HOLLANTI, Ragnar, et al. Private Information Retrieval from Colluding and Byzantine Servers with Binary Reed–Muller Codes. In : 2022 IEEE International Symposium on Information Theory (ISIT). IEEE, 2022. p. 2839-2844. - https://doi.org/10.48550/arXiv.2202.09095

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow


  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
  • Get notification updates
    for your favorite subjects
Give feedback