Paper 2002/093

A Fuzzy Vault Scheme

Ari Juels and Madhu Sudan

Abstract

We describe a simple and novel cryptographic construction that we refer to as a {\em fuzzy vault}. A player Alice may place a secret value $\kappa$ in a fuzzy vault and ``lock'' it using a set $A$ of elements from some public universe $U$. If Bob tries to ``unlock'' the vault using a set $B$ of similar length, he obtains $\kappa$ only if $B$ is close to $A$, i.e., only if $A$ and $B$ overlap substantially. In constrast to previous constructions of this flavor, ours possesses the useful feature of {\em order invariance}, meaning that the ordering of $A$ and $B$ is immaterial to the functioning of the vault. As we show, our scheme enjoys provable security against a computationally unbounded attacker.

Metadata
Available format(s)
PDF PS
Category
Cryptographic protocols
Publication info
Published elsewhere. A one page abstract of this paper appeared in _Proceedings of ISIT '02_.
Contact author(s)
ajuels @ rsasecurity com
History
2002-07-15: received
Short URL
https://ia.cr/2002/093
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2002/093,
      author = {Ari Juels and Madhu Sudan},
      title = {A Fuzzy Vault Scheme},
      howpublished = {Cryptology {ePrint} Archive, Paper 2002/093},
      year = {2002},
      url = {https://eprint.iacr.org/2002/093}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.