More Like this

1. Cluster-based Partial Dense Retrieval Fused with Sparse Text Retrieval

   https://doi.org/10.1145/3626772.3657972  

   Yang, Yingrui; Carlson, Parker; He, Shanxiu; Qiao, Yifan; Yang, Tao (July 2024, ACM SIGIR '24: Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval.)
2. Private Proximity Retrieval

   https://doi.org/10.1109/ISIT.2019.8849249  

   Etzion, Tuvi; Gnilke, Oliver W.; Karpuk, David; Yaakobi, Eitan; Zhang, Yiwei (July 2019, 2019 IEEE International Symposium on Information Theory (ISIT))
3. LSTM-Based Selective Dense Text Retrieval Guided by Sparse Lexical Retrieval

   https://doi.org/10.1007/978-3-031-88708-6_18  

   Yang, Yingrui; Carlson, Parker; Qiao, Yifan; Xie, Wentai; He, Shanxiu; Yang, Tao (April 2025, Proceedings of 2025 European Conference on Information Retrieval (ECIR 2025). Springer Nature Switzerland)
4. Noisy Private Information Retrieval: On Separability of Channel Coding and Information Retrieval

   https://doi.org/10.1109/TIT.2019.2935440  

   Banawan, Karim; Ulukus, Sennur (December 2019, IEEE Transactions on Information Theory)

   null (Ed.)
5. Heterogeneous Private Information Retrieval

   https://doi.org/10.14722/ndss.2020.24363  

   Mozaffari, Hamid; Houmansadr, Amir (January 2020, Network and Distributed Systems Security (NDSS) Symposium 2020)

   Private information retrieval (PIR) enables clients to query and retrieve data from untrusted servers without the untrusted servers learning which data was retrieved. In this paper, we present a new class of multi-server PIR protocols, which we call heterogeneous PIR (HPIR). In such multi-server PIR protocols, the computation and communication overheads imposed on the PIR servers are non-uniform, i.e., some servers handle higher computation/communication burdens than the others. This enables heterogeneous PIR protocols to be suitable for a range of new PIR applications. What enables us to enforce such heterogeneity is a unique PIR-tailored secret sharing algorithm that we leverage in building our PIR protocol. We have implemented our HPIR protocol and evaluated its performance in comparison with regular (i.e., homogenous) PIR protocols. Our evaluations demonstrate that a querying client can trade off the computation and communication loads of the (heterogeneous) PIR servers by adjusting some parameters. For example in a two-server scenario with a heterogeneity degree of 4/1, to retrieve a 456KB file from a 0.2GB database, the rich (i.e., resourceful) PIR server will do 1.1 seconds worth of computation compared to 0.3 seconds by the poor (resource-constrained) PIR server; this is while each of the servers would do the same 1 seconds of computation in a homogeneous setting. Also, for this given example, our HPIR protocol will impose a 912KB communication bandwidth on the rich server compared to 228KB on the poor server (by contrast to 456KB overheads on each of the servers for a traditional homogeneous design). 

   more » « less