Non-malleable Codes with Optimal Rate for Poly-Size Circuits
Marshall Ball, Ronen Shaltiel, Jad Silbak
2024Year
4Citations
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 d779312d-1cc4-48ea-bfd9-dc8e97c6d877Cited by top-tier papers2
- Extractors for Samplable Distributions with Low Min-EntropyMarshall Ball, Ronen Shaltiel, Jad SilbakSTOC 2025 · 5 citations
- Extractors for Samplable Distributions with Polynomially Small Min-EntropyRonen ShaltielFOCS 2025 · 1 citation
Related papers
- 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
- Error Correcting Codes that Achieve BSC Capacity Against Channels that are Poly-Size CircuitsRonen Shaltiel, Jad SilbakFOCS 2022 · 7 citations
- Practical Non-Malleable Codes from l-more Extractable Hash FunctionsAggelos Kiayias, Feng-Hao Liu, Yiannis TselekounisCCS 2016 · 40 citations
- Non-malleability Against Polynomial TamperingMarshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin et al.CRYPTO 2020 · 9 citations
