Gaspard Anthoine

dblp:252/4152 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
4since 2021 · last 2026
0009-0004-3977-617XORCID · corroborated

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

Security and privacy · 5 · 3 first-author · 4 since 2021
YearPublicationVenuePosition
2026 Lower Bounding Update Frequency in Short Accumulators and Vector Commitments
Hamza Abusalah, Gaspard Anthoine, Gennaro Avitabile, Emanuele Giunta
EUROCRYPT (5)2
2025 Verification-Efficient Homomorphic Signatures for Verifiable Computation over Data Streams
Gaspard Anthoine, Daniele Cozzo, Dario Fiore 0001
FC (2)1
2024 Fully-Succinct Multi-key Homomorphic Signatures from Standard Assumptions
Gaspard Anthoine, David Balbás, Dario Fiore 0001
CRYPTO (3)1
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 Symposium1
2019 Poster: Proofs of Retrievability with Low Server Storage
abstract
Proof 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
CCS2