Non-malleable Codes for Bounded Parallel-Time Tampering
Dana Dachman-Soled, Ilan Komargodski, Rafael Pass
2021Year
11Citations
2Top-tier citations
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 97b7fb45-4aee-492e-bbc1-02afba137ff7Cited by top-tier papers2
- (Nondeterministic) Hardness vs. Non-malleabilityMarshall Ball, Dana Dachman-Soled, Julian LossCRYPTO 2022 · 7 citations
- Error Correcting Codes that Achieve BSC Capacity Against Channels that are Poly-Size CircuitsRonen Shaltiel, Jad SilbakFOCS 2022 · 7 citations
Related papers
- Non-malleable Codes with Optimal Rate for Poly-Size CircuitsMarshall Ball, Ronen Shaltiel, Jad SilbakEUROCRYPT 2024 · 4 citations
- Non-malleability Against Polynomial TamperingMarshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin et al.CRYPTO 2020 · 9 citations
- A constant rate non-malleable code in the split-state modelDivesh Aggarwal, Maciej ObremskiFOCS 2020 · 25 citations
- 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 et al.STOC 2022 · 14 citations
