Bet-or-Pass: Adversarially Robust Bloom Filters

Moni Naor, Noa Oved. Bet-or-Pass: Adversarially Robust Bloom Filters. In Eike Kiltz, Vinod Vaikuntanathan, editors, Theory of Cryptography - 20th International Conference, TCC 2022, Chicago, IL, USA, November 7-10, 2022, Proceedings, Part II. Volume 13748 of Lecture Notes in Computer Science, pages 777-808, Springer, 2022. [doi]

@inproceedings{NaorO22-0,
  title = {Bet-or-Pass: Adversarially Robust Bloom Filters},
  author = {Moni Naor and Noa Oved},
  year = {2022},
  doi = {10.1007/978-3-031-22365-5_27},
  url = {https://doi.org/10.1007/978-3-031-22365-5_27},
  researchr = {https://researchr.org/publication/NaorO22-0},
  cites = {0},
  citedby = {0},
  pages = {777-808},
  booktitle = {Theory of Cryptography - 20th International Conference, TCC 2022, Chicago, IL, USA, November 7-10, 2022, Proceedings, Part II},
  editor = {Eike Kiltz and Vinod Vaikuntanathan},
  volume = {13748},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-031-22365-5},
}