{"id":"https://openalex.org/W2533461851","doi":"https://doi.org/10.1109/wifs.2011.6123149","title":"Secure binary embeddings for privacy preserving nearest neighbors","display_name":"Secure binary embeddings for privacy preserving nearest neighbors","publication_year":2011,"publication_date":"2011-11-01","ids":{"openalex":"https://openalex.org/W2533461851","doi":"https://doi.org/10.1109/wifs.2011.6123149","mag":"2533461851"},"language":"en","primary_location":{"id":"doi:10.1109/wifs.2011.6123149","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wifs.2011.6123149","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Workshop on Information Forensics and Security","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034522188","display_name":"Petros T. Boufounos","orcid":"https://orcid.org/0000-0003-1369-0947"},"institutions":[{"id":"https://openalex.org/I4210159266","display_name":"Mitsubishi Electric (United States)","ror":"https://ror.org/053jnhe44","country_code":"US","type":"company","lineage":["https://openalex.org/I1306287861","https://openalex.org/I4210133125","https://openalex.org/I4210159266"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Petros Boufounos","raw_affiliation_strings":["Mitsubishi Electric Research Laboratories, Inc., Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Mitsubishi Electric Research Laboratories, Inc., Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210159266"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035310261","display_name":"Shantanu Rane","orcid":"https://orcid.org/0009-0003-6319-1764"},"institutions":[{"id":"https://openalex.org/I4210159266","display_name":"Mitsubishi Electric (United States)","ror":"https://ror.org/053jnhe44","country_code":"US","type":"company","lineage":["https://openalex.org/I1306287861","https://openalex.org/I4210133125","https://openalex.org/I4210159266"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shantanu Rane","raw_affiliation_strings":["Mitsubishi Electric Research Laboratories, Inc., Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Mitsubishi Electric Research Laboratories, Inc., Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210159266"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5034522188"],"corresponding_institution_ids":["https://openalex.org/I4210159266"],"apc_list":null,"apc_paid":null,"fwci":7.044,"has_fulltext":false,"cited_by_count":57,"citation_normalized_percentile":{"value":0.9696927,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9997000098228455,"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/T10237","display_name":"Cryptography and Data Security","score":0.9997000098228455,"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/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9994999766349792,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9994000196456909,"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/locality-sensitive-hashing","display_name":"Locality-sensitive hashing","score":0.8406810760498047},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.7251761555671692},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.6497053503990173},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6377222537994385},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.6144760251045227},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5977090001106262},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.583076536655426},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5746017694473267},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.5347169041633606},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.4462585747241974},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.4410066306591034},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.43538710474967957},{"id":"https://openalex.org/keywords/k-independent-hashing","display_name":"K-independent hashing","score":0.41893577575683594},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3976140022277832},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3779136836528778},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3260379433631897},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3105822801589966},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.24803456664085388},{"id":"https://openalex.org/keywords/perfect-hash-function","display_name":"Perfect hash function","score":0.12117904424667358},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.10014402866363525}],"concepts":[{"id":"https://openalex.org/C74270461","wikidata":"https://www.wikidata.org/wiki/Q1625299","display_name":"Locality-sensitive hashing","level":4,"score":0.8406810760498047},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.7251761555671692},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.6497053503990173},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6377222537994385},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.6144760251045227},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5977090001106262},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.583076536655426},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5746017694473267},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.5347169041633606},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.4462585747241974},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.4410066306591034},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.43538710474967957},{"id":"https://openalex.org/C187062812","wikidata":"https://www.wikidata.org/wiki/Q6322840","display_name":"K-independent hashing","level":5,"score":0.41893577575683594},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3976140022277832},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3779136836528778},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3260379433631897},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3105822801589966},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.24803456664085388},{"id":"https://openalex.org/C87431388","wikidata":"https://www.wikidata.org/wiki/Q2070573","display_name":"Perfect hash function","level":4,"score":0.12117904424667358},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.10014402866363525},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/wifs.2011.6123149","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wifs.2011.6123149","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Workshop on Information Forensics and Security","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.308.12","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.308.12","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://boufounos.com/Publications/BR_WIFS2011_LSH.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.5,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W346929228","https://openalex.org/W1544327602","https://openalex.org/W1608862252","https://openalex.org/W2038276547","https://openalex.org/W2060256514","https://openalex.org/W2103012681","https://openalex.org/W2119422255","https://openalex.org/W2125378448","https://openalex.org/W2125482545","https://openalex.org/W2132172731","https://openalex.org/W2134627110","https://openalex.org/W2151789982","https://openalex.org/W2259030728","https://openalex.org/W2799061466","https://openalex.org/W2949903712","https://openalex.org/W2951692209","https://openalex.org/W2979473749","https://openalex.org/W3097609957","https://openalex.org/W4230946174","https://openalex.org/W4233413206","https://openalex.org/W4297911263","https://openalex.org/W6611554128","https://openalex.org/W6677934245","https://openalex.org/W6678556256"],"related_works":["https://openalex.org/W2011582495","https://openalex.org/W2182477562","https://openalex.org/W2245581955","https://openalex.org/W2169618946","https://openalex.org/W2375128115","https://openalex.org/W50423144","https://openalex.org/W3096071782","https://openalex.org/W2902799860","https://openalex.org/W4289129280","https://openalex.org/W2045263322"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,29,36,73,117],"novel":[3],"method":[4,26],"to":[5,13,19,112,143,154],"securely":[6],"determine":[7],"whether":[8],"two":[9,109],"signals":[10,49,69,110],"are":[11,98],"similar":[12],"each":[14],"other,":[15],"and":[16,84],"apply":[17],"it":[18],"approximate":[20],"nearest":[21,146],"neighbor":[22,147],"clustering.":[23],"The":[24],"proposed":[25],"relies":[27],"on":[28,35],"locality":[30],"sensitive":[31],"hashing":[32],"scheme":[33],"based":[34],"secure":[37],"binary":[38,138],"embedding,":[39],"computed":[40],"using":[41],"quantized":[42],"random":[43],"projections.":[44],"Hashes":[45],"extracted":[46],"from":[47],"the":[48,53,56,65,68,79,94,101,105,120,127,158],"preserve":[50],"information":[51,77,103],"about":[52,78],"distance":[54,60,66,80,125],"between":[55,67,104,126],"signals,":[57],"provided":[58,88],"this":[59,90,132],"is":[61,70,81,87],"small":[62],"enough.":[63],"If":[64],"larger":[71],"than":[72],"threshold,":[74],"then":[75,100],"no":[76],"revealed.":[82],"Theoretical":[83],"experimental":[85],"justification":[86],"for":[89],"property.":[91],"Further,":[92],"when":[93],"randomized":[95],"embedding":[96],"parameters":[97],"unknown,":[99],"mutual":[102],"hashes":[106,139],"of":[107,119,131],"any":[108],"decays":[111],"zero":[113],"exponentially":[114],"fast":[115],"as":[116],"function":[118],"\u2113":[121],"<sub":[122],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[123],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sub>":[124],"signals.":[128,160],"Taking":[129],"advantage":[130],"property,":[133],"we":[134],"suggest":[135],"that":[136],"these":[137],"can":[140],"be":[141],"used":[142],"perform":[144],"privacy-preserving":[145],"search":[148],"with":[149],"significantly":[150],"lower":[151],"complexity":[152],"compared":[153],"protocols":[155],"which":[156],"use":[157],"actual":[159]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}