Imagen de Portada

Towards EXPTIME One Way Functions: Bloom Filters, Succinct Graphs, Cliques, & Self Masking

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Dolev, Shlomi
Formato:	Preprint
Publicado:	2025
Materias:	Computational Complexity Cryptography and Security Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

The Planted Orthogonal Vectors Problem
por: Kühnemann, David, et al.
Publicado: (2025)

Cell-Probe Lower Bounds via Semi-Random CSP Refutation: Simplified and the Odd-Locality Case
por: Guruswami, Venkatesan, et al.
Publicado: (2025)

Perfect Zero-Knowledge PCPs for #P
por: Gur, Tom, et al.
Publicado: (2024)

On the Maximum Distance Sublattice Problem and Closest Vector Problem
por: Kumar, Rajendra, et al.
Publicado: (2018)

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

Keeping a Secret Requires a Good Memory: Space Lower-Bounds for Private Algorithms
por: Epasto, Alessandro, et al.
Publicado: (2026)

On the instance optimality of detecting collisions and subgraphs
por: Ben-Eliezer, Omri, et al.
Publicado: (2023)

Adversary Resilient Learned Bloom Filters
por: Almashaqbeh, Ghada, et al.
Publicado: (2024)

A Persistent Hierarchical Bloom Filter-based Framework for Authentication and Tracking of ICs
por: Shishir, Fairuz Shadmani, et al.
Publicado: (2024)

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

No exponential quantum speedup for $\mathrm{SIS}^\infty$ anymore
por: Kothari, Robin, et al.
Publicado: (2025)

Average-Case Complexity of Quantum Stabilizer Decoding
por: Khesin, Andrey Boris, et al.
Publicado: (2025)

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

The NISQ Complexity of Collision Finding
por: Hamoudi, Yassine, et al.
Publicado: (2022)

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

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

Differentially Private Release of Israel's National Registry of Live Births
por: Hod, Shlomi, et al.
Publicado: (2024)

Invertible Bloom Lookup Tables with Less Memory and Randomness
por: Fleischhacker, Nils, et al.
Publicado: (2023)

On optimal distinguishers for Planted Clique
por: Nagda, Ansh, et al.
Publicado: (2025)

Cascaded Learned Bloom Filter for Optimal Model-Filter Size Balance and Fast Rejection
por: Sato, Atsuki, et al.
Publicado: (2025)

Privacy Filters are Captured by Residues: A Characterization of Free Natural Filters and the Cost of Adaptivity
por: Regehr, Matthew, et al.
Publicado: (2026)

Self-referential instances of the dominating set problem are irreducible
por: Zhou, Guangyan
Publicado: (2026)

Decentralized Privacy Preservation for Critical Connections in Graphs
por: Li, Conggai, et al.
Publicado: (2024)

Sublinear Space Graph Algorithms in the Continual Release Model
por: Epasto, Alessandro, et al.
Publicado: (2024)

Differentially Private Algorithms for Graphs Under Continual Observation
por: Fichtenberger, Hendrik, et al.
Publicado: (2021)

Fully Dynamic Graph Algorithms with Edge Differential Privacy
por: Raskhodnikova, Sofya, et al.
Publicado: (2024)

Cycle Counting under Local Differential Privacy for Degeneracy-bounded Graphs
por: Hillebrand, Quentin, et al.
Publicado: (2024)

Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More
por: Chandra, Rishi, et al.
Publicado: (2024)

Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism
por: Dhulipala, Laxman, et al.
Publicado: (2025)

Time-Aware Projections: Truly Node-Private Graph Statistics under Continual Observation
por: Jain, Palak, et al.
Publicado: (2024)

Practical and Accurate Local Edge Differentially Private Graph Algorithms
por: Mundra, Pranay, et al.
Publicado: (2025)

Sublinear-Time Approximation for Graph Frequency Vectors in Hyperfinite Graphs
por: Moroie, Gregory
Publicado: (2025)

Finding One Local Optimum Is Easy -- but What About Two?
por: Kobayashi, Yasuaki, et al.
Publicado: (2025)

Improved Differentially Private Algorithms for Rank Aggregation
por: Hillebrand, Quentin, et al.
Publicado: (2025)

Private Lossless Multiple Release
por: Andersson, Joel Daniel, et al.
Publicado: (2025)

Space-Efficient Private Estimation of Quantiles
por: Cafaro, Massimo, et al.
Publicado: (2025)

Differentially Private Matchings
por: Dinitz, Michael, et al.
Publicado: (2025)

Private Hyperparameter Tuning with Ex-Post Guarantee
por: Ghazi, Badih, et al.
Publicado: (2025)

Differentially Private Space-Efficient Algorithms for Counting Distinct Elements in the Turnstile Model
por: Cummings, Rachel, et al.
Publicado: (2025)