Pages that link to "Item:Q3581457"

The following pages link to Key agreement from weak bit agreement (Q3581457):

Displaying 13 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)
• 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)