Recommendations
Cites work
- A Pseudorandom Generator from any One-way Function
- Characterizing pseudoentropy and simplifying pseudorandom generator constructions
- Communication Theory of Secrecy Systems*
- Computational analogues of entropy
- Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
- Efficiency improvements in constructing pseudorandom generators from one-way functions
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Inaccessible entropy
- New hash functions and their use in authentication and set equality
- On the Existence of Pseudorandom Generators
- On the Power of the Randomized Iterate
- Probabilistic encryption
- Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
- Theory of Cryptography
- Theory of Cryptography
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- Universal classes of hash functions
- Universal one-way hash functions via inaccessible entropy
Cited in
(9)- Symmetry of information and one-way functions
- Unifying computational entropies via Kullback-Leibler divergence
- Universal one-way hash functions via inaccessible entropy
- Adaptive One-Way Functions and Applications
- scientific article; zbMATH DE number 7250163 (Why is no real title available?)
- scientific article; zbMATH DE number 7286918 (Why is no real title available?)
- Comparing Notions of Computational Entropy
- Counting unpredictable bits: a simple PRG from one-way functions
- Comparing notions of computational entropy
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)
