Pages that link to "Item:Q2891501"
From MaRDI portal
The following pages link to Counterexamples to Hardness Amplification beyond Negligible (Q2891501):
Displaying 9 items.
- One-message zero knowledge and non-malleable commitments (Q1629409) (← links)
- Incompressible encodings (Q2096497) (← links)
- A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence (Q2102080) (← links)
- A compressed \(\varSigma \)-protocol theory for lattices (Q2128575) (← links)
- Direct product hardness amplification (Q2697877) (← links)
- Hardness Amplification Proofs Require Majority (Q5390590) (← links)
- Using Nondeterminism to Amplify Hardness (Q5470719) (← links)
- A tight computational indistinguishability bound for product distributions (Q6114275) (← links)
- Post-quantum insecurity from LWE (Q6169346) (← links)