Fuller et al. (Asiacrypt 2013) studied on computational fuzzy extractors, and showed, as a negative result, that the existence of a computational “secure sketch” implies the existence of an information-theoretically secure sketch with slightly weaker parameters. In this work, we show a similar negative result such that, under some computational assumption, the existence of a computational fuzzy extractor also implies the existence of an information-theoretic fuzzy extractor with slightly weaker parameters. The assumption is that the generation procedure of the fuzzy extractor can be efficiently invertible. This result implies that to circumvent the limitations of information-theoretic fuzzy extractors, we need to employ computational fuzzy extractors in which the generation procedure cannot be efficiently invertible.
[1]
Leonid Reyzin,et al.
Fuzzy Extractors ∗
,
2007
.
[2]
Mahdi Cheraghchi,et al.
Invertible extractors and wiretap protocols
,
2009,
2009 IEEE International Symposium on Information Theory.
[3]
Xavier Boyen,et al.
Robust and Reusable Fuzzy Extractors
,
2007
.
[4]
Suela Kodra.
Fuzzy extractors : How to generate strong keys from biometrics and other noisy data
,
2015
.
[5]
Leonid Reyzin,et al.
Computational Fuzzy Extractors
,
2013,
ASIACRYPT.
[6]
Jaikumar Radhakrishnan,et al.
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
,
2000,
SIAM J. Discret. Math..