Demo Data from EDBT 2026 / reviewers in the wild / expert
Michael Hanling
dblp:252/4256
· DBLP profile ↗
2ranked-venue papers
1as first author
1since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 1 first-author · 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 · 55% Cloud and datacenter computing · 46% | |
| Network and information security
2 papers |
Cryptographic protocols and secure computation · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Storage systems
storage reliability |
0.5 | 2 | 2021 | Poster: Proofs of Retrievability with Low Server Storage · CCS 2019 Dynamic proofs of retrievability with low server storage · USENIX Security Symposium 2021 |
Cryptographic protocols and secure computation › verifiable storage › proof of storage
proof of retrievability |
0.5 | 1 | 2021 | Dynamic proofs of retrievability with low server storage · USENIX Security Symposium 2021 |
Cloud and datacenter computing
cloud storage |
0.4 | 1 | 2019 | Poster: Proofs of Retrievability with Low Server Storage · CCS 2019 |
Storage systems › storage reliability › storage integrity
proof of retrievability |
0.4 | 1 | 2019 | Poster: Proofs of Retrievability with Low Server Storage · CCS 2019 |
Cloud and datacenter computing › cloud storage
provable data possession |
0.4 | 1 | 2019 | Poster: Proofs of Retrievability with Low Server Storage · CCS 2019 |
Cryptographic protocols and secure computation › integrity auditing
public auditing |
0.1 | 1 | 2019 | Poster: Proofs of Retrievability with Low Server Storage · CCS 2019 |
Methods — techniques the papers use, named apart from their topics
dynamic proofs of retrievability · 1.0cryptographic protocol design · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Dynamic proofs of retrievability with low server storage
Gaspard Anthoine, Jean-Guillaume Dumas, Mélanie de Jonghe, Aude Maignan, Clément Pernet, Michael Hanling, Daniel S. Roche |
USENIX Security Symposium | 6 |
| 2019 | Poster: Proofs of Retrievability with Low Server StorageabstractProof of Retrievability (PoR) and Provable Data Possession (PDP) schemes have been proposed to ensure the integrity of stored data on untrusted servers. A successful PoR audit ensures, with high probability, that every piece of stored data is recoverable by the server. Most PoR schemes proposed have focused on bandwidth and computation cost, but in some deployment scenarios the size of remote storage can be the most expensive factor. We propose a simple PoR scheme which is a variant on some existing PDP work. Compared to existing audit routines, the server computation cost and bandwidth are higher, but the server storage cost is minimal. Our preliminary work indicates that deploying this scheme may be less costly in commercial cloud settings, depending on the cost structure and frequency of audits. Michael Hanling, Gaspard Anthoine, Jean-Guillaume Dumas, Aude Maignan, Clément Pernet, Daniel S. Roche |
CCS | 1 |