Practical Non-Malleable Codes from l-more Extractable Hash Functions
Aggelos Kiayias, Feng-Hao Liu, Yiannis Tselekounis
2016Year
40Citations
1Top-tier citations
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 (roughly), 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.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get bee4a3f2-1b7d-480f-9e88-db1b1b818bdbCited by top-tier papers1
Ask how each one uses itRelated papers
- Rate one-third non-malleable codesDivesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski et al.STOC 2022 · 14 citations
- A constant rate non-malleable code in the split-state modelDivesh Aggarwal, Maciej ObremskiFOCS 2020 · 25 citations
- Non-malleable Codes with Optimal Rate for Poly-Size CircuitsMarshall Ball, Ronen Shaltiel, Jad SilbakEUROCRYPT 2024 · 4 citations
- Non-malleable Codes for Bounded Parallel-Time TamperingDana Dachman-Soled, Ilan Komargodski, Rafael PassCRYPTO 2021 · 11 citations
- (Nondeterministic) Hardness vs. Non-malleabilityMarshall Ball, Dana Dachman-Soled, Julian LossCRYPTO 2022 · 7 citations
