Pages that link to "Item:Q1653115"
From MaRDI portal
The following pages link to Non-malleable codes from average-case hardness: \({\mathsf{A}}{\mathsf{C}}^0\), decision trees, and streaming space-bounded tampering (Q1653115):
Displaying 16 items.
- Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments (Q1631329) (← links)
- Proofs of Work from worst-case assumptions (Q1673424) (← links)
- Non-malleable codes for bounded parallel-time tampering (Q2129009) (← links)
- Interactive non-malleable codes (Q2175939) (← links)
- Non-malleable codes for decision trees (Q2181859) (← links)
- Continuous space-bounded non-malleable codes from stronger proofs-of-space (Q2181862) (← links)
- Non-malleable encryption: simpler, shorter, stronger (Q2210445) (← links)
- Continuously non-malleable codes in the split-state model (Q2210446) (← links)
- Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes (Q2272981) (← links)
- Continuously non-malleable codes with split-state refresh (Q5915916) (← links)
- Four-state non-malleable codes with explicit constant rate (Q5918866) (← links)
- (Nondeterministic) hardness vs. non-malleability (Q6097260) (← links)
- Continuously non-malleable codes against bounded-depth tampering (Q6175984) (← links)
- (Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates (Q6489333) (← links)
- Non-malleable fuzzy extractors (Q6547975) (← links)
- Non-malleable codes with optimal rate for poly-size circuits (Q6637518) (← links)