Cover Image

Hardness of Range Avoidance and Proof Complexity Generators from Demi-Bits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ren, Hanlin, Wang, Yichuan, Zhong, Yan
Format:	Preprint
Published:	2025
Subjects:	Computational Complexity Cryptography and Security
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

A Survey on the Applications of Zero-Knowledge Proofs
by: Lavin, Ryan, et al.
Published: (2024)

The Round Complexity of Proofs in the Bounded Quantum Storage Model
by: Grilo, Alex B., et al.
Published: (2024)

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

NP-Completeness and Physical Zero-Knowledge Proofs for Zeiger
by: Ruangwises, Suthee
Published: (2024)

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

NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam
by: Otsuji, Taisei, et al.
Published: (2026)

Generalized and Unified Equivalences between Hardness and Pseudoentropy
by: Hu, Lunjia, 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)

Proofs of quantum memory
by: Hhan, Minki, et al.
Published: (2025)

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)

Inapproximability of Finding Sparse Vectors in Codes, Subspaces, and Lattices
by: Bhattiprolu, Vijay, et al.
Published: (2024)

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

Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle
by: Li, Xingjian, et al.
Published: (2023)

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)

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

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

More Efficient $k$-wise Independent Permutations from Random Reversible Circuits via log-Sobolev Inequalities
by: Gretta, Lucas, et al.
Published: (2024)

Quantum Pseudorandomness and Classical Complexity
by: Kretschmer, William
Published: (2021)

Unitary Complexity and the Uhlmann Transformation Problem
by: Bostanci, John, et al.
Published: (2023)

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

A Meta-Complexity Characterization of Quantum Cryptography
by: Cavalar, Bruno P., et al.
Published: (2024)

NISQ Security and Complexity via Simple Classical Reasoning
by: Cojocaru, Alexandru, et al.
Published: (2025)

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)

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

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

New constructions of pseudorandom codes
by: Ghentiyala, Surendra, et al.
Published: (2024)

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

Vulnerability Abundance: A formal proof of infinite vulnerabilities in code
by: Leverett, Eireann, et al.
Published: (2026)

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