Paper 2017/040
Practical Non-Malleable Codes from $\ell$-more Extractable Hash Functions
Aggelos Kiayias and Feng-Hao Liu and Yiannis Tselekounis
Abstract
In this work, we significantly improve the efficiency of non-malleable codes in the split state model, by constructing a code with codeword length $|s|+O(k)$, where $|s|$ is the length of the message, and $k$ is the security parameter. This is a substantial improvement over previous constructions, both asymptotically and concretely. Our construction relies on a new primitive which we define and study, called $\ell$-more extractable hash functions. This notion, which may be of independent interest, is strictly stronger than the previous notion of extractable hash by Goldwasser et al. (Eprint '11) and Bitansky et al. (ITCS '12, Eprint '14), yet we can instantiate it under the same assumption used for the previous extractable hash function (a variant of the Knowledge of Exponent Assumption).
Metadata
- Available format(s)
- Publication info
- Published elsewhere. Minor revision. ACM Conference on Computer and Communications Security 2016
- Keywords
- Non-malleable codeshash functionssplit-state model
- Contact author(s)
- tselekounis @ sians org
- History
- 2022-12-19: last of 5 revisions
- 2017-01-18: received
- See all versions
- Short URL
- https://ia.cr/2017/040
- License
-
CC BY