Non-malleable codes from average-case hardness: AC^0, decision trees, and streaming space-bounded tampering
From MaRDI portal
Publication:1653115
Recommendations
Cited in
(19)- Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
- Proofs of Work from worst-case assumptions
- Non-malleable codes for bounded parallel-time tampering
- Interactive non-malleable codes
- Non-malleable codes for decision trees
- Continuous space-bounded non-malleable codes from stronger proofs-of-space
- Non-malleable encryption: simpler, shorter, stronger
- Continuously non-malleable codes in the split-state model
- Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
- Non-malleable codes against bounded polynomial time tampering
- Non-malleable codes for bounded depth, bounded fan-in circuits
- Continuously non-malleable codes with split-state refresh
- Four-state non-malleable codes with explicit constant rate
- (Nondeterministic) hardness vs. non-malleability
- Continuously non-malleable codes against bounded-depth tampering
- (Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates
- 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 from average-case hardness: \({\mathsf{A}}{\mathsf{C}}^0\), decision trees, and streaming space-bounded tampering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1653115)
