At WAHC’13, Bringer et al. introduced a protocol called SHADE for secure and
efficient Hamming distance computation using oblivious transfer only. We
introduce a generalization of the SHADE protocol, called GSHADE, that
enables privacy-preserving computation of several distance metrics,
including (normalized) Hamming distance, Euclidean distance, Mahalanobis
distance, and scalar product. GSHADE can be used to efficiently compute
one-to-many biometric identification for several traits (iris, face,
fingerprint) and benefits from recent optimizations of oblivious transfer
extensions. GSHADE allows identification against a database of 1 000
Eigenfaces in 1.28 seconds and against a database of 10 000 IrisCodes in
17.2 seconds which is more than 10 times faster than previous works.

This is joint work with Julien Bringer, Hervé Chabanne, Mélanie Favre, Alain
Patey, and Michael Zohner published at ACM IH&MMSec 2014.