Non-malleable Codes for Bounded Parallel-Time Tampering
Dana Dachman-Soled, Ilan Komargodski, Rafael Pass
2021年份
11被引次数
2顶会引用
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper，每个回答都会注明依据哪几篇。
引用它的顶会 Paper2
- (Nondeterministic) Hardness vs. Non-malleabilityMarshall Ball, Dana Dachman-Soled, Julian LossCRYPTO 2022 · 被引用 7 次
- Error Correcting Codes that Achieve BSC Capacity Against Channels that are Poly-Size CircuitsRonen Shaltiel, Jad SilbakFOCS 2022 · 被引用 7 次
相关 Paper
- Non-malleable Codes with Optimal Rate for Poly-Size CircuitsMarshall Ball, Ronen Shaltiel, Jad SilbakEUROCRYPT 2024 · 被引用 4 次
- Non-malleability Against Polynomial TamperingMarshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin 等CRYPTO 2020 · 被引用 9 次
- A constant rate non-malleable code in the split-state modelDivesh Aggarwal, Maciej ObremskiFOCS 2020 · 被引用 25 次
- Adaptively Secure Computation for RAM ProgramsLaasya Bangalore, Rafail Ostrovsky, Oxana Poburinnaya, Muthuramakrishnan VenkitasubramaniamEUROCRYPT 2022
- Rate one-third non-malleable codesDivesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski 等STOC 2022 · 被引用 14 次
