Key agreement from weak bit agreement

DOI10.1145/1060590.1060689MaRDI QIDQ3581457zbMATH OpenOpenAlexFDO

Authors 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

Network protocols (68M12) Cryptography (94A60)

Cited in

(24)

• 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 counterexample to the chain rule for conditional HILL entropy
• A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch
• Complexity of hard-core set proofs
• Basing Weak Public-Key Cryptography on Strong One-Way Functions
• Degradation and Amplification of Computational Hardness
• Beyond the Csiszár-Körner bound: best-possible wiretap coding via obfuscation
• scientific article; zbMATH DE number 7758317 (Why is no real title available?)
• 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
• Amplification of non-interactive zero knowledge, revisited
• NIZK amplification via leakage-resilient secure computation
• Improved direct product theorems for randomized query complexity
• Bit-security preserving hardness amplification
• Comparing computational entropies below majority (or: when is the dense model theorem false?)
• On basing auxiliary-input cryptography on NP-hardness via nonadaptive black-box reductions
• Generalized and unified equivalences between hardness and pseudoentropy

This page was built for publication: Key agreement from weak bit agreement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581457)