Persistent Authenticated Dictionaries and Their Applications

We introduce the notion of persistent authenticated dictionaries, that is, dictionaries where the user can make queries of the type "was element e in set S at time t?" and get authenticated answers. Applications include credential and certificate validation checking in the past (as in digital signatures for electronic contracts), digital receipts, and electronic tickets. We present two data structures that can efficiently support an infrastructure for persistent authenticated dictionaries, and we compare their performance.

[1]  William Pugh,et al.  Skip Lists: A Probabilistic Alternative to Balanced Trees , 1989, WADS.

[2]  Michael Gertz,et al.  Authentic Third-party Data Publication , 2000, DBSec.

[3]  Robert E. Tarjan,et al.  Planar point location using persistent search trees , 1986, CACM.

[4]  Peter Gemmell,et al.  Efficient and Fresh Cerification , 2000, Public Key Cryptography.

[5]  Hugo Krawczyk,et al.  Advances in Cryptology - CRYPTO '98 , 1998 .

[6]  Carl A. Gunter,et al.  Generalized certificate revocation , 2000, POPL '00.

[7]  Michael T. Goodrich,et al.  Implementation of an authenticated dictionary with skip lists and commutative hashing , 2001, Proceedings DARPA Information Survivability Conference and Exposition II. DISCEX'01.

[8]  Paul C. Kocher.  On Certificate Revocation and Validation , 1998, Financial Cryptography.

[9]  Ralph C. Merkle,et al.  A Certified Digital Signature , 1989, CRYPTO.

[10]  Rafail Ostrovsky,et al.  Fast Digital Identity Revocation (Extended Abstract) , 1998, CRYPTO.

[11]  Donald E. Knuth,et al.  Sorting and Searching , 1973 .

[12]  Moni Naor,et al.  Certificate revocation and certificate update , 1998, IEEE Journal on Selected Areas in Communications.

[13]  Robert E. Tarjan,et al.  Making data structures persistent , 1986, STOC '86.

[14]  Thomas W. Reps,et al.  Incremental Context-Dependent Analysis for Language-Based Editors , 1983, TOPL.

[15]  Peeter Laud,et al.  Accountable certificate management using undeniable attestations , 2000, CCS.

[16]  Eugene W. Myers,et al.  Efficient applicative data types , 1984, POPL.

[17]  M. Goodrich,et al.  Efficient Authenticated Dictionaries with Skip Lists and Commutative Hashing , 2000 .

[18]  Rafail Ostrovsky,et al.  Fast digital identity revocation , 1998 .

[19]  Radia J. Perlman,et al.  Network security - private communication in a public world , 2002, Prentice Hall series in computer networking and distributed systems.

[20]  Shohachiro Nakanishi,et al.  Performance Evaluation of Certificate Revocation Using k-Valued Hash Tree , 1999, ISW.

[21]  Michael Wiener,et al.  Advances in Cryptology — CRYPTO’ 99 , 1999 .