Nonuniform Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs and Applications to Pseudoentropy

DOI10.1007/978-3-319-17470-9_8zbMath1343.94027OpenAlexW2143415664MaRDI QIDQ2947526

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Rates of convex approximation in non-Hilbert spaces
• Boosting and hard-core set construction
• A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
• On Yao’s XOR-Lemma
• A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch
• Key agreement from weak bit agreement
• A Pseudorandom Generator from any One-way Function
• Amplification of Chosen-Ciphertext Security
• Characterizing pseudoentropy and simplifying pseudorandom generator constructions
• On the Complexity of Hard-Core Set Constructions
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques