BFLUT Bloom Filter for Private Look Up Tables

Shlomi Dolev, Ehud Gudes, Erez Segev, Jeffrey D. Ullman, Grisha Weintraub

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Open addressing hash tables, possibly under double hashing policy, are regarded more memory efficient than linked list hashing; as the memory used for pointers can be used for a longer table, and allow better-expected performance as the load factor is smaller and there are fewer expected collisions. We suggest further eliminating the single pointer to the memory location used in each entry of the open addressing, and using a single bit per entry, namely use a Bloom Filter to encode the memory address. Thus, obtain even a better load factor, with the same memory, and less number of wrongly mapped addresses when the load is low. Moreover, we can prove that the content in the lookup table that is based on the bloom filter is pseudo-random (in the level of randomization implied by the hash function), thus, keeping the items and the addresses that the LookUp Table (LUT) encodes private.

Original languageEnglish
Title of host publicationCyber Security, Cryptology, and Machine Learning - 6th International Symposium, CSCML 2022, Proceedings
EditorsShlomi Dolev, Amnon Meisels, Jonathan Katz
PublisherSpringer Science and Business Media Deutschland GmbH
Pages499-505
Number of pages7
Volume13301
ISBN (Electronic)978-3-031-07689-3
ISBN (Print)978-3-031-07688-6
DOIs
StatePublished - 2022
Event6th International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2022 - Beer Sheva, Israel
Duration: 30 Jun 20221 Jul 2022

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13301 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2022
Country/TerritoryIsrael
CityBeer Sheva
Period30/06/221/07/22

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'BFLUT Bloom Filter for Private Look Up Tables'. Together they form a unique fingerprint.

Cite this