Pages that link to "Item:Q3581457"
From MaRDI portal
The following pages link to Key agreement from weak bit agreement (Q3581457):
Displayed 18 items.
- A counterexample to the chain rule for conditional HILL entropy (Q332268) (← links)
- Complexity of hard-core set proofs (Q451110) (← links)
- Improved direct product theorems for randomized query complexity (Q693002) (← links)
- Chernoff-type direct product theorems (Q1027975) (← links)
- Amplifying the security of functional encryption, unconditionally (Q2096505) (← links)
- Nonuniform Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs and Applications to Pseudoentropy (Q2947526) (← links)
- Computational Randomness from Generalized Hardcore Sets (Q3088271) (← links)
- Simultaneous Secrecy and Reliability Amplification for a General Channel Model (Q3179359) (← links)
- On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets (Q3297825) (← links)
- A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch (Q3408197) (← links)
- Basing Weak Public-Key Cryptography on Strong One-Way Functions (Q5445498) (← links)
- Degradation and Amplification of Computational Hardness (Q5445529) (← links)
- Beyond the Csiszár-Körner bound: best-possible wiretap coding via obfuscation (Q6070448) (← links)
- (Q6084358) (← links)
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error (Q6089979) (← links)
- On the impossibility of key agreements from quantum random oracles (Q6104333) (← links)
- A tight computational indistinguishability bound for product distributions (Q6114275) (← links)
- Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols (Q6163951) (← links)