Computational Robust (Fuzzy) Extractors for CRS-dependent Sources with Minimal Min-entropy
Computational Robust (Fuzzy) Extractors for CRS-dependent Sources with Minimal Min-entropy
复制标题
DOI:
10.1007/978-3-030-90453-1_24
复制
发表时间:
2021
期刊:
影响因子:
--
通讯作者:
Hanwen Feng;Qiang Tang
中科院分区:
文献类型:
--
作者:
Hanwen Feng;Qiang Tang
Robust (fuzzy) extractors are very useful for, e.g., authenticated key exchange from a shared weak secret and remote biometric authentication against active adversaries. They enable two parties to extract the same uniform randomness with a “helper” string. More importantly, they have an authentication mechanism built in that tampering of the “helper” string will be detected. Unfortunately, as shown by Dodis and Wichs, in the information-theoretic setting, a robust extractor for an (n,k)-source requires, which is in sharp contrast with randomness extractors which only require. Existing works either rely on random oracles or introduce CRS and work only for CRS-independent sources (even in the computational setting).In this work, we give a systematic study about robust (fuzzy) extractors for general CRSdependentsources. We show in the information-theoretic setting, the same entropy lower bound holds even in the CRS model; we then show wecanhave robust extractors in the computational setting for general CRS-dependent source that is only with minimal entropy. We further extend our construction to robust fuzzy extractors. Along the way, we propose a new primitive called-MAC, which is unforgeable with a weak key and hides all partial information about the key (both against auxiliary input); it may be of independent interests.