Non-malleable codes for decision trees
From MaRDI portal
Recommendations
- Towards deterministic tree code constructions
- Codes Over Trees
- Non-malleable codes from average-case hardness: \({\mathsf{A}}{\mathsf{C}}^0\), decision trees, and streaming space-bounded tampering
- On binary tree encodements
- Non-malleable codes
- A coding algorithm for Rényi trees
- A New Coding Algorithm for Trees
- On decoding Cohen-Haeupler-Schulman tree codes
- The coding of binary trees
- Tree approximation and optimal encoding
Cited in
(13)- Non-malleable codes from average-case hardness: \({\mathsf{A}}{\mathsf{C}}^0\), decision trees, and streaming space-bounded tampering
- Non-malleable codes for bounded parallel-time tampering
- Continuously non-malleable secret sharing for general access structures
- Interactive non-malleable codes
- Non-malleable encryption: simpler, shorter, stronger
- Continuously non-malleable codes in the split-state model
- Continuously non-malleable secret sharing: joint tampering, plain model and capacity
- Non-malleable codes for bounded depth, bounded fan-in circuits
- (Nondeterministic) hardness vs. non-malleability
- Continuously non-malleable codes against bounded-depth tampering
- Non-malleable fuzzy extractors
- Non-malleable codes with optimal rate for poly-size circuits
- Split-state non-malleable codes and secret sharing schemes for quantum messages
This page was built for publication: Non-malleable codes for decision trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2181859)
