Generic Constructions of Robustly Reusable Fuzzy Extractor

11Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Robustly reusable Fuzzy Extractor (rrFE) considers reusability and robustness simultaneously. We present two approaches to the generic construction of rrFE. Both of approaches make use of a secure sketch and universal hash functions. The first approach also employs a special pseudo-random function (PRF), namely unique-input key-shift (ui-ks) secure PRF, and the second uses a key-shift secure auxiliary-input authenticated encryption (AIAE). The ui-ks security of PRF (resp. key-shift security of AIAE), together with the homomorphic properties of secure sketch and universal hash function, guarantees the reusability and robustness of rrFE. Meanwhile, we show two instantiations of the two approaches respectively. The first instantiation results in the first rrFE from the LWE assumption, while the second instantiation results in the first rrFE from the DDH assumption over non-pairing groups.

Author supplied keywords

Cite

CITATION STYLE

APA

Wen, Y., Liu, S., & Gu, D. (2019). Generic Constructions of Robustly Reusable Fuzzy Extractor. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11443 LNCS, pp. 349–378). Springer Verlag. https://doi.org/10.1007/978-3-030-17259-6_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free