Non-malleable codes for decision trees
From MaRDI portal
Publication:2181859
DOI10.1007/978-3-030-26948-7_15zbMath1452.94132OpenAlexW2947399000MaRDI QIDQ2181859
Daniel Wichs, Siyao Guo, Marshall Ball
Publication date: 20 May 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-26948-7_15
Related Items (8)
Non-malleable codes for bounded parallel-time tampering ⋮ Continuously non-malleable secret sharing for general access structures ⋮ Interactive non-malleable codes ⋮ (Nondeterministic) hardness vs. non-malleability ⋮ Continuously non-malleable codes against bounded-depth tampering ⋮ Continuously non-malleable secret sharing: joint tampering, plain model and capacity ⋮ Non-malleable encryption: simpler, shorter, stronger ⋮ Continuously non-malleable codes in the split-state model
This page was built for publication: Non-malleable codes for decision trees
