scientific article; zbMATH DE number 7286918
From MaRDI portal
Publication:5140842
DOI10.4086/toc.2020.v016a008zbMath1458.94177arXiv2105.01459OpenAlexW3120339190MaRDI QIDQ5140842
Omer Reingold, Hoeteck Wee, Iftach Haitner, Thomas Holenstein, Salil P. Vadhan
Publication date: 17 December 2020
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.01459
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- On the theory of average case complexity
- Average case complexity under the universal distribution equals worst- case complexity
- Randomness is linear in space
- Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions
- UOWHFs from OWFs: Trading Regularity for Efficiency
- (Almost) Optimal Constructions of UOWHFs from 1-to-1, Regular One-Way Functions and Beyond
- Universal One-Way Hash Functions via Inaccessible Entropy
- Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
- Amplifying Collision Resistance: A Complexity-Theoretic Treatment
- Average Case Complete Problems
- A Pseudorandom Generator from any One-way Function
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- The Journey from NP to TFNP Hardness
- The Many Entropies in One-Way Functions
- Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali
- On the Randomness of Independent Experiments
- Elements of Information Theory
This page was built for publication:
