On the Cost of Persistence and Authentication in Skip Lists

We present an extensive experimental study of authenticated data structures for dictionaries and maps implemented with skip lists. We consider realizations of these data structures that allow us to study the performance overhead of authentication and persistence. We explore various design decisions and analyze the impact of garbage collection and virtual memory paging, as well. Our empirical study confirms the efficiency of authenticated skip lists and offers guidelines for incorporating them in various applications.

[1]  Neal E. Young,et al.  Data collection for the Sloan Digital Sky Survey—a network-flow heuristic , 1996, SODA '96.

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

[3]  Michael T. Goodrich,et al.  Persistent Authenticated Dictionaries and Their Applications , 2001, ISC.

[4]  Andrzej Pelc,et al.  Deterministic Rendezvous in Graphs , 2003 .

[5]  Richard M. Karp,et al.  Mapping the genome: some combinatorial problems arising in molecular biology , 1993, STOC.

[6]  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.

[7]  Helmut Prodinger,et al.  The path length of random skip lists , 1994, Acta Informatica.

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

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

[10]  Arto Salomaa,et al.  Public-Key Cryptography , 1991, EATCS Monographs on Theoretical Computer Science.

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

[12]  Eric N. Hanson,et al.  The Interval Skip List: A Data Structure for Finding All Intervals that Overlap a Point , 1991, WADS.

[13]  Niklaus Wirth,et al.  Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.

[14]  Stephen Kent.  Sloan Digital Sky Survey , 1994 .

[15]  Peeter Laud,et al.  Eliminating Counterevidence with Applications to Accountable Certificate Management , 2002, J. Comput. Secur..

[16]  Alexander S. Szalay,et al.  The Science Archive for the Sloan Digital Sky Survey , 1996 .

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

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

[19]  Michael T. Goodrich,et al.  Authenticated Data Structures for Graph and Geometric Searching , 2003, CT-RSA.

[20]  Roberto Tamassia,et al.  Computational Bounds on Hierarchical Data Processing with Applications to Information Security , 2005, ICALP.

[21]  Roberto Tamassia,et al.  Authenticated Data Structures , 2003, ESA.

[22]  Gilles Dowek,et al.  Principles of programming languages , 1981, Prentice Hall International Series in Computer Science.

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

[24]  Peter Drake,et al.  Data structures and algorithms in Java , 2005 .

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

[26]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[27]  Kian-Lee Tan,et al.  Authenticating query results in edge computing , 2004, Proceedings. 20th International Conference on Data Engineering.

[28]  Michael Gertz,et al.  A General Model for Authenticated Data Structures , 2004, Algorithmica.

[29]  J. Ian Munro,et al.  The Binomial Transform and its Application to the Analysis of Skip Lists , 1995, ESA.

[30]  Glen Nuckolls.  Verified Query Results from Hybrid Authentication Trees , 2005, DBSec.

[31]  Alexander S. Szalay,et al.  The Sloan Digital Sky Survey , 1999, Comput. Sci. Eng..

[32]  J. Ian Munro,et al.  Average search and update costs in skip lists , 1992, BIT.

[33]  Paul G. Spirakis,et al.  Algorithms — ESA '95 , 1995, Lecture Notes in Computer Science.

[34]  Marc Joye,et al.  Topics in Cryptology — CT-RSA 2003 , 2003 .

[35]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[36]  Michael Gertz,et al.  Authentic Data Publication Over the Internet , 2003, J. Comput. Secur..

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