Reusable Fuzzy Extractors for Low-Entropy Distributions
Reusable Fuzzy Extractors for Low-Entropy Distributions
复制标题
用于低熵分布的可重复使用的模糊提取器
DOI:
10.1007/978-3-662-49890-3_5
复制
发表时间:
2016
期刊:
影响因子:
--
通讯作者:
Smith, Adam
中科院分区:
文献类型:
--
作者:
Canetti, Ran;Fuller, Benjamin;Paneth, Omer;Reyzin, Leonid;Smith, Adam
Fuzzy extractors (Dodis et al., in Advances in cryptology—EUROCRYPT 2014, Springer, Berlin, 2014, pp 93–110) convert repeated noisy readings of a secret into the same uniformly distributed key. To eliminate noise, they require an initial enrollment phase that takes the first noisy reading of the secret and produces a nonsecret helper string to be used in subsequent readings.Reusablefuzzy extractors (Boyen, in Proceedings of the 11th ACM conference on computer and communications security, CCS, ACM, New York, 2004, pp 82–91) remain secure even when this initial enrollment phase is repeated multiple times with noisy versions of the same secret, producing multiple helper strings (for example, when a single person’s biometric is enrolled with multiple unrelated organizations). We construct the first reusable fuzzy extractor that makes no assumptions about how multiple readings of the source are correlated. The extractor works for binary strings with Hamming noise; it achieves computational security under the existence of digital lockers (Canetti and Dakdouk, in Advances in cryptology—EUROCRYPT 2008, Springer, Berlin, 2008, pp 489–508). It is simple and tolerates near-linear error rates. Our reusable extractor is secure for source distributions of linear min-entropy rate. The construction is also secure for sources with much lower entropy rates—lower than those supported by prior (nonreusable) constructions—assuming that the distribution has some additional structure, namely, that random subsequences of the source have sufficient minentropy. Structure beyond entropy is necessary to support distributions with low entropy rates. We then explore further how different structural properties of a noisy source can be used to construct fuzzy extractors when the error rates are high, building a computationally secure and an information-theoretically secure construction for large-alphabet sources.
登录
查看更多内容
DOI:
10.1109/isit.2019.8849421
发表时间:
2019-07
期刊:
2019 IEEE International Symposium on Information Theory (ISIT)
影响因子:
--
作者:
Benjamin Fuller;Lowen Peng
通讯作者:
Benjamin Fuller;Lowen Peng
DOI:
10.1109/tit.1972.1054893
发表时间:
1972-09
期刊:
IEEE Trans. Inf. Theory
影响因子:
--
作者:
J. Justesen
通讯作者:
J. Justesen
DOI:
10.1007/978-3-030-30215-3_23
发表时间:
2019-09
期刊:
--
影响因子:
--
作者:
Sailesh Simhadri;James Steel;Benjamin Fuller
通讯作者:
Sailesh Simhadri;James Steel;Benjamin Fuller
DOI:
--
发表时间:
2000
期刊:
Future generations computer systems
影响因子:
--
作者:
C. Ellison;Chris Hall;Randy Milbert;B. Schneier
通讯作者:
B. Schneier
影响因子:
2.5
作者:
Benjamin Fuller;Leonid Reyzin;Adam D. Smith
通讯作者:
Benjamin Fuller;Leonid Reyzin;Adam D. Smith