Nonuniform indistinguishability and unpredictability hardcore lemmas: new proofs and applications to pseudoentropy

DOI10.1007/978-3-319-17470-9_8MaRDI QIDQ2947526zbMATH OpenOpenAlexFDO

Authors Maciej Skórski

Publication date 24 September 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-17470-9_8

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Measures of information, entropy (94A17)

Recommendations

• A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch
• Computational Randomness from Generalized Hardcore Sets
• Complexity of hard-core set proofs
• On the Complexity of Hard-Core Set Constructions
• Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility

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 Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
• Amplification of Chosen-Ciphertext Security
• Boosting and hard-core set construction
• Characterizing pseudoentropy and simplifying pseudorandom generator constructions
• Computational analogues of entropy
• scientific article; zbMATH DE number 1306886 (Why is no real title available?)
• Key agreement from weak bit agreement
• On the Complexity of Hard-Core Set Constructions
• On Yao's XOR-lemma
• Rates of convex approximation in non-Hilbert spaces
• The uniform hardcore lemma via approximate Bregman projections

Cited in

(5)

• Unifying computational entropies via Kullback-Leibler divergence
• A uniform min-max theorem with applications in cryptography
• Three XOR-lemmas -- an exposition
• Complexity of hard-core set proofs
• Non-uniform attacks against pseudoentropy

This page was built for publication: Nonuniform indistinguishability and unpredictability hardcore lemmas: new proofs and applications to pseudoentropy

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