Image de couverture de livre

Data Structures Meet Cryptography: 3SUM with Preprocessing

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Golovnev, Alexander, Guo, Siyao, Horel, Thibaut, Park, Sunoo, Vaikuntanathan, Vinod
Format:	Preprint
Publié:	2019
Sujets:	Data Structures and Algorithms Cryptography and Security
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Improving Algorithmic Efficiency using Cryptography
par: Vaikuntanathan, Vinod, et autres
Publié: (2025)

Improved Time-Space Tradeoffs for 3SUM-Indexing
par: Dinur, Itai, et autres
Publié: (2025)

Average-Case Complexity of Quantum Stabilizer Decoding
par: Khesin, Andrey Boris, et autres
Publié: (2025)

Private Synthetic Data Generation in Bounded Memory
par: Holland, Rayne, et autres
Publié: (2024)

Fast and Optimal Differentially Private Frequent-Substring Mining
par: Guo, Peaker, et autres
Publié: (2026)

An Efficient and Scalable Auditing Scheme for Cloud Data Storage using an Enhanced B-tree
par: Islam, Tariqul, et autres
Publié: (2024)

Fingerprinting Codes Meet Geometry: Improved Lower Bounds for Private Query Release and Adaptive Data Analysis
par: Lyu, Xin, et autres
Publié: (2024)

Private Hyperparameter Tuning with Ex-Post Guarantee
par: Ghazi, Badih, et autres
Publié: (2025)

3SUM in Preprocessed Universes: Faster and Simpler
par: Kasliwal, Shashwat, et autres
Publié: (2024)

Meeting Utility Constraints in Differential Privacy: A Privacy-Boosting Approach
par: Jiang, Bo, et autres
Publié: (2024)

Preprocessed 3SUM for Unknown Universes with Subquadratic Space
par: Kirkpatrick, Yael, et autres
Publié: (2026)

Statistics-Friendly Confidentiality Protection for Establishment Data, with Applications to the QCEW
par: Webb, Kaitlyn, et autres
Publié: (2025)

It is high time we let go of the Mersenne Twister
par: Vigna, Sebastiano
Publié: (2019)

Improved Differentially Private Algorithms for Rank Aggregation
par: Hillebrand, Quentin, et autres
Publié: (2025)

Almost Instance-optimal Clipping for Summation Problems in the Shuffle Model of Differential Privacy
par: Dong, Wei, et autres
Publié: (2024)

Dynamic Accountable Storage: An Efficient Protocol for Real-time Cloud Storage Auditing
par: Goodrich, Michael T., et autres
Publié: (2024)

Private Lossless Multiple Release
par: Andersson, Joel Daniel, et autres
Publié: (2025)

Space-Efficient Private Estimation of Quantiles
par: Cafaro, Massimo, et autres
Publié: (2025)

Differentially Private Matchings
par: Dinitz, Michael, et autres
Publié: (2025)

Individualized Privacy Accounting via Subsampling with Applications in Combinatorial Optimization
par: Ghazi, Badih, et autres
Publié: (2024)

Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More
par: Chandra, Rishi, et autres
Publié: (2024)

Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding
par: Aggarwal, Divesh, et autres
Publié: (2020)

Adversary Resilient Learned Bloom Filters
par: Almashaqbeh, Ghada, et autres
Publié: (2024)

Differentially Private Space-Efficient Algorithms for Counting Distinct Elements in the Turnstile Model
par: Cummings, Rachel, et autres
Publié: (2025)

On Learning Parities with Dependent Noise
par: Golowich, Noah, et autres
Publié: (2024)

Differentially Private Substring and Document Counting with Near-Optimal Error
par: Bernardini, Giulia, et autres
Publié: (2024)

Local Node Differential Privacy
par: Raskhodnikova, Sofya, et autres
Publié: (2026)

On Wagner's k-Tree Algorithm Over Integers
par: Lin, Haoxing, et autres
Publié: (2024)

Differentially Private Set Representations
par: Patel, Sarvar, et autres
Publié: (2025)

Scalable Private Partition Selection via Adaptive Weighting
par: Chen, Justin Y., et autres
Publié: (2025)

Fine-Grained Privacy Guarantees for Coverage Problems
par: Dhulipala, Laxman, et autres
Publié: (2024)

Near-Universally-Optimal Differentially Private Minimum Spanning Trees
par: Hladík, Richard, et autres
Publié: (2024)

The Price of Privacy For Approximating Max-CSP
par: Dharangutte, Prathamesh, et autres
Publié: (2026)

Sublinear Space Graph Algorithms in the Continual Release Model
par: Epasto, Alessandro, et autres
Publié: (2024)

Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism
par: Dhulipala, Laxman, et autres
Publié: (2025)

Improved Lower Bound for Differentially Private Facility Location
par: Manurangsi, Pasin
Publié: (2024)

Profile Reconstruction from Private Sketches
par: Wu, Hao, et autres
Publié: (2024)

Continual Counting with Gradual Privacy Expiration
par: Andersson, Joel Daniel, et autres
Publié: (2024)

Count on Your Elders: Laplace vs Gaussian Noise
par: Andersson, Joel Daniel, et autres
Publié: (2024)

Hardening Confidential Federated Compute against Side-channel Attacks
par: Bell-Clark, James, et autres
Publié: (2026)