Name
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. |
Year | Venue | Field |
|---|---|---|
2019 | IACR Cryptology ePrint Archive | Homomorphic encryption,Computer science,Universal hashing,Theoretical computer science,Robustness (computer science),Hash function,Fuzzy extractor,Authenticated encryption,Reusability,Sketch |
DocType | Volume | Citations |
Journal | 2019 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yunhua Wen | 1 | 0 | 1.01 |
| Shengli Liu | 2 | 91 | 6.98 |
| Dawu Gu | 3 | 644 | 103.50 |