Imagen de Portada

Improved Round-by-round Soundness IOPs via Reed-Muller Codes

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Minzer, Dor, Zheng, Kai Zhe
Formato:	Preprint
Publicado:	2025
Materias:	Computational Complexity Cryptography and Security
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Near Optimal Alphabet-Soundness Tradeoff PCPs
por: Minzer, Dor, et al.
Publicado: (2024)

Near Optimal Hardness of Approximating $k$-CSP
por: Minzer, Dor, et al.
Publicado: (2025)

How to Verify Any (Reasonable) Distribution Property: Computationally Sound Argument Systems for Distributions
por: Herman, Tal, et al.
Publicado: (2024)

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

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

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

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

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

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

Projective Systematic Authentication via Reed-Muller Codes
por: Liu, Hsuan-Po, et al.
Publicado: (2024)

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

The Lens of Abelian Embeddings
por: Minzer, Dor
Publicado: (2026)

On Lattices, Learning with Errors, Random Linear Codes, and Cryptography
por: Regev, Oded
Publicado: (2024)

3-Query RLDCs are Strictly Stronger than 3-Query LDCs
por: Gur, Tom, et al.
Publicado: (2025)

Quasi-Linear Size PCPs with Small Soundness from HDX
por: Bafna, Mitali, et al.
Publicado: (2024)

Characterizing Direct Product Testing via Coboundary Expansion
por: Bafna, Mitali, et al.
Publicado: (2023)

A Distance Amplification Lemma for Monotonicity
por: Minzer, Dor
Publicado: (2025)

Improved Quantum Lifting by Coherent Measure-and-Reprogram
por: Cojocaru, Alexandru, et al.
Publicado: (2025)

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

Efficient derandomization of differentially private counting queries
por: Ghentiyala, Surendra
Publicado: (2025)

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

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

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

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

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

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

Efficiently Batching Unambiguous Interactive Proofs
por: Berger, Bonnie, et al.
Publicado: (2025)

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

New constructions of pseudorandom codes
por: Ghentiyala, Surendra, et al.
Publicado: (2024)

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

Hardness Amplification for (Sparse) LPN
por: Aggarwal, Divesh, et al.
Publicado: (2026)

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

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

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

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

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

Faster Mixing of Higher-Dimensional Random Reversible Circuits
por: Gay, William, et al.
Publicado: (2024)

A Zero-Knowledge PCP Theorem
por: Gur, Tom, et al.
Publicado: (2024)

Constant Degree Networks for Almost-Everywhere Reliable Transmission
por: Bafna, Mitali, et al.
Publicado: (2024)

Constant Degree Direct Product Testers with Small Soundness
por: Bafna, Mitali, et al.
Publicado: (2024)