The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Implementation of an authenticated dictionary with skip lists and commutative hashing
Abstract
We present the software architecture and implementation of an efficient data structure for dynamically maintaining an authenticated dictionary. The building blocks of the data structure are skip lists and one-way commutative hash functions. We also present the results of a preliminary experiment on the performance of the data structure. Applications of our work include certificate revocation in a public key infrastructure and the publication of data collections on the Internet.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Protocols for Public Key Cryptosystems
Merkle, R. C. (1980) · 1980 IEEE Symposium on Security and Privacy · doi:10.1109/sp.1980.10006 · Cited by 1,418 · cited 1×
“The hash tree scheme introduced by Merkle [26, 27] can be used to implement a static authenticated dictionary, which supports the initial construction of the data structure followed by query operations, but not update operations (without complete rebuilding).”
MethodOne-Way Accumulators: A Decentralized Alternative to Digital Signatures
Benaloh, J., & de Mare, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_24 · Cited by 572
Cited by
Dynamic provable data possession
Erway, C., Küpçü, A., Papamanthou, C., & Tamassia, R. (2009) · Proceedings of the 16th ACM conference on Computer and communications security · doi:10.1145/1653662.1653688 · Cited by 897
Self-citationArchitectural support for copy and tamper resistant software
Thekkath, D. L. C., Mitchell, M., Lincoln, P., Boneh, D., Mitchell, J., & Horowitz, M. (2000) · ACM SIGARCH Computer Architecture News · doi:10.1145/378995.379237 · Cited by 597
Continuous Tamper-Proof Logging Using TPM 2.0
Sinha, A., Jia, L., England, P., & Lorch, J. R. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-08593-7_2 · Cited by 30
Metadata
- Authors
- Goodrich, M. T., Tamassia, R., & Schwerin, A.
- Venue
- Proceedings DARPA Information Survivability Conference and Exposition II. DISCEX'01
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-13
- Volume
- 2
- Pages
- 68-82
- OpenAlex
- W2125040475
- Cited by
- 178
- References
- 2
- FWCI
- 10.60
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Implementation of an authenticated dictionary with skip lists and commutative hashing. https://app.cochat.ai/papers/10.1109/discex.2001.932160
- The paper
- Goodrich, M. T., Tamassia, R., & Schwerin, A. (2002). Implementation of an authenticated dictionary with skip lists and commutative hashing. Proceedings DARPA Information Survivability Conference and Exposition II. DISCEX'01. https://doi.org/10.1109/discex.2001.932160
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.