• Publications
  • Influence
GSHADE: faster privacy-preserving distance computation and biometric identification
TLDR
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
  • 62
  • 7
  • PDF
Backward Unlinkability for a VLR Group Signature Scheme with Efficient Revocation Check
TLDR
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
  • 11
  • 3
  • PDF
SHADE: Secure HAmming DistancE Computation from Oblivious Transfer
TLDR
We introduce two new schemes for securely computing Hamming distance in the two-party setting. Expand
  • 43
  • 2
  • PDF
On Minimal and Quasi-minimal Linear Codes
TLDR
We study minimal codes, give new bounds and properties and exhibit families of minimal linear codes. Expand
  • 32
  • 2
Faster secure computation for biometric identification using filtering
TLDR
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
  • 24
  • 2
  • PDF
Towards Secure Two-Party Computation from the Wire-Tap Channel
TLDR
We introduce a new tentative protocol for secure two-party computation of linear functions in the semi-honest model, based on coding techniques. Expand
  • 26
  • 2
  • PDF
Privacy-Preserving Biometric Identification Using Secure Multiparty Computation: An Overview and Recent Trends
TLDR
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
  • 90
Efficient and Strongly Secure Dynamic Domain-Specific Pseudonymous Signatures for ID Documents
TLDR
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
  • 22
  • PDF
Non-malleable codes from the wire-tap channel
TLDR
Using coset-coding, we describe a new construction for NMC w.r.t. bit-wise independent tampering functions. Expand
  • 19
  • PDF
Secure network coding and non-malleable codes: Protection against linear tampering
TLDR
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
  • 18