Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes
Lists
Only you see this
Abstract
In a recent result, Dachman-Soled et al. (TCC 2015) proposed a new notion called locally decodable and updatable non-malleable codes, which informally, provides the security guarantees of a non-malleable code while also allowing for efficient random access. They also considered locally decodable and updatable non-malleable codes that are leakage-resilient, allowing for adversaries who continually leak information in addition to tampering. Unfortunately, the locality of their construction in the continual setting was \(\varOmega (\log n)\), meaning that if the original message size was n blocks, then \(\varOmega (\log n)\) blocks of the codeword had to be accessed upon each decode and update instruction.
BibTeX
@inproceedings{dachmansoled2017tight,
author = {Dana Dachman-Soled and Mukul Kulkarni and Aria Shahverdi},
title = {{Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes}},
booktitle = {Public Key Cryptography},
year = {2017},
doi = {10.1007/978-3-662-54365-8\_13},
}Loading related content...