Skip to main content

Abstract

In systems based on public key infrastructure in most cases we depend on trusted third party. Development of computer security systems and increase in popularity of public key infrastructure and its uses led to development of new data distribution methods — distribution based on untrusted publishers. It is possible to publish data by an untrusted publisher, however this data must contain authentication information in it. Validation of that information allows verification of information origin. Starting with certificate revocation list, certificate revocation trees we analyze these structures and find their strengths and weaknesses. By improving their strengths and eliminating their weaknesses we introduce a method for publishing data and their authentication information by an untrusted publisher. Basic concept of existing solutions is described in chapter 1. Chapter 2 introduced our method for publishing self authenticated data structures. Conclusions are described in chapter 3.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. Diestel R.: Graph Theory, Electronic Edition 2000, Springer-Verlag, New York (2000), pp.2–26

    Google Scholar 

  2. Even S., Goldreich O., Micali S.: On-Line/Off-Line Digital Signatures, Journal of Cryptology, Springer-Verlag, Vol. 9 (1996), pp. 35–67

    Article  MathSciNet  MATH  Google Scholar 

  3. Goodrich M., Tamassia R., Schwerin A.: Implementation of an Authenticated Dictionary with Skip Lists and Commutative Hashing, Proc. DARPA Information Survivability Conference and Exposition (DISCEX’ 01), IEEE Press, vol. 2 (2001), pp. 68–82

    Google Scholar 

  4. Goodrich M., Tamassia R., Hasic J.: An Efficient Dynamic and Distributed Cryptographic Accumulator, Proc. Information Security Conference (ISC 2002) Lecture Notes in Computer Science, vol. 2433, Springer-Verlag (2002), pp. 372–388

    Google Scholar 

  5. Kocher P.: A Quick Introduction to Certificate Revocation Trees(CRTs), Technical report, ValiCert, (1999)

    Google Scholar 

  6. Maćków W.: Linked authenticated dictionaries for certificate status verification, Enhanced Methods in Computer Security, Biometric and Artificial Intelligence Systems, Springer (2005), pp.35–46

    Google Scholar 

  7. Martel C, Nuckolls G., Devanbu P., Gertz M, Kwong A., Stubblebine S.: A General Model for Authentic Ddata Structures, Algorithmica (2001)

    Google Scholar 

  8. Micali S.: Efficient Certificate Revocation, Technical Memo MIT/LCS/TM-542b, (1996)

    Google Scholar 

  9. Muńoz J., Forńe J., Esparza O., Bernabe I., Soriano M.: Using OCSP to secure certificate-using transactions in m-commerce, Applied Cryptography and Network Security, vol. 2846 of LNCS, Springer-Verlag (2003), pp. 280–292

    Article  Google Scholar 

  10. Naor M., Nissim K.: Certificate Revocation and Certificate Update, Proceedings 7th USENIX Security Symposium, San Antonio, Texas, (1998)

    Google Scholar 

  11. Tamassia R., Triandopoulos N.: On the Cost of Authenticated data Structures, Technical Report, Brown University, (2003)

    Google Scholar 

  12. Tamassia R., Triandopoulos N.: Computational Bounds on Hierarchical Data Processing with Applications to Information Security, Technical Report, Brown University, (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer Science+Business Media, LLC

About this paper

Cite this paper

Kuriata, E., Maćków, W., Sukiennik, P. (2006). Hash Chaining for Authenticated Data Structures Freshness Checking. In: Saeed, K., Pejaś, J., Mosdorf, R. (eds) Biometrics, Computer Security Systems and Artificial Intelligence Applications. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-36503-9_14

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-36503-9_14

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-36232-8

  • Online ISBN: 978-0-387-36503-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics