Pages that link to "Item:Q2941538"
From MaRDI portal
The following pages link to Non-malleable Reductions and Applications (Q2941538):
Displayed 25 items.
- Bounded tamper resilience: how to go beyond the algebraic barrier (Q514469) (← links)
- Non-malleable coding against bit-wise and split-state tampering (Q514470) (← links)
- Non-malleability against polynomial tampering (Q2102059) (← links)
- Non-malleable secret sharing against bounded joint-tampering attacks in the plain model (Q2102060) (← links)
- Non-malleable codes for bounded parallel-time tampering (Q2129009) (← links)
- Adaptive extractors and their application to leakage resilient secret sharing (Q2129011) (← links)
- Continuously non-malleable secret sharing for general access structures (Q2175937) (← links)
- Interactive non-malleable codes (Q2175939) (← links)
- Privacy amplification from non-malleable codes (Q2179398) (← links)
- Strong continuous non-malleable encoding schemes with tamper-detection (Q2195381) (← 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)
- Locally decodable and updatable non-malleable codes and their applications (Q2303459) (← links)
- Information-Theoretic Local Non-malleable Codes and Their Applications (Q2799102) (← links)
- Optimal Computational Split-state Non-malleable Codes (Q2799103) (← links)
- (Q5091780) (← links)
- Nonmalleable Extractors and Codes, with Their Many Tampered Extensions (Q5129235) (← links)
- Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes (Q5738792) (← 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)
- Extractors: low entropy requirements colliding with non-malleability (Q6145926) (← links)
- Explicit non-malleable codes from bipartite graphs (Q6169015) (← links)
- Practical non-malleable codes from symmetric-key primitives in 2-split-state model (Q6173122) (← links)