Practical Non-Malleable Codes from l-more Extractable Hash Functions
Aggelos Kiayias, Feng-Hao Liu, Yiannis Tselekounis
2016年份
40被引次数
1顶会引用
摘要
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.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
引用它的顶会 Paper1
问问它们各自怎么用它相关 Paper
- Rate one-third non-malleable codesDivesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski 等STOC 2022 · 被引用 14 次
- A constant rate non-malleable code in the split-state modelDivesh Aggarwal, Maciej ObremskiFOCS 2020 · 被引用 25 次
- Non-malleable Codes with Optimal Rate for Poly-Size CircuitsMarshall Ball, Ronen Shaltiel, Jad SilbakEUROCRYPT 2024 · 被引用 4 次
- Non-malleable Codes for Bounded Parallel-Time TamperingDana Dachman-Soled, Ilan Komargodski, Rafael PassCRYPTO 2021 · 被引用 11 次
- (Nondeterministic) Hardness vs. Non-malleabilityMarshall Ball, Dana Dachman-Soled, Julian LossCRYPTO 2022 · 被引用 7 次
