Skip to main content
Springer Nature Link
Log in

Authenticated Data Structures for Graph and Geometric Searching

  • Conference paper
  • First Online:
Topics in Cryptology — CT-RSA 2003 (CT-RSA 2003)

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

Included in the following conference series:

  • 1262 Accesses

Abstract

Authenticated data structures provide cryptographic proofs that their answers are as accurate as the author intended, even if the data structure is maintained by a remote host. We present techniques for authenticating data structures that represent graphs and collections of geometric objects. In our model, a data structure maintained by a trusted source is mirrored at distributed directories that answer queries and provide proof of correctness. Our work has applications to the authentication of network management systems and geographic information systems.

Research supported in part by DARPA Grant F30602-00-2-0509 and NSFGrant CCR-0098068.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. A. Anagnostopoulos, M. T. Goodrich, and R. Tamassia. Persistent authenticated dictionaries and their applications. In Proc. Information Security Conference (ISC 2001), volume 2200 of LNCS, pages 379–393. Springer-Verlag, 2001. 297

    Google Scholar 

  2. S. Ar, M. Blum, B. Codenotti, and P. Gemmell. Checking approximate computations over the reals. In Proc. ACM Symp. on the Theory of Computing, pages 786–795, 1993. 295

    Google Scholar 

  3. S. W. Bent, D. D. Sleator, and R. E. Tarjan. Biased search trees. SIAM J. Comput., 14:545–568, 1985. 302, 310

    Article  MATH  MathSciNet  Google Scholar 

  4. M. Blum and S. Kannan. Designing programs that check their work. J. ACM, 42(1):269–291, Jan. 1995. 295

    Article  MATH  Google Scholar 

  5. J. D. Bright and G. Sullivan. Checking mergeable priority queues. In Digest of the 24th Symposium on Fault-Tolerant Computing, pages 144–153. IEEE Computer Society Press, 1994. 295

    Google Scholar 

  6. J. D. Bright and G. Sullivan. On-line error monitoring for several data structures. In Digest of the 25th Symposium on Fault-Tolerant Computing, pages 392–401. IEEE Computer Society Press, 1995. 295

    Google Scholar 

  7. J. D. Bright, G. Sullivan, and G. M. Masson. Checking the integrity of trees. In Digest of the 25th Symposium on Fault-Tolerant Computing, pages 402–411. IEEE Computer Society Press, 1995. 295

    Google Scholar 

  8. A. Buldas, P. Laud, and H. Lipmaa. Accountable certificate management using undeniable attestations. In ACM Conference on Computer and Communications Security, pages 9–18. ACM Press, 2000. 297

    Google Scholar 

  9. J. Camenisch and A. Lysyanskaya. Dynamic accumulators and application to efficient revocation of anonymous credentials. In Proc. CRYPTO, 2002. 297

    Google Scholar 

  10. B. Chazelle and L. J. Guibas. Fractional cascading: I. A data structuring technique. Algorithmica, 1(3):133–162, 1986. 297, 303

    Article  MATH  MathSciNet  Google Scholar 

  11. B. Chazelle and L. J. Guibas. Fractional cascading: II. Applications. Algorithmica, 1:163–191, 1986. 298, 306

    Article  MATH  MathSciNet  Google Scholar 

  12. R. F. Cohen and R. Tamassia. Combine and conquer. Algorithmica, 18:342–362, 1997. 299

    Article  MathSciNet  Google Scholar 

  13. P. Devanbu, M. Gertz, A. Kwong, C. Martel, G. Nuckolls, and S. Stubblebine. Flexible authentication of XML documents. In Proc. ACM Conference on Computer and Communications Security, 2001. 297

    Google Scholar 

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

    Google Scholar 

  15. O. Devillers, G. Liotta, F. P. Preparata, and R. Tamassia. Checking the convexity of polytopes and the planarity of subdivisions. Comput. Geom. Theory Appl., 11:187–208, 1998. 295

    MATH  MathSciNet  Google Scholar 

  16. G. Di Battista and G. Liotta. Upward planarity checking: “Faces are more than polygons”. In S. H. Whitesides, editor, Graph Drawing (Proc. GD’ 98), volume 1547 of Lecture Notes Comput. Sci., pages 72–86. Springer-Verlag, 1998. 295

    Google Scholar 

  17. G. Di Battista and R. Tamassia. On-line maintenance of triconnected components with SPQR-trees. Algorithmica, 15:302–318, 1996. 312

    Article  MATH  MathSciNet  Google Scholar 

  18. D. Eppstein, G. F. Italiano, R. Tamassia, R. E. Tarjan, J. Westbrook, and M. Yung. Maintenance of a minimum spanning forest in a dynamic plane graph. J. Algorithms, 13(1):33–54, 1992. 311

    Article  MATH  MathSciNet  Google Scholar 

  19. U. Finkler and K. Mehlhorn. Checking priority queues. In Proc. 10th ACM-SIAM Symp. on Discrete Algorithms, pages S901–S902, 1999. 295

    Google Scholar 

  20. I. Gassko, P. S. Gemmell, and P. MacKenzie. Efficient and fresh certification. In Int. Workshop on Practice and Theory in Public Key Cryptography (PKC’ 2000), volume 1751 of LNCS, pages 342–353. Springer-Verlag, 2000. 297

    Google Scholar 

  21. M. T. Goodrich and R. Tamassia. Efficient authenticated dictionaries with skip lists and commutative hashing. Technical report, Johns Hopkins Information Security Institute, 2000. http://www.cs.brown.edu/cgc/stms/papers/hashskip.pdf. 296, 297, 311

  22. M. T. Goodrich, R. Tamassia, and J. Hasic. An efficient dynamic and distributed cryptographic accumulator. In Proc. Int. Security Conference (ISC 2002), volume 2433 of LNCS, pages 372–388. Springer-Verlag, 2002. 297

    Google Scholar 

  23. 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. 297

    Google Scholar 

  24. V. King. A simpler minimum spanning tree verification algorithm. In Workshop on Algorithms and Data Structures, pages 440–448, 1995. 295

    Google Scholar 

  25. P. C. Kocher. On certificate revocation and validation. In Proc. Int. Conf. on Financial Cryptography, volume 1465 of LNCS. Springer-Verlag, 1998. 296

    Google Scholar 

  26. P. Maniatis and M. Baker. Enabling the Archival Storage of Signed Documents. In Proceedings of the USENIX Conference on File and Storage Technologies (FAST 2002), Monterey, CA, USA, 2002. 297

    Google Scholar 

  27. P. Maniatis and M. Baker. Secure History Preservation Through Timeline Entanglement. In Proceedings of the 11th USENIX Security Symposium, San Francisco, CA, USA, 2002. 297

    Google Scholar 

  28. C. Martel, G. Nuckolls, P. Devanbu, M. Gertz, A. Kwong, and S. Stubblebine. A general model for authentic data publication, 2001. http://www.cs.ucdavis.edu/~devanbu/files/model-paper.pdf. 296, 297, 298

  29. K. Mehlhorn and S. Näher. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, UK, 2000. 295

    Google Scholar 

  30. K. Mehlhorn, S. Näher, M. Seel, R. Seidel, T. Schilz, S. Schirra, and C. Uhrig. Checking geometric programs or verification of geometric structures. Comput. Geom. Theory Appl., 12(1–2):85–103, 1999. 295

    MATH  Google Scholar 

  31. R. C. Merkle. Protocols for public key cryptosystems. In Proc. Symp. on Security and Privacy, pages 122–134. IEEE Computer Society Press, 1980. 296

    Google Scholar 

  32. R. C. Merkle. A certified digital signature. In G. Brassard, editor, Proc. CRYPTO’ 89, volume 435 of LNCS, pages 218–238. Springer-Verlag, 1990. 296

    Google Scholar 

  33. M. Naor and K. Nissim. Certificate revocation and certificate update. In Proc. 7th USENIX Security Symposium, pages 217–228, Berkeley, 1998. 296, 297

    Google Scholar 

  34. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 3rd edition, Oct. 1990. 298

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  36. D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. J. Comput. Syst. Sci., 26(3):362–381, 1983. 301, 310

    Article  MATH  MathSciNet  Google Scholar 

  37. G. F. Sullivan and G. M. Masson. Certification trails for data structures. In Digest of the 21st Symposium on Fault-Tolerant Computing, pages 240–247. IEEE Computer Society Press, 1991. 295

    Google Scholar 

  38. G. F. Sullivan, D. S. Wilson, and G. M. Masson. Certification of computational results. IEEE Trans. Comput., 44(7):833–847, 1995. 295

    Article  MATH  Google Scholar 

  39. J. Westbrook and R. E. Tarjan. Maintaining bridge-connected and biconnected components on-line. Algorithmica, 7:433–464, 1992. 311

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Computer Science, Univ. of California, Irvine

    Michael T. Goodrich

  2. Dept. Computer Science, Brown University, USA

    Roberto Tamassia & Nikos Triandopoulos

  3. Dept. Computer Science, Univ. of Massachusetts, Boston

    Robert Cohen

Authors
  1. Michael T. Goodrich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roberto Tamassia
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nikos Triandopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Robert Cohen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Gemplus, Card Security Group, La Vigie, Avenue du Jujubier, ZI Athélia IV, 13705, La Ciotat Cedex, France

    Marc Joye

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goodrich, M.T., Tamassia, R., Triandopoulos, N., Cohen, R. (2003). Authenticated Data Structures for Graph and Geometric Searching. In: Joye, M. (eds) Topics in Cryptology — CT-RSA 2003. CT-RSA 2003. Lecture Notes in Computer Science, vol 2612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36563-X_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-36563-X_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00847-7

  • Online ISBN: 978-3-540-36563-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics