GSHADE: faster privacy-preserving distance computation and biometric identification

@inproceedings{Bringer2014GSHADEFP,
  title={GSHADE: faster privacy-preserving distance computation and biometric identification},
  author={J. Bringer and H. Chabanne and M. Favre and Alain Patey and T. Schneider and Michael Zohner},
  booktitle={IH&MMSec '14},
  year={2014}
}
  • J. Bringer, H. Chabanne, +3 authors Michael Zohner
  • Published in IH&MMSec '14 2014
  • Mathematics, Computer Science
  • 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… CONTINUE READING
    62 Citations

    Figures, Tables, and Topics from this paper

    Boosting GSHADE Capabilities: New Applications and Security in Malicious Setting
    • 3
    Efficient and secure template blinding for biometric authentication
    • 2
    • Highly Influenced
    Implementation of Fixed-Length Template Protection Based on Homomorphic Encryption with Application to Signature Biometrics
    • 14
    • PDF
    Instant Privacy-Preserving Biometric Authentication for Hamming Distance
    • 1
    • Highly Influenced
    • PDF
    A Privacy-Preserving Edge Computation-Based Face Verification System for User Authentication
    • 5
    • PDF
    Communication-efficient private distance calculation based on oblivious transfer extensions
    • Highly Influenced
    • PDF
    Privacy-Preserving Fingerprint Authentication Resistant to Hill-Climbing Attacks
    • 5
    Privacy-preserving PLDA speaker verification using outsourced secure computation
    • 4
    • Highly Influenced
    • PDF

    References

    SHOWING 1-4 OF 4 REFERENCES
    How To Exchange Secrets with Oblivious Transfer
    • M. Rabin
    • Computer Science
    • IACR Cryptol. ePrint Arch.
    • 2005
    • 1,122
    • Highly Influential
    • PDF
    GMW vs
    • Yao? E cient secure two-party computation with low depth circuits. In Financial Cryptography (FC), volume 7859 of LNCS, pages 275–292. Springer
    • 2013
    Krøigaard. E cient and secure comparison for on-line auctions
    • In Australasian Conference on Information Security and Privacy (ACISP),
    • 2007
    Eigenfaces vs
    • Fisherfaces: Recognition 196 N = 128 N = 1024 Protocol [28] Ours [28] Ours (Techniques) (HE+GC) (GSHADE+GMW) (HE+GC)
    • 1000