Fuzzy extractors

Security with Noisy Data: On Private Biometrics, Secure Key Storage and Anti-Counterfeiting

Volumn , Issue , 2007, Pages 79-99

  Dodis, Yevgeniy ^a   Reyzin, Leonid ^b   Smith, Adam ^c  

^a NEW YORK UNIVERSITY   (United States)

^b BOSTON UNIVERSITY   (United States)

^c PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84873433835     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-1-84628-984-2_5     Document Type: Chapter

References (4)

1. n) and let Ext (w; x) be l least significant bits of wx.
2. This follows from Lemma A.1 of [90], which applies to secure sketches that work for the uniform distribution. We do not know of a result that rules out constructions of secure sketches that work better for lower entropy levels, although by Lemma B.1 of [90] they would not work as well for the uniform case.
3. Since the assumption here only plays a role in correctness, it is still more reasonable than assuming that we know exact distributions on the data in proofs of secrecy. However, in both cases, we would like to enlarge the class of distributions for which we can provably satisfy the definition of security.
4. The code families use in the Dodis-Smith construction are sometimes called "generalized Reed-Solomon" codes.