Cover Image

Generalized and Unified Equivalences between Hardness and Pseudoentropy

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hu, Lunjia, Vadhan, Salil
Format:	Preprint
Published:	2025
Subjects:	Computational Complexity Cryptography and Security Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Unifying computational entropies via Kullback-Leibler divergence
by: Agrawal, Rohit, et al.
Published: (2019)

Characterizing the Distinguishability of Product Distributions through Multicalibration
by: Marcussen, Cassandra, et al.
Published: (2024)

Membership Inference Attacks and Privacy in Topic Modeling
by: Manzonelli, Nico, et al.
Published: (2024)

Cryptographic Hardness of Score Estimation
by: Song, Min Jae
Published: (2024)

Differentially Private Release and Learning of Threshold Functions
by: Bun, Mark, et al.
Published: (2015)

Oblivious Defense in ML Models: Backdoor Removal without Detection
by: Goldwasser, Shafi, et al.
Published: (2024)

Hardness of Range Avoidance and Proof Complexity Generators from Demi-Bits
by: Ren, Hanlin, et al.
Published: (2025)

Hardness Amplification for (Sparse) LPN
by: Aggarwal, Divesh, et al.
Published: (2026)

Optimally Blending Honeypots into Production Networks: Hardness and Algorithms
by: Zaman, Md Mahabub Uz, et al.
Published: (2024)

On the Classical Hardness of the Semidirect Discrete Logarithm Problem in Finite Groups
by: Arif, Mohammad Ferry Husnil, et al.
Published: (2025)

Deterministic Hardness of Approximation of Unique-SVP and GapSVP in $\ell_p$ norms for $p>2$
by: Hecht, Yahli, et al.
Published: (2025)

Efficient and Near-Optimal Noise Generation for Streaming Differential Privacy
by: Dvijotham, Krishnamurthy, et al.
Published: (2024)

Second-Order Min-Max Optimization with Lazy Hessians
by: Chen, Lesi, et al.
Published: (2024)

Noise-tolerant learnability of shallow quantum circuits from statistics and the cost of quantum pseudorandomness
by: Wadhwa, Chirag, et al.
Published: (2024)

Securing Unbounded Differential Privacy Against Timing Attacks
by: Ratliff, Zachary, et al.
Published: (2025)

A Framework for Differential Privacy Against Timing Attacks
by: Ratliff, Zachary, et al.
Published: (2024)

Analyzing the Differentially Private Theil-Sen Estimator for Simple Linear Regression
by: Sarathy, Jayshree, et al.
Published: (2022)

On the Computational Hardness of Quantum One-Wayness
by: Cavalar, Bruno, et al.
Published: (2023)

Quantum Cryptography and Hardness of Non-Collapsing Measurements
by: Morimae, Tomoyuki, et al.
Published: (2025)

Hardness of Quantum Distribution Learning and Quantum Cryptography
by: Hiroka, Taiga, et al.
Published: (2025)

Privately Estimating Black-Box Statistics
by: Steinke, Günter F., et al.
Published: (2025)

Exploration is Harder than Prediction: Cryptographically Separating Reinforcement Learning from Supervised Learning
by: Golowich, Noah, et al.
Published: (2024)

InstaHide's Sample Complexity When Mixing Two Private Images
by: Huang, Baihe, et al.
Published: (2020)

Quantum Automating $\mathbf{TC}^0$-Frege Is LWE-Hard
by: Arteche, Noel, et al.
Published: (2024)

Practitioners' Perspectives on a Differential Privacy Deployment Registry
by: Nanayakkara, Priyanka, et al.
Published: (2025)

From Worst-Case Hardness of $\mathsf{NP}$ to Quantum Cryptography via Quantum Indistinguishability Obfuscation
by: Morimae, Tomoyuki, et al.
Published: (2025)

Mind the Gap? Not for SVP Hardness under ETH!
by: Aggarwal, Divesh, et al.
Published: (2025)

GETA: Generalized Encrypted Traffic Analysis
by: Gunasekara, Ransika, et al.
Published: (2026)

Improved Hardness of BDD and SVP Under Gap-(S)ETH
by: Bennett, Huck, et al.
Published: (2021)

Leakage-Resilient Extractors against Number-on-Forehead Protocols
by: Chattopadhyay, Eshan, et al.
Published: (2025)

Efficient derandomization of differentially private counting queries
by: Ghentiyala, Surendra
Published: (2025)

Differentially Private Compression and the Sensitivity of LZ77
by: Blocki, Jeremiah, et al.
Published: (2025)

Privacy-Preserving Hamming Distance Computation with Property-Preserving Hashing
by: Zhao, Dongfang
Published: (2025)

Lattice Based Crypto breaks in a Superposition of Spacetimes
by: Aggarwal, Divesh, et al.
Published: (2025)

Privacy-preserving formal concept analysis: A homomorphic encryption-based concept construction
by: Chen, Qiangqiang, et al.
Published: (2025)

Efficiently Batching Unambiguous Interactive Proofs
by: Berger, Bonnie, et al.
Published: (2025)

Improved Round-by-round Soundness IOPs via Reed-Muller Codes
by: Minzer, Dor, et al.
Published: (2025)

Black-Box Crypto is Useless for Pseudorandom Codes
by: Garg, Sanjam, et al.
Published: (2025)

Efficient and Privacy-Preserving Binary Dot Product via Multi-Party Computation
by: Dehkordi, Fatemeh Jafarian, et al.
Published: (2025)

Interactive Oracle Proofs of Proximity to Codes on Graphs
by: Delavenne, Hugo, et al.
Published: (2025)