Key agreement from weak bit agreement
From MaRDI portal
Publication:3581457
DOI10.1145/1060590.1060689zbMath1192.94099OpenAlexW2016201895MaRDI QIDQ3581457
Publication date: 16 August 2010
Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1060590.1060689
Related Items (18)
Simultaneous Secrecy and Reliability Amplification for a General Channel Model ⋮ A counterexample to the chain rule for conditional HILL entropy ⋮ Nonuniform Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs and Applications to Pseudoentropy ⋮ Beyond the Csiszár-Körner bound: best-possible wiretap coding via obfuscation ⋮ Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error ⋮ On the impossibility of key agreements from quantum random oracles ⋮ A tight computational indistinguishability bound for product distributions ⋮ Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols ⋮ Unnamed Item ⋮ Complexity of hard-core set proofs ⋮ On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets ⋮ Improved direct product theorems for randomized query complexity ⋮ Basing Weak Public-Key Cryptography on Strong One-Way Functions ⋮ Degradation and Amplification of Computational Hardness ⋮ Computational Randomness from Generalized Hardcore Sets ⋮ Chernoff-type direct product theorems ⋮ A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch ⋮ Amplifying the security of functional encryption, unconditionally
This page was built for publication: Key agreement from weak bit agreement
