Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Owen Hines

dblp:399/1448 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 since 2021Security and privacy · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Storage systems · 80% Cloud and datacenter computing · 20%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems › data auditing
data integrity verification
0.912025
On Scalable Integrity Checking for Secure Cloud Disks · FAST 2025
Cloud and datacenter computing › cloud storage
secure cloud storage
0.912025
On Scalable Integrity Checking for Secure Cloud Disks · FAST 2025
Storage systems › storage reliability
storage integrity
0.912025
Efficient Storage Integrity in Adversarial Settings · SP 2025
Storage systems
storage reliability
0.912025
On Scalable Integrity Checking for Secure Cloud Disks · FAST 2025
Storage systems
untrusted storage
0.912025
Efficient Storage Integrity in Adversarial Settings · SP 2025

Methods — techniques the papers use, named apart from their topics

cryptographic hashing · 0.9
YearPublicationVenuePosition
2025 On Scalable Integrity Checking for Secure Cloud Disks
Quinn Burke 0002, Ryan Sheatsley, Owen Hines, Michael Swift, Patrick D. McDaniel
FAST4
2025 Efficient Storage Integrity in Adversarial Settings
abstract
Storage integrity is essential to systems and applications that use untrusted storage (e.g., public clouds, end-user devices). However, known methods for achieving storage integrity either suffer from high (and often prohibitive) overheads or provide weak integrity guarantees. In this work, we demonstrate a hybrid approach to storage integrity that simultaneously reduces overhead while providing strong integrity guarantees. Our system, partially asynchronous integrity checking (PAC), allows disk write commitments to be deferred while still providing guarantees around read integrity. PAC delivers a 5.5 × throughput and latency improvement over the state of the art, and 85% of the throughput achieved by non-integrity-assuring approaches. In this way, we show that untrusted storage can be used for integrity-critical workloads without meaningfully sacrificing performance.
Quinn Burke 0002, Ryan Sheatsley, Yohan Beugin, Eric Pauley, Owen Hines, Michael Swift, Patrick D. McDaniel
SP5