Error-Tolerant Searchable Encryption
Julien Bringer, Hervé Chabanne, Bruno Kindarji · 2009
In this paper, we describe a new primitive for error-tolerant searchable encryption and a security model for it. This generic scheme permits to make searches on encrypted data with only an approximation of some keyword. It enables to efficiently query secure databases in order to get the exact data with a close estimation of it. An application to biometric identification arises from this construction. This is the first construction both for error-tolerant searchable encryption and for a biometric identification protocol over encrypted personal data.