Papers: Read / cite

[dettanym]

Coeus: https://dl-acm-org.proxy.lib.uwaterloo.ca/doi/10.1145/3477132.3483586

• Can we adapt their work to the same set of k nodes as in the non-private approach? (So the number of hops would stay the same as the non-private approach, whereas normalization increases the number of hops.)
  Content Censorship Attack: https://arxiv.org/abs/2307.12212

Batched PIR protocols — https://eprint.iacr.org/2022/1262 — also built on top of BFV. It works really well for lots of small records and they compare against SealPIR, Spiral etc.

• Naively rerunning a PIR protocol, we would leak which file is being accessed to the number of blocks retrieved. Can we reduce this leakage through batched PIR?
• Compare the overhead against SealPIR etc for medium numbers of large payload sizes.

Other related work by Erik Daniel. Cite them under related work for our paper.

• Improving Bitswap Privacy with Forwarding and Source Obfuscation: https://arxiv.org/pdf/2307.03480.pdf
• Privacy-Enhanced Content Discovery for Bitswap: https://ieeexplore.ieee.org/document/10186387
• Leaking file length in Bitswap: https://petsymposium.org/popets/2019/popets-2019-0056.pdf
• "Authenticated PIR": https://nikirill.com/files/apir.pdf

Other stuff:

• [] https://dl.acm.org/doi/10.1145/3618257.3624797