Pages that link to "Item:Q5415518"

The following pages link to Characterizing pseudoentropy and simplifying pseudorandom generator constructions (Q5415518):

Displaying 18 items.

• A counterexample to the chain rule for conditional HILL entropy (Q332268) (← links)
• On linear-size pseudorandom generators and hardcore functions (Q744085) (← links)
• Computational fuzzy extractors (Q2216116) (← links)
• Security levels in steganography -- insecurity does not imply detectability (Q2401760) (← links)
• Pseudorandom generators from regular one-way functions: new constructions with improved parameters (Q2513673) (← links)
• On the complexity of constructing pseudorandom functions (especially when they don't exist) (Q2516523) (← links)
• On derandomizing Yao's weak-to-strong OWF construction (Q2697871) (← links)
• Simple constructions from (almost) regular one-way functions (Q2697872) (← links)
• Rate-1, Linear Time and Additively Homomorphic UC Commitments (Q2829947) (← links)
• Metric Pseudoentropy: Characterizations, Transformations and Applications (Q2947525) (← links)
• Nonuniform Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs and Applications to Pseudoentropy (Q2947526) (← links)
• Modulus Computational Entropy (Q2948262) (← links)
• On the Complexity of Breaking Pseudoentropy (Q2988853) (← links)
• Pseudoentropy: Lower-Bounds for Chain Rules and Transformations (Q3179357) (← links)
• Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
• The Many Entropies in One-Way Functions (Q5021132) (← links)
• (Q5121911) (← links)
• Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols (Q5138779) (← links)