{"id":"https://openalex.org/W4412218056","doi":"https://doi.org/10.4230/lipics.esa.2024.54","title":"Invertible Bloom Lookup Tables with Less Memory and Randomness","display_name":"Invertible Bloom Lookup Tables with Less Memory and Randomness","publication_year":2023,"publication_date":"2023-06-13","ids":{"openalex":"https://openalex.org/W4412218056","doi":"https://doi.org/10.4230/lipics.esa.2024.54"},"language":"en","primary_location":{"id":"pmh:oai:pure.atira.dk:openaire/967cd651-444e-4839-b925-3665dc61cf5a","doi":null,"is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/967cd651-444e-4839-b925-3665dc61cf5a","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fleischhacker, N, Larsen, K G, Obremski, M & Simkin, M 2024, Invertible Bloom Lookup Tables with Less Memory and Randomness. in T Chan, J Fischer, J Iacono & G Herman (eds), 32nd Annual European Symposium on Algorithms, ESA 2024., 54, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, LIPIcs, vol. 308, 32nd Annual European Symposium on Algorithms, ESA 2024, London, United Kingdom, 02/09/2024. https://doi.org/10.4230/LIPIcs.ESA.2024.54","raw_type":"info:eu-repo/semantics/conferenceObject"},"parent_works":[{"id":"https://openalex.org/W6910468974","display_name":"LIPIcs, Volume 308, ESA 2024, Complete Volume","relationship":"part"}],"lineage":["https://openalex.org/W4412218056","https://openalex.org/W6910468974"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.au.dk/portal/en/publications/967cd651-444e-4839-b925-3665dc61cf5a","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000634122","display_name":"Nils Fleischhacker","orcid":"https://orcid.org/0000-0002-2770-5444","observed_orcids":["https://orcid.org/0000-0002-2770-5444"]},"institutions":[{"id":"https://openalex.org/I904495901","display_name":"Ruhr University Bochum","ror":"https://ror.org/04tsk2644","country_code":"DE","type":"education","lineage":["https://openalex.org/I904495901"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Fleischhacker, Nils","raw_affiliation_strings":["Ruhr University Bochum, Germany"],"raw_orcid":"https://orcid.org/0000-0002-2770-5444","affiliations":[{"raw_affiliation_string":"Ruhr University Bochum, Germany","institution_ids":["https://openalex.org/I904495901"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013551063","display_name":"Kasper Green Larsen","orcid":"https://orcid.org/0000-0001-8841-5929","observed_orcids":["https://orcid.org/0000-0001-8841-5929"]},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Larsen, Kasper Green","raw_affiliation_strings":["Aarhus University, Denmark","Aarhus University, Natural Sciences, Department of Computer Science, DK"],"raw_orcid":"https://orcid.org/0000-0001-8841-5929","affiliations":[{"raw_affiliation_string":"Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"Aarhus University, Natural Sciences, Department of Computer Science, DK","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075282848","display_name":"Maciej Obremski","orcid":"https://orcid.org/0000-0003-4174-0438","observed_orcids":["https://orcid.org/0000-0003-4174-0438"]},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]},{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK","SG"],"is_corresponding":true,"raw_author_name":"Obremski, Maciej","raw_affiliation_strings":["National University of Singapore, Singapore","Aarhus University, Natural Sciences, Department of Computer Science, DK"],"raw_orcid":"https://orcid.org/0000-0003-4174-0438","affiliations":[{"raw_affiliation_string":"National University of Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]},{"raw_affiliation_string":"Aarhus University, Natural Sciences, Department of Computer Science, DK","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044936981","display_name":"Mark Simkin","orcid":"https://orcid.org/0000-0002-7325-5261","observed_orcids":["https://orcid.org/0000-0002-7325-5261"]},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]},{"id":"https://openalex.org/I4405269892","display_name":"Ethereum Foundation","ror":"https://ror.org/05j1x9f71","country_code":"CH","type":"nonprofit","lineage":["https://openalex.org/I4405269892"]}],"countries":["CH","DK"],"is_corresponding":true,"raw_author_name":"Simkin, Mark","raw_affiliation_strings":["Ethereum Foundation, Aarhus, Denmark","Aarhus University, Natural Sciences, Department of Computer Science, DK","Ethereum Foundation, DK"],"raw_orcid":"https://orcid.org/0000-0002-7325-5261","affiliations":[{"raw_affiliation_string":"Ethereum Foundation, Aarhus, Denmark","institution_ids":["https://openalex.org/I4405269892"]},{"raw_affiliation_string":"Aarhus University, Natural Sciences, Department of Computer Science, DK","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"Ethereum Foundation, DK","institution_ids":["https://openalex.org/I4405269892"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5000634122","https://openalex.org/A5013551063","https://openalex.org/A5044936981","https://openalex.org/A5075282848"],"corresponding_institution_ids":["https://openalex.org/I165932596","https://openalex.org/I204337017","https://openalex.org/I4405269892","https://openalex.org/I904495901"],"apc_list":null,"apc_paid":null,"fwci":1.0603,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.6672213,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9110999703407288,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9110999703407288,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.06260000169277191,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.016599999740719795,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/set-reconciliation","display_name":"set reconciliation","score":0.6570000052452087},{"id":"https://openalex.org/keywords/space-efficient-data-structures","display_name":"space-efficient data structures","score":0.8199999928474426},{"id":"https://openalex.org/keywords/failure-probability","display_name":"failure probability","score":0.6990000009536743}],"concepts":[{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.7106102705001831},{"id":"https://openalex.org/C134835016","wikidata":"https://www.wikidata.org/wiki/Q690265","display_name":"Lookup table","level":2,"score":0.5636835694313049},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5478931069374084},{"id":"https://openalex.org/C155567681","wikidata":"https://www.wikidata.org/wiki/Q2987425","display_name":"Bloom","level":2,"score":0.5155105590820312},{"id":"https://openalex.org/C96442724","wikidata":"https://www.wikidata.org/wiki/Q242188","display_name":"Invertible matrix","level":2,"score":0.4983973503112793},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4252359867095947},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2946728467941284},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.19386819005012512},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13771992921829224},{"id":"https://openalex.org/C127313418","wikidata":"https://www.wikidata.org/wiki/Q1069","display_name":"Geology","level":0,"score":0.08073234558105469},{"id":"https://openalex.org/C111368507","wikidata":"https://www.wikidata.org/wiki/Q43518","display_name":"Oceanography","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:pure.atira.dk:openaire/967cd651-444e-4839-b925-3665dc61cf5a","doi":null,"is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/967cd651-444e-4839-b925-3665dc61cf5a","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fleischhacker, N, Larsen, K G, Obremski, M & Simkin, M 2024, Invertible Bloom Lookup Tables with Less Memory and Randomness. in T Chan, J Fischer, J Iacono & G Herman (eds), 32nd Annual European Symposium on Algorithms, ESA 2024., 54, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, LIPIcs, vol. 308, 32nd Annual European Symposium on Algorithms, ESA 2024, London, United Kingdom, 02/09/2024. https://doi.org/10.4230/LIPIcs.ESA.2024.54","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:arXiv.org:2306.07583","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2306.07583","pdf_url":"https://arxiv.org/pdf/2306.07583","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:21125","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.54","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol308-esa2024/LIPIcs.ESA.2024.54/LIPIcs.ESA.2024.54.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.48550/arxiv.2306.07583","doi":"https://doi.org/10.48550/arxiv.2306.07583","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2306.07583","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},{"id":"doi:10.4230/lipics.esa.2024.54","doi":"https://doi.org/10.4230/lipics.esa.2024.54","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.esa.2024.54","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj","jufo-1","norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire/967cd651-444e-4839-b925-3665dc61cf5a","doi":null,"is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/967cd651-444e-4839-b925-3665dc61cf5a","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fleischhacker, N, Larsen, K G, Obremski, M & Simkin, M 2024, Invertible Bloom Lookup Tables with Less Memory and Randomness. in T Chan, J Fischer, J Iacono & G Herman (eds), 32nd Annual European Symposium on Algorithms, ESA 2024., 54, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, LIPIcs, vol. 308, 32nd Annual European Symposium on Algorithms, ESA 2024, London, United Kingdom, 02/09/2024. https://doi.org/10.4230/LIPIcs.ESA.2024.54","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G18682879","display_name":"EXC 2092: CyberSicherheit im Zeitalter gro\u00dfskaliger Angreifer (CASA)","funder_award_id":"390781972","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320322724","display_name":"Ministry of Education, India","ror":"https://ror.org/048xjjh50"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4412218056.pdf","grobid_xml":"https://content.openalex.org/works/W4412218056.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W25594804","https://openalex.org/W1520833380","https://openalex.org/W1593069050","https://openalex.org/W2037633400","https://openalex.org/W2142423295","https://openalex.org/W2728476733","https://openalex.org/W2756159815","https://openalex.org/W3117043408","https://openalex.org/W3199824833","https://openalex.org/W3203442625","https://openalex.org/W4235381712","https://openalex.org/W4240018112","https://openalex.org/W4245698957","https://openalex.org/W4285134895","https://openalex.org/W4365936032"],"related_works":["https://openalex.org/W4399254205","https://openalex.org/W2065692759","https://openalex.org/W4252275590","https://openalex.org/W3180031457","https://openalex.org/W4407601396","https://openalex.org/W4294568817","https://openalex.org/W4386075158","https://openalex.org/W4313227240","https://openalex.org/W2570012044","https://openalex.org/W2974973401"],"abstract_inverted_index":{"In":[0],"this":[1,153,168],"work":[2,198],"we":[3,114,212],"study":[4],"Invertible":[5],"Bloom":[6],"Lookup":[7],"Tables":[8],"(IBLTs)":[9],"with":[10,45,87,120,136],"small":[11],"failure":[12,89],"probabilities.":[13],"IBLTs":[14,72,179],"are":[15,74],"highly":[16],"versatile":[17],"data":[18,96],"structures":[19],"that":[20,73,116,141,162],"have":[21,147],"found":[22],"applications":[23],"in":[24],"set":[25],"reconciliation":[26],"protocols,":[27],"error-correcting":[28],"codes,":[29],"and":[30,42,58,79,104,207],"even":[31],"the":[32,163,181],"design":[33],"of":[34,71,91,172,204],"advanced":[35],"cryptographic":[36],"primitives.":[37],"For":[38,83],"storing":[39,84],"$n$":[40,85,118],"elements":[41,86],"ensuring":[43],"correctness":[44],"probability":[46,90,137],"at":[47,92,142],"least":[48,143],"$1":[49,138],"-":[50,139],"\u03b4$,":[51],"existing":[52],"IBLT":[53,211],"constructions":[54,70],"require":[55,80],"$\u03a9(n(\\frac{\\log(1/\u03b4)}{\\log(n)}+1))$":[56],"space":[57,77,103],"they":[59],"crucially":[60],"rely":[61],"on":[62],"fully":[63],"random":[64],"hash":[65,107,124,150],"functions.":[66,108],"We":[67,160,175,193],"present":[68],"new":[69,178,210],"simultaneously":[75],"more":[76,201],"efficient":[78],"less":[81],"randomness.":[82],"a":[88,110,148,200],"most":[93],"$\u03b4$,":[94],"our":[95,177,209],"structure":[97],"only":[98],"requires":[99],"$\\mathcal{O}\\left(n":[100],"+":[101],"\\log(1/\u03b4)\\log\\log(1/\u03b4)\\right)$":[102],"$\\mathcal{O}\\left(\\log(\\log(n)/\u03b4)\\right)$-wise":[105],"independent":[106,123,173],"As":[109],"key":[111],"technical":[112],"ingredient":[113],"show":[115],"hashing":[117],"keys":[119,145],"any":[121],"$k$-wise":[122],"function":[125],"$h:U":[126],"\\to":[127],"[Cn]$":[128],"for":[129,199],"some":[130],"sufficiently":[131],"large":[132],"constant":[133],"$C$":[134],"guarantees":[135],"2^{-\u03a9(k)}$":[140],"$n/2$":[144],"will":[146],"unique":[149],"value.":[151],"Proving":[152],"is":[154],"non-trivial":[155],"as":[156],"$k$":[157],"approaches":[158],"$n$.":[159],"believe":[161],"techniques":[164],"used":[165],"to":[166,180,197],"prove":[167],"statement":[169],"may":[170],"be":[171],"interest.":[174],"apply":[176],"encrypted":[182],"compression":[183,217],"problem,":[184],"recently":[185],"studied":[186],"by":[187],"Fleischhacker,":[188],"Larsen,":[189],"Simkin":[190],"(Eurocrypt":[191],"2023).":[192],"extend":[194],"their":[195],"approach":[196],"general":[202],"class":[203],"encryption":[205],"schemes":[206],"using":[208],"achieve":[213],"an":[214],"asymptotically":[215],"better":[216],"rate.":[218]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2025-10-10T00:00:00"}
