Cover Image

Leakage-Resilient Extractors against Number-on-Forehead Protocols

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chattopadhyay, Eshan, Goodman, Jesse
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

Extractors for Polynomial Sources over $\mathbb{F}_2$
by: Chattopadhyay, Eshan, et al.
Published: (2023)

Nearly-Linear Time Seeded Extractors with Short Seeds
by: Doron, Dean, et al.
Published: (2024)

Improved Bounds for Coin Flipping, Leader Election, and Random Selection
by: Chattopadhyay, Eshan, et al.
Published: (2025)

Clifford Strategies in Interactive Protocols are Classically Simulatable
by: Shalit, Itay
Published: (2024)

Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions
by: Kitagawa, Fuyuki, et al.
Published: (2023)

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

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

Differentially Private Compression and the Sensitivity of LZ77
by: Blocki, Jeremiah, 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)

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)

On the Classical Hardness of the Semidirect Discrete Logarithm Problem in Finite Groups
by: Arif, Mohammad Ferry Husnil, 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)

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

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)

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

A Survey on the Applications of Zero-Knowledge Proofs
by: Lavin, Ryan, 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)

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

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

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

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

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

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

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

Pessimism of the Will, Optimism of the Intellect: Fair Protocols with Malicious but Rational Agents
by: Brice, Léonard, et al.
Published: (2024)

Pseudorandom Permutations from Random Reversible Circuits
by: He, William, et al.
Published: (2024)

Linear Hashing with $\ell_\infty$ guarantees and two-sided Kakeya bounds
by: Dhar, Manik, et al.
Published: (2022)

Fine-Grained Cryptanalysis: Tight Conditional Bounds for Dense k-SUM and k-XOR
by: Dinur, Itai, et al.
Published: (2021)

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)

Experimental relativistic zero-knowledge proofs with unconditional security
by: Weng, Chen-Xun, 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)