Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Persistent Authenticated Dictionaries and Their Applications

  • Conference paper
  • First Online:
Information Security (ISC 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2200))

Included in the following conference series:

Abstract

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.

Research supported in part by DARPA Grant F30602-00-2-0509.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W. Aiello, S. Lodha, and R. Ostrovsky. Fast digital identity revocation. In Advances in Cryptology-CRYPTO ’ 98, Lecture Notes in Computer Science. Springer-Verlag, 1998.

    Google Scholar 

  2. A. Buldas, P. Laud, and H. Lipmaa. Accountable certificate management with undeniable attestations. In ACM Conference on Computer and Communications Security. ACM Press, 2000.

    Google Scholar 

  3. P. Devanbu, M. Gertz, C. Martel, and S. Stubblebine. Authentic third-party data publication. In Fourteenth IFIP 11.3 Conference on Database Security, 2000.

    Google Scholar 

  4. J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan. Making data structures persistent. J. Comput. Syst. Sci., 38:86–124, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  5. I. Gassko, P. S. Gemmell, and P. MacKenzie. Efficient and fresh certification. In International Workshop on Practice and Theory in Public Key Cryptography ’2000 (PKC ’2000), Lecture Notes in Computer Science, pages 342–353, Melbourne, Australia, 2000. Springer-Verlag, Berlin Germany.

    Google Scholar 

  6. M. T. Goodrich and R. Tamassia. Efficient authenticated dictionaries with skip lists and commutative hashing. Technical Report, Johns Hopkins Information Security Institute, 2000.

    Google Scholar 

  7. M. T. Goodrich, R. Tamassia, and A. Schwerin. Implementation of an authenticated dictionary with skip lists and commutative hashing. In Proc. 2001 DARPA Information Survivability Conference and Exposition, volume 2, pages 68–82, 2001.

    Article  Google Scholar 

  8. C. Gunter and T. Jim. Generalized certificate revocation. In Proc. 27th ACM Symp. on Principles of Programming Languages, pages 316–329, 2000.

    Google Scholar 

  9. C. Kaufman, R. Perlman, and M. Speciner. Network Security: Private Communication in a Public World. Prentice-Hall, Englewood Cliffs, NJ, 1995.

    Google Scholar 

  10. H. Kikuchi, K. Abe, and S. Nakanishi. Performance evaluation of certicate revocation using k-valued hash tree. In Proc. ISW’99, volume 1729 of LNCS, pages 103–117. Springer-Verlag, 1999.

    Google Scholar 

  11. D. E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley, Reading, MA, 1973.

    Google Scholar 

  12. P. C. Kocher. On certificate revocation and validation. In Proc. International Conference on Financial Cryptography, volume 1465 of Lecture Notes in Computer Science, 1998.

    Google Scholar 

  13. R. C. Merkle. A certified digital signature. In G. Brassard, editor, Advances in Cryptology — CRYPTO ’89, volume 435 of Lecture Notes in Computer Science, pages 218–238. Springer-Verlag, 1990.

    Google Scholar 

  14. E. W. Myers. Efficient applicative data types. In K. Kennedy, editor, Conference Record of the 11th Annual ACM Symposium on Principles of Programming Languages, pages 66–75, Salt Lake City, UT, Jan. 1984. ACM Press.

    Google Scholar 

  15. M. Naor and K. Nissim. Certificate revocation and certificate update. In Proceedings of the 7th USENIX Security Symposium (SECURITY-98), pages 217–228, Berkeley, 1998.

    Google Scholar 

  16. W. Pugh. Skip lists: a probabilistic alternative to balanced trees. Commun. ACM, 33(6):668–676, 1990.

    Article  MathSciNet  Google Scholar 

  17. T. Reps, T. Teitelbaum, and A. Demers. Incremental context-dependent analysis for language-based editors. ACM Transactions on Programming Languages and Systems, 5(3):449–477, July 1983.

    Article  Google Scholar 

  18. N. Sarnak and R. E. Tarjan. Planar point location using persistent search trees. Commun. ACM, 29(7):669–679, July 1986.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Computer Science, Brown University, Brown

    Aris Anagnostopoulos & Roberto Tamassia

  2. Dept. Computer Science, University of California, Irvine

    Michael T. Goodrich

Authors
  1. Aris Anagnostopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael T. Goodrich
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Roberto Tamassia
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of EECS, University of Wisconsin-Milwaukee, Milwaukee, WI, 53201, USA

    George I. Davida

  2. Techtegrity, LLC, 122 Harrison, Westfield, NJ, 07090, USA

    Yair Frankel

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Anagnostopoulos, A., Goodrich, M.T., Tamassia, R. (2001). Persistent Authenticated Dictionaries and Their Applications. In: Davida, G.I., Frankel, Y. (eds) Information Security. ISC 2001. Lecture Notes in Computer Science, vol 2200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45439-X_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-45439-X_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42662-2

  • Online ISBN: 978-3-540-45439-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation