Name
Abstract | ||
|---|---|---|
Non-malleable codes (NMCs), introduced by Dziembowski, Pietrzak and Wichs [20], provide a useful message integrity guarantee in situations where traditional error-correction (and even error-detection) is impossible; for example, when the attacker can completely overwrite the encoded message. NMCs have emerged as a fundamental object at the intersection of coding theory and cryptography. In particular, progress in the study of non-malleable codes and the related notion of non-malleable extractors has led to new insights and progress on even more fundamental problems like the construction of multi-source randomness extractors. A large body of the recent work has focused on various constructions of non-malleable codes in the split-state model. Many variants of NMCs have been introduced in the literature, e.g., strong NMCs, super strong NMCs and continuous NMCs. The most general, and hence also the most useful notion among these is that of continuous non-malleable codes, that allows for continuous tampering by the adversary. We present the first efficient information-theoretically secure continuously non-malleable code in the constant split-state model. We believe that our main technical result could be of independent interest and some of the ideas could in future be used to make progress on other related questions. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/978-3-030-17653-2_18 | ADVANCES IN CRYPTOLOGY - EUROCRYPT 2019, PT I |
Field | DocType | Volume |
Message integrity,Computer science,Cryptography,Theoretical computer science,State model,Coding theory,Adversary,Randomness | Conference | 11476 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Divesh Aggarwal | 1 | 186 | 17.99 |
| Nico Döttling | 2 | 8 | 3.18 |
| Jesper Buus Nielsen | 3 | 2287 | 108.94 |
| Maciej Obremski | 4 | 104 | 7.50 |
| Erick Purwanto | 5 | 4 | 1.05 |