Pages that link to "Item:Q4637777"
From MaRDI portal
The following pages link to Non-Malleable Codes from Additive Combinatorics (Q4637777):
Displayed 9 items.
- Non-malleability against polynomial tampering (Q2102059) (← links)
- Non-malleable codes for bounded parallel-time tampering (Q2129009) (← links)
- Continuously non-malleable codes in the split-state model (Q2210446) (← links)
- The Chaining Lemma and Its Application (Q2947530) (← links)
- A generalization of a theorem of Rothschild and van Lint (Q5918630) (← links)
- A generalization of a theorem of Rothschild and van Lint (Q5925692) (← links)
- (Nondeterministic) hardness vs. non-malleability (Q6097260) (← links)
- Extractors: low entropy requirements colliding with non-malleability (Q6145926) (← links)
- Explicit non-malleable codes from bipartite graphs (Q6169015) (← links)