Nonuniform indistinguishability and unpredictability hardcore lemmas: new proofs and applications to pseudoentropy
DOI10.1007/978-3-319-17470-9_8zbMATH Open1343.94027OpenAlexW2143415664MaRDI QIDQ2947526FDOQ2947526
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
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
Random number generation in numerical analysis (65C10) Measures of information, entropy (94A17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- A Pseudorandom Generator from any One-way Function
- Computational analogues of entropy
- Rates of convex approximation in non-Hilbert spaces
- A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
- Key agreement from weak bit agreement
- Title not available (Why is that?)
- Characterizing pseudoentropy and simplifying pseudorandom generator constructions
- On Yao's XOR-lemma
- Boosting and hard-core set construction
- Title not available (Why is that?)
- On the Complexity of Hard-Core Set Constructions
- A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch
- Amplification of Chosen-Ciphertext Security
Cited In (5)
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)
