Name
Abstract | ||
|---|---|---|
In STOC 2008, Peikert and Waters introduced a powerful primitive called lossy trapdoor functions (LTFs). In a nutshell, LTFs are functions that behave in one of two modes. In the normal mode, functions are injective and invertible with a trapdoor. In the lossy mode, functions statistically lose information about their inputs. Moreover, the two modes are computationally indistinguishable. In this work, we put forward a relaxation of LTFs, namely, regular lossy functions (RLFs). Compared to LTFs, the functions in the normal mode are not required to be efficiently invertible or even unnecessary to be injective. Instead, they could also be lossy, but in a regular manner. We also put forward richer abstractions of RLFs, namely all-but-one regular lossy functions (ABO-RLFs) and one-time regular lossy filters (OT-RLFs). |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.tcs.2018.04.043 | Theoretical Computer Science |
Keywords | Field | DocType |
Regular lossy functions,Hash proof system,Leakage resilience,One-way functions,Message authentication codes,(Identity-based) key encapsulation mechanism | Discrete mathematics,Injective function,Message authentication code,Lossy compression,Cryptography,Key encapsulation,Encryption,Hash function,Mathematics,Key size | Journal |
Volume | ISSN | Citations |
739 | 0304-3975 | 2 |
PageRank | References | Authors |
0.37 | 31 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yu Chen | 1 | 69 | 10.26 |
| Baodong Qin | 2 | 190 | 19.40 |
| Haiyang Xue | 3 | 12 | 6.61 |