Non-malleable codes and extractors for small-depth circuits, and affine functions
From MaRDI portal
Publication:4978056
DOI10.1145/3055399.3055483zbMath1370.68083OpenAlexW2626798791MaRDI QIDQ4978056
Publication date: 17 August 2017
Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3055399.3055483
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (13)
Non-malleable codes for bounded parallel-time tampering ⋮ Interactive non-malleable codes ⋮ (Nondeterministic) hardness vs. non-malleability ⋮ Unnamed Item ⋮ Non-malleable encryption: simpler, shorter, stronger ⋮ Continuously non-malleable codes in the split-state model ⋮ Nonmalleable Extractors and Codes, with Their Many Tampered Extensions ⋮ Unnamed Item ⋮ Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes ⋮ Continuously non-malleable codes with split-state refresh ⋮ Unnamed Item ⋮ Four-state non-malleable codes with explicit constant rate ⋮ Non-malleability against polynomial tampering
This page was built for publication: Non-malleable codes and extractors for small-depth circuits, and affine functions
