Copertina

Optimal Offline ORAM with Perfect Security via Simple Oblivious Priority Queues

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Thießen, Thore, Vahrenhold, Jan
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms Cryptography and Security
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

MVP-ORAM: a Wait-free Concurrent ORAM for Confidential BFT Storage
di: Vassantlal, Robin, et al.
Pubblicazione: (2025)

Separating Oblivious and Adaptive Differential Privacy under Continual Observation
di: Bun, Mark, et al.
Pubblicazione: (2026)

Nearly-Optimal Private Selection via Gaussian Mechanism
di: Leeman, Ethan, et al.
Pubblicazione: (2025)

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

Near-Optimal Generalized Private Testing
di: Chaturvedi, Anamay, et al.
Pubblicazione: (2026)

Fast and Optimal Differentially Private Frequent-Substring Mining
di: Guo, Peaker, et al.
Pubblicazione: (2026)

Differentially Private Substring and Document Counting with Near-Optimal Error
di: Bernardini, Giulia, et al.
Pubblicazione: (2024)

Near-Universally-Optimal Differentially Private Minimum Spanning Trees
di: Hladík, Richard, et al.
Pubblicazione: (2024)

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

Optimal Pure Differentially Private Sparse Histograms in Deterministic Linear Time
di: Kerschbaum, Florian, et al.
Pubblicazione: (2025)

Private Stochastic Convex Optimization with Heavy Tails: Near-Optimality from Simple Reductions
di: Asi, Hilal, et al.
Pubblicazione: (2024)

Infinitely Divisible Noise for Differential Privacy: Nearly Optimal Error in the High $\varepsilon$ Regime
di: Harrison, Charlie, et al.
Pubblicazione: (2025)

Scalable Private Partition Selection via Adaptive Weighting
di: Chen, Justin Y., et al.
Pubblicazione: (2025)

Individualized Privacy Accounting via Subsampling with Applications in Combinatorial Optimization
di: Ghazi, Badih, et al.
Pubblicazione: (2024)

Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding
di: Aggarwal, Divesh, et al.
Pubblicazione: (2020)

Weighted Fourier Factorizations: Optimal Gaussian Noise for Differentially Private Marginal and Product Queries
di: Lebeda, Christian Janos, et al.
Pubblicazione: (2025)

Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation
di: Pagh, Rasmus, et al.
Pubblicazione: (2024)

Almost Instance-optimal Clipping for Summation Problems in the Shuffle Model of Differential Privacy
di: Dong, Wei, et al.
Pubblicazione: (2024)

Dynamic Accountable Storage: An Efficient Protocol for Real-time Cloud Storage Auditing
di: Goodrich, Michael T., et al.
Pubblicazione: (2024)

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

Adversary Resilient Learned Bloom Filters
di: Almashaqbeh, Ghada, et al.
Pubblicazione: (2024)

On Learning Parities with Dependent Noise
di: Golowich, Noah, et al.
Pubblicazione: (2024)

On Wagner's k-Tree Algorithm Over Integers
di: Lin, Haoxing, et al.
Pubblicazione: (2024)

Fine-Grained Privacy Guarantees for Coverage Problems
di: Dhulipala, Laxman, et al.
Pubblicazione: (2024)

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

Improved Lower Bound for Differentially Private Facility Location
di: Manurangsi, Pasin
Pubblicazione: (2024)

Profile Reconstruction from Private Sketches
di: Wu, Hao, et al.
Pubblicazione: (2024)

Continual Counting with Gradual Privacy Expiration
di: Andersson, Joel Daniel, et al.
Pubblicazione: (2024)

Count on Your Elders: Laplace vs Gaussian Noise
di: Andersson, Joel Daniel, et al.
Pubblicazione: (2024)

Differential privacy and Sublinear time are incompatible sometimes
di: Blocki, Jeremiah, et al.
Pubblicazione: (2024)

Improving Lagarias-Odlyzko Algorithm For Average-Case Subset Sum: Modular Arithmetic Approach
di: Joux, Antoine, et al.
Pubblicazione: (2024)

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

An Affine Equivalence Algorithm for S-boxes based on Matrix Invariants
di: Hu, Xincheng, et al.
Pubblicazione: (2024)

Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph
di: Henzinger, Monika, et al.
Pubblicazione: (2024)

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

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

Private Synthetic Data Generation in Bounded Memory
di: Holland, Rayne, et al.
Pubblicazione: (2024)

An Efficient and Scalable Auditing Scheme for Cloud Data Storage using an Enhanced B-tree
di: Islam, Tariqul, et al.
Pubblicazione: (2024)

Private Counting of Distinct Elements in the Turnstile Model and Extensions
di: Henzinger, Monika, et al.
Pubblicazione: (2024)

Differentially Private Ad Conversion Measurement
di: Delaney, John, et al.
Pubblicazione: (2024)