The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
A fuzzy vault scheme
Abstract
We describe a simple and novel cryptographic construction that we call a fuzzy vault. Alice may place a secret value /spl kappa/ in a fuzzy vault and "lock" it using an unordered set A of elements from some public universe U. If Bob tries to "unlock" the vault using an unordered set B, he obtains /spl kappa/ only if B is close to A, i.e., only if A and B overlap substantially.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
Gisin, N., Ribordy, G., Tittel, W., & Zbinden, H. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.145 · Cited by 8,515
Algebraic Coding Theory: Revised Edition
Berlekamp, E. R. (2015) · WORLD SCIENTIFIC eBooks · doi:10.1142/9407 · Cited by 2,474
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
Pedersen, T. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_9 · Cited by 2,448
Shift-register synthesis and BCH decoding
Massey, J. (1969) · IEEE Transactions on Information Theory · doi:10.1109/tit.1969.1054260 · Cited by 2,186
Juels, A., & Wattenberg, M. (1999) · Proceedings of the 6th ACM conference on Computer and communications security · doi:10.1145/319709.319714 · Cited by 1,591
Self-citationA Public-Key Cryptosystem Based On Algebraic Coding Theory
McEliece, R. J. (1978) · Deep Space Network Progress Report · Cited by 1,578
Experimental Quantum Cryptography
Bennett, C. H., Bessette, F., Brassard, G., Salvail, L., & Smolin, J. (1991) · Lecture Notes in Computer Science · doi:10.1007/3-540-46877-3_23 · Cited by 959
The design and analysis of graphical passwords
Jermyn, I. H., Mayer, A. J., Monrose, F., Reiter, M. K., & Rubin, A. D. (1999) · Durham Research Online (Durham University) · Cited by 755
Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman
Boyko, V., MacKenzie, P., & Patel, S. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_12 · Cited by 729
On enabling secure applications through off-line biometric identification
Davida, G. I., Frankel, Y., & Matt, B. J. (2002) · Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186) · doi:10.1109/secpri.1998.674831 · Cited by 406
A new identification scheme based on syndrome decoding
Stern, J. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_2 · Cited by 353
Password hardening based on keystroke dynamics
Monrose, F., Reiter, M. K., & Wetzel, S. (1999) · Proceedings of the 6th ACM conference on Computer and communications security · doi:10.1145/319709.319720 · Cited by 315
Practical Quantum Oblivious Transfer
Bennett, C. H., Brassard, G., Crépeau, C., & Skubiszewska, M.-H. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_29 · Cited by 224
A fair and efficient solution to the socialist millionaires’ problem
Boudot, F., Schoenmakers, B., & Traoré, J. (2001) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(00)00342-5 · Cited by 171
Efficient Cryptographic Protocols Based on Noisy Channels
Crépeau, C. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_21 · Cited by 169
Protecting secret keys with personal entropy
Ellison, C. M., Hall, C., Milbert, R., & Schneier, B. (2000) · Future Generation Computer Systems · doi:10.1016/s0167-739x(99)00055-2 · Cited by 106
Noisy Polynomial Interpolation and Noisy Chinese Remaindering
Bleichenbacher, D., & Nguyễn, P. Q. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45539-6_4 · Cited by 98
Cracking DES: Secrets of Encryption Research, Wiretap Politics and Chip Design
Loukides, M., & Gilmore, J. F. (1998) · O'Reilly & Associates, Inc. eBooks · Cited by 88
Cryptanalysis of block ciphers with probabilistic non-linear relations of low degree
Jakobsen, T. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055730 · Cited by 58
Cited by
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
Dodis, Y., Reyzin, L., & Smith, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_31 · Cited by 2,038
Jain, A. K., Nandakumar, K., & Nagar, A. (2008) · EURASIP Journal on Advances in Signal Processing · doi:10.1155/2008/579416 · Cited by 1,134
Biometrics: A Tool for Information Security
Jain, A. K., Ross, A., & Pankanti, S. (2006) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2006.873653 · Cited by 1,095
Biometric recognition: security and privacy concerns
Prabhakar, S., Pankanti, S., & Jain, A. K. (2003) · IEEE Security & Privacy · doi:10.1109/msecp.2003.1193209 · Cited by 1,091
Biometric cryptosystems: issues and challenges
Uludag, U., Pankanti, S., Prabhakar, S., & Jain, A. K. (2004) · Proceedings of the IEEE · doi:10.1109/jproc.2004.827372 · Cited by 921
Metadata
- Authors
- Juels, A., & Sudan, M.
- Venue
- Proceedings IEEE International Symposium on Information Theory,
- Publisher
- IEEE
- Published
- 2003-06-25
- Pages
- 408
- OpenAlex
- W2144596760
- Cited by
- 820
- References
- 20
- FWCI
- 20.13
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.