Bit-security preserving hardness amplification

Cites work

A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch
A Pseudorandom Generator from any One-way Function
A uniform min-max theorem with applications in cryptography
Algorithmic Learning Theory
Bit security as computational cost for winning games with high probability
Boosting and hard-core set construction
Boosting. Foundations and algorithms.
Characterizing pseudoentropy and simplifying pseudorandom generator constructions
Computational Indistinguishability Amplification: Tight Product Theorems for System Composition
Direct product hardness amplification
Efficiency improvements in constructing pseudorandom generators from one-way functions
Efficient amplification of the security of weak pseudo-random function generators
Foundations of Cryptography
Higher order concentration for functions of weakly dependent random variables
scientific article; zbMATH DE number 1306886 (Why is no real title available?)
scientific article; zbMATH DE number 708821 (Why is no real title available?)
scientific article; zbMATH DE number 861531 (Why is no real title available?)
Improved boosting algorithms using confidence-rated predictions
Information Theory and Statistics: A Tutorial
Key agreement from weak bit agreement
Majority gates vs. general weighted threshold gates
Nearly one-sided tests and the Goldreich-Levin predicate
On security preserving reductions -- revised terminology
On the bit security of cryptographic primitives
On the impossibility of tight cryptographic reductions
On the security loss of unique signatures
On the tight security of TLS 1.3: theoretically sound cryptographic parameters for real-world deployments
On Yao's XOR-lemma
Rényi Divergence and Kullback-Leibler Divergence
Securing approximate homomorphic encryption using differential privacy
Security Amplification for Interactive Cryptographic Primitives
Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
The uniform hardcore lemma via approximate Bregman projections
Unified view for notions of bit security

This page was built for publication: Bit-security preserving hardness amplification

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