The many entropies in one-way functions
From MaRDI portal
Publication:5021132
DOI10.1007/978-3-319-57048-8_4zbMATH Open1482.94034OpenAlexW2893458286MaRDI QIDQ5021132FDOQ5021132
Publication date: 12 January 2022
Published in: Tutorials on the Foundations of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-57048-8_4
Recommendations
Shannon entropyhash functionone-way functioncommitment schemepseudorandom generatorsecurity parameter
Cites Work
- Probabilistic encryption
- New hash functions and their use in authentication and set equality
- Universal classes of hash functions
- Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
- Communication Theory of Secrecy Systems*
- A Pseudorandom Generator from any One-way Function
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- On the Existence of Pseudorandom Generators
- Characterizing pseudoentropy and simplifying pseudorandom generator constructions
- Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
- Theory of Cryptography
- On the Power of the Randomized Iterate
- Theory of Cryptography
- Universal One-Way Hash Functions via Inaccessible Entropy
- Efficiency improvements in constructing pseudorandom generators from one-way functions
- Inaccessible entropy
Cited In (4)
This page was built for publication: The many entropies in one-way functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5021132)
