Name
Abstract | ||
|---|---|---|
At WAHC'13, Bringer et al. introduced a protocol called SHADE for secure and efficient Hamming distance computation using oblivious transfer only. In this paper, 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 1000 Eigenfaces in 1.28 seconds and against a database of 10000 IrisCodes in 17.2 seconds which is more than 10 times faster than previous works. |
Year | DOI | Field |
|---|---|---|
2014 | 10.1145/2600918.2600922 | Eigenface,Computer science,Euclidean distance,Fingerprint,Theoretical computer science,Mahalanobis distance,Hamming distance,Biometrics,Oblivious transfer,Computation |
DocType | Citations | PageRank |
Conference | 19 | 0.71 |
References | Authors | |
33 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Julien Bringer | 1 | 802 | 53.01 |
| Herve Chabanne | 2 | 51 | 4.41 |
| M'elanie Favre | 3 | 19 | 0.71 |
| Alain Patey | 4 | 128 | 8.02 |
| Thomas Schneider | 5 | 1540 | 69.17 |
| Michael Zohner | 6 | 409 | 13.44 |