3 papers
cs.CR2023
Better Prefix Authentication
Aljoscha Meyer
We present new schemes for solving prefix authentication and secure relative timestamping. By casting a new light on antimonotone linking schemes, we improve upon the state of the…
cs.CR2023
SoK: Authenticated Prefix Relations -- A Unified Perspective On Relative Time-Stamping and Append-Only Logs
Aljoscha Meyer
Secure relative timestamping and secure append-only logs are two historically mostly independent lines of research, which we show to be sides of the same coin -- the authentication…
cs.CR2022
Range-Based Set Reconciliation
Aljoscha Meyer
Range-based set reconciliation is a simple approach to efficiently computing the union of two sets over a network, based on recursively partitioning the sets and comparing fingerpr…