{"id":"https://openalex.org/W7164013258","doi":"https://doi.org/10.1145/3798129.3800855","title":"Locally Computable High Independence Hashing","display_name":"Locally Computable High Independence Hashing","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W7164013258","doi":"https://doi.org/10.1145/3798129.3800855"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800855","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800855","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":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3798129.3800855","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012298614","display_name":"Yevgeniy Dodis","orcid":"https://orcid.org/0000-0003-1013-6318"},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yevgeniy Dodis","raw_affiliation_strings":["New York University, New York, USA"],"raw_orcid":"https://orcid.org/0000-0003-1013-6318","affiliations":[{"raw_affiliation_string":"New York University, New York, USA","institution_ids":["https://openalex.org/I57206974"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044999305","display_name":"Shachar Lovett","orcid":"https://orcid.org/0000-0003-4552-1443"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shachar Lovett","raw_affiliation_strings":["University of California at San Diego, San Diego, USA"],"raw_orcid":"https://orcid.org/0000-0003-4552-1443","affiliations":[{"raw_affiliation_string":"University of California at San Diego, San Diego, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058929075","display_name":"Daniel Wichs","orcid":"https://orcid.org/0000-0002-4981-1643"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Wichs","raw_affiliation_strings":["NTT Research, Sunnyvale, USA","Northeastern University, Boston, USA"],"raw_orcid":"https://orcid.org/0000-0002-4981-1643","affiliations":[{"raw_affiliation_string":"NTT Research, Sunnyvale, USA","institution_ids":[]},{"raw_affiliation_string":"Northeastern University, Boston, USA","institution_ids":["https://openalex.org/I12912129"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.95381343,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1465","last_page":"1476"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.26809999346733093,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.26809999346733093,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.11060000211000443,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.08100000023841858,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.8817999958992004},{"id":"https://openalex.org/keywords/double-hashing","display_name":"Double hashing","score":0.767300009727478},{"id":"https://openalex.org/keywords/collision-resistance","display_name":"Collision resistance","score":0.5824000239372253},{"id":"https://openalex.org/keywords/dynamic-perfect-hashing","display_name":"Dynamic perfect hashing","score":0.5759999752044678},{"id":"https://openalex.org/keywords/rolling-hash","display_name":"Rolling hash","score":0.5346999764442444},{"id":"https://openalex.org/keywords/perfect-hash-function","display_name":"Perfect hash function","score":0.4724999964237213},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.41850000619888306},{"id":"https://openalex.org/keywords/universal-hashing","display_name":"Universal hashing","score":0.3926999866962433}],"concepts":[{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.8817999958992004},{"id":"https://openalex.org/C138111711","wikidata":"https://www.wikidata.org/wiki/Q478351","display_name":"Double hashing","level":4,"score":0.767300009727478},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5863000154495239},{"id":"https://openalex.org/C150909736","wikidata":"https://www.wikidata.org/wiki/Q1779448","display_name":"Collision resistance","level":5,"score":0.5824000239372253},{"id":"https://openalex.org/C122907437","wikidata":"https://www.wikidata.org/wiki/Q5318999","display_name":"Dynamic perfect hashing","level":5,"score":0.5759999752044678},{"id":"https://openalex.org/C108546238","wikidata":"https://www.wikidata.org/wiki/Q4228982","display_name":"Rolling hash","level":5,"score":0.5346999764442444},{"id":"https://openalex.org/C87431388","wikidata":"https://www.wikidata.org/wiki/Q2070573","display_name":"Perfect hash function","level":4,"score":0.4724999964237213},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4487999975681305},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.41850000619888306},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4171000123023987},{"id":"https://openalex.org/C116058348","wikidata":"https://www.wikidata.org/wiki/Q846912","display_name":"Universal hashing","level":5,"score":0.3926999866962433},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.382099986076355},{"id":"https://openalex.org/C135783594","wikidata":"https://www.wikidata.org/wiki/Q5678864","display_name":"Hash chain","level":3,"score":0.38089999556541443},{"id":"https://openalex.org/C190157925","wikidata":"https://www.wikidata.org/wiki/Q1968605","display_name":"SHA-2","level":4,"score":0.36649999022483826},{"id":"https://openalex.org/C187062812","wikidata":"https://www.wikidata.org/wiki/Q6322840","display_name":"K-independent hashing","level":5,"score":0.3521000146865845},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3407999873161316},{"id":"https://openalex.org/C133358856","wikidata":"https://www.wikidata.org/wiki/Q7395188","display_name":"SWIFFT","level":5,"score":0.3138999938964844},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3068999946117401},{"id":"https://openalex.org/C27353603","wikidata":"https://www.wikidata.org/wiki/Q16948622","display_name":"Hash tree","level":4,"score":0.3037000000476837},{"id":"https://openalex.org/C165511393","wikidata":"https://www.wikidata.org/wiki/Q7252276","display_name":"Security of cryptographic hash functions","level":5,"score":0.3037000000476837},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2989000082015991},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.29649999737739563},{"id":"https://openalex.org/C7608002","wikidata":"https://www.wikidata.org/wiki/Q477202","display_name":"Cryptographic hash function","level":3,"score":0.2904999852180481},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.2572999894618988},{"id":"https://openalex.org/C200086178","wikidata":"https://www.wikidata.org/wiki/Q3841252","display_name":"MDC-2","level":5,"score":0.25519999861717224}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3798129.3800855","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800855","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":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3798129.3800855","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800855","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":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W198177064","https://openalex.org/W1527478789","https://openalex.org/W1781587470","https://openalex.org/W1816509092","https://openalex.org/W2003184432","https://openalex.org/W2008159385","https://openalex.org/W2009316475","https://openalex.org/W2014860393","https://openalex.org/W2063844956","https://openalex.org/W2069788171","https://openalex.org/W2071179368","https://openalex.org/W2100008268","https://openalex.org/W2104965768","https://openalex.org/W2114924587","https://openalex.org/W2121818942","https://openalex.org/W2139964991","https://openalex.org/W2164322063","https://openalex.org/W2194772305","https://openalex.org/W2330003519","https://openalex.org/W3173879634","https://openalex.org/W4412215412"],"related_works":[],"abstract_inverted_index":{"We":[0],"consider":[1],"(almost)":[2,14],"k-wise":[3],"independent":[4],"hash":[5,24,65,69,80,95],"functions,":[6],"whose":[7],"evaluations":[8],"on":[9],"any":[10],"k":[11,57],"inputs":[12],"are":[13],"uniformly":[15],"random,":[16],"for":[17],"very":[18],"large":[19,30],"values":[20],"of":[21,54],"k.":[22,36],"Such":[23,68],"functions":[25,66,70,81],"need":[26],"to":[27,42,73],"have":[28,71],"a":[29,51,94],"key":[31],"that":[32],"grows":[33],"linearly":[34],"with":[35,89,97],"However,":[37],"it":[38],"may":[39],"be":[40],"possible":[41],"evaluate":[43],"them":[44],"in":[45,85],"sub-linear":[46],"time":[47],"by":[48],"only":[49],"reading":[50],"small":[52],"subset":[53],"t":[55],"\u226a":[56],"locations":[58],"during":[59],"each":[60],"evaluation;":[61],"we":[62,103],"call":[63],"such":[64],"t-local.":[67],"applications":[72],"nearly":[74],"optimal":[75],"bounded-use":[76],"information-theoretic":[77],"cryptography.":[78],"Local":[79],"were":[82],"previously":[83],"studied":[84],"several":[86],"works":[87],"starting":[88],"Siegel":[90],"(FOCS\u201989,":[91],"SICOMP\u201904).":[92],"For":[93],"function":[96],"n-bit":[98],"input":[99],"and":[100],"output":[101],"size,":[102],"get":[104],"the":[105],"following":[106],"new":[107],"results:":[108]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-10T00:00:00"}