Image de couverture de livre

Nearly-Linear Time Seeded Extractors with Short Seeds

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Doron, Dean, Ribeiro, João
Format:	Preprint
Publié:	2024
Sujets:	Computational Complexity Cryptography and Security Information Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Leakage-Resilient Extractors against Number-on-Forehead Protocols
par: Chattopadhyay, Eshan, et autres
Publié: (2025)

Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations
par: Bangachev, Kiril, et autres
Publié: (2024)

Secret Sharing on Superconcentrator
par: Li, Yuan
Publié: (2023)

Generalized one-way function and its application
par: Yin, Hua-Lei
Publié: (2024)

Computational relative entropy
par: Meyer, Johannes Jakob, et autres
Publié: (2025)

The computational two-way quantum capacity
par: Meyer, Johannes Jakob, et autres
Publié: (2026)

Random Reed-Solomon Codes are List Recoverable with Optimal List Size
par: Doron, Dean, et autres
Publié: (2024)

Quantum interactive proofs using quantum energy teleportation
par: Ikeda, Kazuki, et autres
Publié: (2023)

When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound?
par: Doron, Dean, et autres
Publié: (2024)

Lossy Cryptography from Code-Based Assumptions
par: Dao, Quang, et autres
Publié: (2024)

Linear Hashing with $\ell_\infty$ guarantees and two-sided Kakeya bounds
par: Dhar, Manik, et autres
Publié: (2022)

Average-Case Reductions for $k$-XOR and Tensor PCA
par: Bresler, Guy, et autres
Publié: (2026)

Pessimism of the Will, Optimism of the Intellect: Fair Protocols with Malicious but Rational Agents
par: Brice, Léonard, et autres
Publié: (2024)

Safety Analysis in the NGAC Model
par: Tan, Brian, et autres
Publié: (2025)

On Lattices, Learning with Errors, Random Linear Codes, and Cryptography
par: Regev, Oded
Publié: (2024)

Cryptographic Hardness of Score Estimation
par: Song, Min Jae
Publié: (2024)

Inapproximability of Finding Sparse Vectors in Codes, Subspaces, and Lattices
par: Bhattiprolu, Vijay, et autres
Publié: (2024)

New constructions of pseudorandom codes
par: Ghentiyala, Surendra, et autres
Publié: (2024)

Characterizing the Distinguishability of Product Distributions through Multicalibration
par: Marcussen, Cassandra, et autres
Publié: (2024)

A Survey on the Applications of Zero-Knowledge Proofs
par: Lavin, Ryan, et autres
Publié: (2024)

How to Verify Any (Reasonable) Distribution Property: Computationally Sound Argument Systems for Distributions
par: Herman, Tal, et autres
Publié: (2024)

More Efficient $k$-wise Independent Permutations from Random Reversible Circuits via log-Sobolev Inequalities
par: Gretta, Lucas, et autres
Publié: (2024)

NP-Completeness and Physical Zero-Knowledge Proofs for Zeiger
par: Ruangwises, Suthee
Publié: (2024)

Optimally Blending Honeypots into Production Networks: Hardness and Algorithms
par: Zaman, Md Mahabub Uz, et autres
Publié: (2024)

Faster Mixing of Higher-Dimensional Random Reversible Circuits
par: Gay, William, et autres
Publié: (2024)

A Zero-Knowledge PCP Theorem
par: Gur, Tom, et autres
Publié: (2024)

Efficient derandomization of differentially private counting queries
par: Ghentiyala, Surendra
Publié: (2025)

Hardness Amplification for (Sparse) LPN
par: Aggarwal, Divesh, et autres
Publié: (2026)

Hardness of Range Avoidance and Proof Complexity Generators from Demi-Bits
par: Ren, Hanlin, et autres
Publié: (2025)

Differentially Private Compression and the Sensitivity of LZ77
par: Blocki, Jeremiah, et autres
Publié: (2025)

Deterministic Hardness of Approximation of Unique-SVP and GapSVP in $\ell_p$ norms for $p>2$
par: Hecht, Yahli, et autres
Publié: (2025)

Privacy-Preserving Hamming Distance Computation with Property-Preserving Hashing
par: Zhao, Dongfang
Publié: (2025)

Vulnerability Abundance: A formal proof of infinite vulnerabilities in code
par: Leverett, Eireann, et autres
Publié: (2026)

Unifying computational entropies via Kullback-Leibler divergence
par: Agrawal, Rohit, et autres
Publié: (2019)

Lattice Based Crypto breaks in a Superposition of Spacetimes
par: Aggarwal, Divesh, et autres
Publié: (2025)

Privacy-preserving formal concept analysis: A homomorphic encryption-based concept construction
par: Chen, Qiangqiang, et autres
Publié: (2025)

Efficiently Batching Unambiguous Interactive Proofs
par: Berger, Bonnie, et autres
Publié: (2025)

On the Classical Hardness of the Semidirect Discrete Logarithm Problem in Finite Groups
par: Arif, Mohammad Ferry Husnil, et autres
Publié: (2025)

NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam
par: Otsuji, Taisei, et autres
Publié: (2026)

Improved Round-by-round Soundness IOPs via Reed-Muller Codes
par: Minzer, Dor, et autres
Publié: (2025)