Alain Patey

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. Expand

Verifier-Local Revocation (VLR) group signatures, introduced by Boneh and Shacham in 2004 are a particular case of dynamic group signatures where the revocation process does not influence the activity of the signers. Expand

We introduce two new schemes for securely computing Hamming distance in the two-party setting. Expand

We study minimal codes, give new bounds and properties and exhibit families of minimal linear codes. Expand

We propose a new construction for biometric identification based on filtering techniques that has the same security properties as the other SMC-based schemes but runs significantly faster while keeping good biometric performances. Expand

We introduce a new tentative protocol for secure two-party computation of linear functions in the semi-honest model, based on coding techniques. Expand

This article presents a tutorial overview of the application of techniques of secure two-party computation (also known as secure function evaluation) to biometric identification. Expand

The notion of domain-specific pseudonymous signatures (DSPS) has recently been introduced for private authentication of ID documents, like passports, that embed a chip with computational abilities. Expand

Using coset-coding, we describe a new construction for NMC w.r.t. bit-wise independent tampering functions. Expand

We show that the construction using Linear Coset Coding proposed by Chabanne et al. is non-malleable w.r.t. bit-wise independent tampering functions. Expand