A fuzzy commitment scheme

@inproceedings{Juels1999AFC,
  title={A fuzzy commitment scheme},
  author={Ari Juels and Martin Wattenberg},
  booktitle={CCS '99},
  year={1999}
}
We combine well-known techniques from the areas of error-correcting codes and cryptography to achieve a new type of cryptographic primitive that we refer to as a fuzzy commitment scheme. Like a conventional cryptographic commitment scheme, our fuzzy commitment scheme is both concealing and binding: it is infeasible for an attacker to learn the committed value, and also for the committer to decommit a value in more than one way. In a conventional scheme, a commitment must be opened using a… 
Statistical Hiding Fuzzy Commitment Scheme for Securing Biometric Templates
TLDR
This paper combines biometrics and OFCS to achieve biometric protection scheme using smart cards with renewability of protected biometric template property.
eSketch: a privacy-preserving fuzzy commitment scheme for authentication using encrypted biometrics
TLDR
The e-sketch protocol proposed in this paper, solves the above two problems by resorting to tools from Multi Party Computation relying on the additively homomorphic property of the underlying cryptosystem (e.e. the Pailler's cryptos system).
Decodability Attack against the Fuzzy Commitment Scheme with Public Feature Transforms
TLDR
By means of a public transformation, the attack cannot be prevented in a binary fuzzy commitment scheme based on linear codes and one may consider to use the improved fuzzy vault scheme by Dodis et al. which may be secured against linkability attacks.
Information Leakage in Fuzzy Commitment Schemes
TLDR
The analysis shows that fuzzy commitment is only optimal for the memoryless totally symmetric case if the scheme operates at the maximum secret-key rate, and it is demonstrated that for the general memoryless and stationary ergodic cases, the scheme leaks information on both the secret and biometric data.
Biometric cryptosystems based fuzzy commitment scheme: a security evaluation
TLDR
Several metrics are presented to analyze the security and evaluate the weaknesses of biometric cryptosystems based on fuzzy commitment scheme to prove their security strength and effectiveness.
A Fuzzy Vault Scheme
TLDR
Fuzzy vaults have potential application to the problem of protecting data in a number of real-world, error-prone environments and also to biometric authentication systems, in which readings are inherently noisy as a result of the refractory nature of image capture and processing.
Provably Secure Multi-Server Authentication Protocol Using Fuzzy Commitment
TLDR
This work proposes a new three-factor authenticated key agreement scheme using a fuzzy commitment approach that can resist other known attacks, and a comparative study of the proposed scheme with the existing related schemes is conducted.
Improved fuzzy commitment scheme
TLDR
Improved fuzzy commitment scheme or code-offset constructions are presented that use more than one key to secure the biometric data and increase the exhaustive search space.
Fuzzy Identity Based Encryption Preliminary Version
TLDR
This paper presents a construction of a Fuzzy IBE scheme that uses groups with efficiently computable bilinear maps that does not use Random Oracles and proves the security of the scheme under the Selective-ID security model.
Fingerprint-Based Fuzzy Vault: Implementation and Performance
TLDR
This work presents a fully automatic implementation of the fuzzy vault scheme based on fingerprint minutiae, a biometric cryptosystem that secures both the secret key and the biometric template by binding them within a cryptographic framework.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 60 REFERENCES
A Digital Signature Scheme Based on Linear Error-correcting Block Codes
TLDR
The signature scheme described in this paper derives its security from the complexity of three problems: the decoding of general linear error-correcting block codes, the factoring of large matrices, and the derivation of a matrix from its right inverse.
A New Identification Scheme Based on Syndrome Decoding
  • J. Stern
  • Computer Science, Mathematics
    CRYPTO
  • 1993
TLDR
This paper proposes a new identification scheme, based on error-correcting codes, which is zero-knowledge and is of practical value, and describes several variants, including one which has an identity based character.
Efficient Cryptographic Protocols Based on Noisy Channels
TLDR
These protocols provide efficient protocols to achieve the cryptographic primitives of Bit Commitment and Oblivious Transfer based on the existence of a Binary Symmetric Channel that allow two people to extract secret information from partially compromised data.
On enabling secure applications through off-line biometric identification
  • G. Davida, Y. Frankel, B. Matt
  • Computer Science, Mathematics
    Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186)
  • 1998
TLDR
This paper studies secure off-line authenticated user identification schemes based on a biometric system that can measure a user's biometrics accurately (up to some Hamming distance) and investigates a new technology which allows a users' biometric data to facilitate cryptographic mechanisms.
Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations
This paper proposes a bit commitment scheme, BC(·), and efficient statistical zero knowledge (in short, SZK) protocols in which, for any given multi-variable polynomial f(X 1,..,X t) and any given
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
It is shown how to distribute a secret to n persons such that each person can verify that he has received correct information about the secret without talking with other persons. Any k of these
Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result
TLDR
The protocol can be usen as an essential tool in proving that all languages in IP have zero knowledge proof systems, i.e. any statement which can be proved interactively can also be proved in zero knowledge.
Cryptanalysis of Block Ciphers with Probabilistic Non-linear Relations of Low Degree
Using recent results from coding theory, it is shown how to break block ciphers operating on GF(q) where the ciphertext is expressible as evaluations of an unknown univariate polynomial of low degree
UNIX Password Security - Ten Years Later
TLDR
It is concluded that the single most important step that can be taken to improve password security is to increase password entropy.
On the Relation of Error Correction and Cryptography to an Off Line Biometric Based Identification S
TLDR
An in depth discussion of the role of error correcting codes in the cryptographically secure biometric authentication scheme is given.
...
1
2
3
4
5
...