Key agreement from weak bit agreement

DOI10.1145/1060590.1060689zbMath1192.94099MaRDI QIDQ3581457

Thomas Holenstein

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

Mathematics Subject Classification ID

94A60: Cryptography

68M12: Network protocols

Related Items

Basing Weak Public-Key Cryptography on Strong One-Way Functions, Degradation and Amplification of Computational Hardness, Unnamed Item, 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, A counterexample to the chain rule for conditional HILL entropy, Complexity of hard-core set proofs, Improved direct product theorems for randomized query complexity, Chernoff-type direct product theorems, Amplifying the security of functional encryption, unconditionally, Nonuniform Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs and Applications to Pseudoentropy, Computational Randomness from Generalized Hardcore Sets, Simultaneous Secrecy and Reliability Amplification for a General Channel Model, On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets, A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch