The Many Entropies in One-Way Functions

DOI10.1007/978-3-319-57048-8_4zbMath1482.94034OpenAlexW2893458286MaRDI QIDQ5021132

Iftach Haitner, Salil P. Vadhan

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

zbMATH Keywords

pseudorandom generatorone-way functionShannon entropyhash functioncommitment schemesecurity parameter

Mathematics Subject Classification ID

Cryptography (94A60) Measures of information, entropy (94A17)

Related Items (1)

Unnamed Item

Cites Work

• Probabilistic encryption
• New hash functions and their use in authentication and set equality
• Universal classes of hash functions
• Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions
• On the Power of the Randomized Iterate
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Universal One-Way Hash Functions via Inaccessible Entropy
• Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
• Communication Theory of Secrecy Systems*
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
• A Pseudorandom Generator from any One-way Function
• On the Existence of Pseudorandom Generators
• Inaccessible entropy
• Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
• Characterizing pseudoentropy and simplifying pseudorandom generator constructions
• Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
• Theory of Cryptography
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• Theory of Cryptography

This page was built for publication: The Many Entropies in One-Way Functions