The following pages link to (Q5091780):
Displayed 12 items.
- Lower bounds for matrix factorization (Q2041242) (← links)
- Non-malleability against polynomial tampering (Q2102059) (← links)
- Privacy amplification from non-malleable codes (Q2179398) (← links)
- Explicit two-source extractors and resilient functions (Q2320598) (← links)
- (Q5092448) (← links)
- Nonmalleable Extractors and Codes, with Their Many Tampered Extensions (Q5129235) (← links)
- (Q5226195) (← links)
- Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture (Q6049024) (← links)
- Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
- (Nondeterministic) hardness vs. non-malleability (Q6097260) (← links)
- Extractors: low entropy requirements colliding with non-malleability (Q6145926) (← links)
- Continuously non-malleable codes against bounded-depth tampering (Q6175984) (← links)