Name
Title | ||
|---|---|---|
Non-malleable Codes from Average-Case Hardness: $${\mathsf {A}}{\mathsf {C}}^0$$ , Decision Trees, and Streaming Space-Bounded Tampering. |
Abstract | ||
|---|---|---|
We show a general framework for constructing non-malleable codes against tampering families with average-case hardness bounds. Our framework adapts ideas from the Naor-Yung double encryption paradigm such that to protect against tampering in a class ({mathcal {F}}), it suffices to have average-case hard distributions for the class, and underlying primitives (encryption and non-interactive, simulatable proof systems) satisfying certain properties with respect to the class. |
Year | Venue | Field |
|---|---|---|
2018 | EUROCRYPT | Multiple encryption,Discrete mathematics,Decision tree,Computer science,Theoretical computer science,Encryption,Bounded function |
DocType | Citations | PageRank |
Conference | 1 | 0.35 |
References | Authors | |
33 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marshall Ball | 1 | 44 | 8.81 |
| Dana Dachman-Soled | 2 | 446 | 28.69 |
| Mukul Kulkarni | 3 | 22 | 2.65 |
| Tal G. Malkin | 4 | 2633 | 152.56 |