EUVIMEDEUVIMED entdecken
Crossref

Deployment-driven Ranked Selection of Authenticated Data Structures for Tamper-evident Event Logging: A Formal Framework

Vitalii Torshyn, Olesya Pashchetnyk

Vìsnik Nacìonalʹnogo unìversitetu "Lʹvìvsʹka polìtehnìka". Serìâ Ìnformacìjnì sistemi ta merežì · 22.06.2026 · 19 · 519-530

DOI: 10.23939/sisn2026.19.519 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Vìsnik Nacìonalʹnogo unìversitetu "Lʹvìvsʹka polìtehnìka". Serìâ Ìnformacìjnì sistemi ta merežì, online erschienen am 17.05.2026. Verfasst von Vitalii Torshyn und 1 weiteren Autor:innen. Die Arbeit nennt 9 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The design of a production immutable event logging system at ingress node raises a concrete selection problem: for a given hardware environment and operational profile, which authenticated data structure family best satisfies three competing requirements simultaneously: maximum append throughput, compact proof size and fast verification speed, and bounded per-append CPU and RAM cost? This paper presents the Evaluation Framework for Authenticated Data Structures (EF-ADS) as a formal, parameterised model for selecting among five cryptographic data structure families applicable to immutable append-only logging at ingress layer: standard Merkle Trees (MT), Authenticated Skip Lists (ASL), Sparse Merkle Trees (SMT), two-level hierarchical Merkle structures (Merkle²), and Verkle Commitment-Proof trees (VCP). The framework maps deployment constraints are: peak ingestion rate, memory budget, per-append latency, and non-membership proof requirements to ranked candidate selections via closed-form analytical cost models. All CPU and RAM models are derived from first principles and calibrated against hardware measurements on an x86-64 processor for SHA-256 (SHANI), SHA3-256 (software) and BLAKE3(AVX2). Results demonstrate that MT and ASL dominate for high-throughput sequential logging; SMT and Merkle² are preferable for key-registry workloads requiring non-membership proofs; and VCP is excluded from all high-throughput contexts by the CPU feasibility condition, with measured per-append cost exceeding latency budgets by multiple times over other ADS.

Zitieren

APA

Torshyn, V., & Pashchetnyk, O. (2026). Deployment-driven Ranked Selection of Authenticated Data Structures for Tamper-evident Event Logging: A Formal Framework. Vìsnik Nacìonalʹnogo unìversitetu "Lʹvìvsʹka polìtehnìka". Serìâ Ìnformacìjnì sistemi ta merežì, 19, 519-530. https://doi.org/10.23939/sisn2026.19.519

Vancouver

Torshyn V, Pashchetnyk O. Deployment-driven Ranked Selection of Authenticated Data Structures for Tamper-evident Event Logging: A Formal Framework. Vìsnik Nacìonalʹnogo unìversitetu "Lʹvìvsʹka polìtehnìka". Serìâ Ìnformacìjnì sistemi ta merežì. 2026;19:519-530. doi:10.23939/sisn2026.19.519

BibTeX
@article{Torshyn2026,
  author = {Torshyn, Vitalii and Pashchetnyk, Olesya},
  title = {Deployment-driven Ranked Selection of Authenticated Data Structures for Tamper-evident Event Logging: A Formal Framework},
  journal = {Vìsnik Nacìonalʹnogo unìversitetu "Lʹvìvsʹka polìtehnìka". Serìâ Ìnformacìjnì sistemi ta merežì},
  year = {2026},
  volume = {19},
  pages = {519--530},
  doi = {10.23939/sisn2026.19.519}
}
Kostenlos starten →