Authenticated Append-only Skip Lists
| dc.creator | Maniatis, Petros | |
| dc.creator | Baker, Mary | |
| dc.date | 2003-02-07 | |
| dc.date.accessioned | 2026-07-07T03:19:26Z | |
| dc.date.available | 2026-07-07T03:19:26Z | |
| dc.description | In this work we describe, design and analyze the security of a tamper-evident, append-only data structure for maintaining secure data sequences in a loosely coupled distributed system where individual system components may be mutually distrustful. The resulting data structure, called an Authenticated Append-Only Skip List (AASL), allows its maintainers to produce one-way digests of the entire data sequence, which they can publish to others as a commitment on the contents and order of the sequence. The maintainer can produce efficiently succinct proofs that authenticate a particular datum in a particular position of the data sequence against a published digest. AASLs are secure against tampering even by malicious data structure maintainers. First, we show that a maintainer cannot ``invent'' and authenticate data elements for the AASL after he has committed to the structure. Second, he cannot equivocate by being able to prove conflicting facts about a particular position of the data sequence. This is the case even when the data sequence grows with time and its maintainer publishes successive commitments at times of his own choosing. AASLs can be invaluable in reasoning about the integrity of system logs maintained by untrusted components of a loosely-coupled distributed system. | |
| dc.description | 24 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0302010 | |
| dc.identifier | http://arxiv.org/abs/cs/0302010 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31458 | |
| dc.subject | Cryptography and Security | |
| dc.subject | Distributed, Parallel, and Cluster Computing | |
| dc.subject | K.6.5; D.4.6; C.2.4 | |
| dc.title | Authenticated Append-only Skip Lists | |
| dc.type | text |