Anonymized distance filter in hamming space

Yi WANG*, Jianwu Wan, Yiu Ming CHEUNG, Pong Chi YUEN

*Corresponding author for this work

Research output: Chapter in book/report/conference proceedingConference proceedingpeer-review


Search algorithms typically involve intensive distance computations and comparisons. In privacy-aware applications such as biometric identification, exposing the distance information may lead to compromise of sensitive data that have privacy and security implications. In this paper, we design an anonymized distance filter that can test and rank instances in a Hamming-ball search without knowing explicit distance values. We demonstrate the effectiveness of our method on both simulated and real data sets in the context of biometric identification.

Original languageEnglish
Title of host publicationBiometric Recognition - 11th Chinese Conference, CCBR 2016, Proceedings
EditorsShiguang Shan, Zhisheng You, Jie Zhou, Weishi Zheng, Yunhong Wang, Zhenan Sun, Jianjiang Feng, Qijun Zhao
PublisherSpringer Verlag
Number of pages9
ISBN (Print)9783319466538
Publication statusPublished - 2016
Event11th Chinese Conference on Biometric Recognition, CCBR 2016 - Chengdu, China
Duration: 14 Oct 201616 Oct 2016

Publication series

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


Conference11th Chinese Conference on Biometric Recognition, CCBR 2016

Scopus Subject Areas

  • Theoretical Computer Science
  • Computer Science(all)

User-Defined Keywords

  • Distance obfuscation
  • Filtering
  • Hamming-ball search


Dive into the research topics of 'Anonymized distance filter in hamming space'. Together they form a unique fingerprint.

Cite this