Cover Image

Dynamic Accountable Storage: An Efficient Protocol for Real-time Cloud Storage Auditing

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Goodrich, Michael T., Kitagawa, Ryuto, Sridhar, Vinesh
Format:	Preprint
Published:	2024
Subjects:	Cryptography and Security Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

How to Sort in a Refrigerator: Simple Entropy-Sensitive Strictly In-Place Sorting Algorithms
by: Gila, Ofek, et al.
Published: (2026)

Zip-Tries: Simple Dynamic Data Structures for Strings
by: Eppstein, David, et al.
Published: (2025)

Making Quickhull More Like Quicksort: A Simple Randomized Output-Sensitive Convex Hull Algorithm
by: Goodrich, Michael T., et al.
Published: (2024)

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

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

It is high time we let go of the Mersenne Twister
by: Vigna, Sebastiano
Published: (2019)

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

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

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

Differentially Private Matchings
by: Dinitz, Michael, et al.
Published: (2025)

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

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

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

Adversary Resilient Learned Bloom Filters
by: Almashaqbeh, Ghada, et al.
Published: (2024)

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

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

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

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

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

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

Improved Lower Bound for Differentially Private Facility Location
by: Manurangsi, Pasin
Published: (2024)

Profile Reconstruction from Private Sketches
by: Wu, Hao, et al.
Published: (2024)

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

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

Optimal Offline ORAM with Perfect Security via Simple Oblivious Priority Queues
by: Thießen, Thore, et al.
Published: (2024)

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

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

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

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

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

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

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

Differentially Private Ad Conversion Measurement
by: Delaney, John, et al.
Published: (2024)

Differential Privacy with Multiple Selections
by: Goel, Ashish, et al.
Published: (2024)

Better Gaussian Mechanism using Correlated Noise
by: Lebeda, Christian Janos
Published: (2024)

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

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

On Computing Pairwise Statistics with Local Differential Privacy
by: Ghazi, Badih, et al.
Published: (2024)

Differentially Private Gomory-Hu Trees
by: Aamand, Anders, et al.
Published: (2024)