On the Cost of Persistence and Authentication in Skip Lists

  • Michael T. Goodrich
  • Charalampos Papamanthou
  • Roberto Tamassia
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4525)


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.


Garbage Collection Insertion Time Java Virtual Machine Binary Search Tree Authentication Information 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Aiello, W., Lodha, S., Ostrovsky, R.: Fast digital identity revocation. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, Springer, Heidelberg (1998)Google Scholar
  2. Anagnostopoulos, A., Goodrich, M.T., Tamassia, R.: Persistent authenticated dictionaries and their applications. In: Davida, G.I., Frankel, Y. (eds.) ISC 2001. LNCS, vol. 2200, pp. 379–393. Springer, Heidelberg (2001)Google Scholar
  3. Brunner, R.J., Csabai, L., Szalay, A.S., Connolly, A., Szokoly, G.P., Ramaiyer, K.: The science archive for the Sloan Digital Sky Survey. In: Proc. Astronomical Data Analysis Software and Systems Conference V (1996)Google Scholar
  4. Buldas, A., Laud, P., Lipmaa, H.: Eliminating counterevidence with applications to accountable certificate management. Journal of Computer Security 10(3), 273–296 (2002)Google Scholar
  5. Devanbu, P., Gertz, M., Martel, C., Stubblebine, S.G.: Authentic data publication over the Internet. Journal of Computer Security 11(3), 291–314 (2003)Google Scholar
  6. Driscoll, J.R., Sarnak, N., Sleator, S., Tarjan, R.E.: Making data structures persistent. In: Proc. ACM Sympos, pp. 109–121. ACM Press, New York (1986)Google Scholar
  7. Gassko, I., Gemmell, P.S., MacKenzie, P.: Efficient and fresh certification. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1751, pp. 342–353. Springer, Heidelberg (2000)Google Scholar
  8. Goodrich, M.T., Tamassia, R.: Implementation of an authenticated dictionary with skip lists and commutative hashing. In: Proc. DARPA Information Survivability Conference & Exposition II (DISCEX II), pp. 68–82. IEEE Press, New York (2001)CrossRefGoogle Scholar
  9. Goodrich, M.T., Tamassia, R.: Data Structures and Algorithms in Java, 4th edn. John Wiley & Sons, New York (2006)Google Scholar
  10. Goodrich, M.T., Tamassia, R., Triandopoulos, N., Cohen, R.: Authenticated data structures for graph and geometric searching. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 295–313. Springer, Heidelberg (2003)Google Scholar
  11. Gunter, C., Jim, T.: Generalized certificate revocation. In: Proc. 27th ACM Symp. on Principles of Programming Languages, pp. 316–329. ACM Press, New York (2000)CrossRefGoogle Scholar
  12. Hanson, E.N.: The interval skip list: a data structure for finding all intervals that overlap a point. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1991. LNCS, vol. 519, pp. 153–164. Springer, Heidelberg (1991)CrossRefGoogle Scholar
  13. Karp, R.M.: Mapping the genome: Some combinatorial problems arising in molecular biology. In: Proc. ACM Symp. on the Theory of Computing, pp. 278–285. ACM Press, New York (1993)Google Scholar
  14. Kaufman, C., Perlman, R., Speciner, M.: Network Security: Private Communication in a Public World. Prentice-Hall, Englewood Cliffs (1995)Google Scholar
  15. Kirschenhofer, P., Prodinger, H.: The path length of random skip lists. Acta Informatica 31, 775–792 (1994)CrossRefMathSciNetGoogle Scholar
  16. Lupton, R., Maley, F.M., Young, N.: Sloan digital sky survey,
  17. Lupton, R., Maley, F.M., Young, N.: Data collection for the Sloan Digital Sky Survey—A network-flow heuristic. Journal of Algorithms 27(2), 339–356 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  18. Martel, C., Nuckolls, G., Devanbu, P., Gertz, M., Kwong, A., Stubblebine, S.G.: A general model for authenticated data structures. Algorithmica 39(1), 21–41 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  19. Mehlhorn, K., Näher, S.: LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (2000)Google Scholar
  20. Micali, S.: Efficient certificate revocation. Technical Report TM-542b, MIT Laboratory for Computer Science (1996)Google Scholar
  21. Naor, M., Nissim, K.: Certificate revocation and certificate update. In: Proc. 7th USENIX Security Symposium, Berkeley pp. 217–228 (1998)Google Scholar
  22. Nuckolls, G.: Verified query results from hybrid authentication trees. In: DBSec, pp. 84–98 (2005)Google Scholar
  23. Pang, H., Tan, K.-L.: Authenticating query results in edge computing. In: Proc. Int. Conference on Data Engineering, pp. 560–571 (2004)Google Scholar
  24. Papadakis, T., Munro, J.I., Poblete, P.V.: Average search and update costs in skip lists. BIT 32, 316–332 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  25. Poblete, P.V., Munro, J.I., Papadakis, T.: The binomial transform and its application to the analysis of skip lists. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol. 979, pp. 554–569. Springer, Heidelberg (1995)Google Scholar
  26. Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Commun. ACM 33(6), 668–676 (1990)CrossRefMathSciNetGoogle Scholar
  27. Tamassia, R.: Authenticated data structures. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 2–5. Springer, Heidelberg (2003)Google Scholar
  28. Tamassia, R., Triandopoulos, N.: Computational bounds on hierarchical data processing with applications to information security. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 153–165. Springer, Heidelberg (2005)Google Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Michael T. Goodrich
    • 1
  • Charalampos Papamanthou
    • 2
  • Roberto Tamassia
    • 2
  1. 1.Department of Computer Science, University of California, Irvine 
  2. 2.Department of Computer Science, Brown University 

Personalised recommendations