Authenticated data structures for graph and geometric searching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2612, Issue , 2003, Pages 295-313

  Goodrich, Michael T ^a   Tamassia, Roberto ^b   Triandopoulos, Nikos ^b   Cohen, Robert ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Brown University   (United States)

^c UNIVERSITY OF MASSACHUSETTS BOSTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; CRYPTOGRAPHY; DATA STRUCTURES; GEOGRAPHIC INFORMATION SYSTEMS; NETWORK MANAGEMENT; QUERY PROCESSING;

AUTHENTICATED DATA STRUCTURES; GEOMETRIC OBJECTS; NETWORK MANAGEMENT SYSTEMS; PROOF OF CORRECTNESS; REMOTE HOST;

INFORMATION MANAGEMENT;

EID: 35248831605     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36563-x_20     Document Type: Article

References (39)

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.
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.
3. S.W. Bent, D.D. Sleator, and R.E. Tarjan. Biased search trees. SIAM J. Comput., 14:545-568, 1985.
4. M. Blum and S. Kannan. Designing programs that check their work. J. ACM, 42(1):269-291, Jan. 1995.
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.
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.
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.
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.
9. J. Camenisch and A. Lysyanskaya. Dynamic accumulators and application to efficient revocation of anonymous credentials. In Proc. CRYPTO, 2002.
10. B. Chazelle and L. J. Guibas. Fractional cascading: I. A data structuring technique. Algorithmica, 1(3):133-162, 1986.
11. B. Chazelle and L. J. Guibas. Fractional cascading: II. Applications. Algorithmica, 1:163-191, 1986.
12. R. F. Cohen and R. Tamassia. Combine and conquer. Algorithmica, 18:342-362, 1997.
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.
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.
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.
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.
17. G. Di Battista and R. Tamassia. On-line maintenance of triconnected components with SPQR-trees. Algorithmica, 15:302-318, 1996.
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.
19. U. Finkler and K. Mehlhorn. Checking priority queues. In Proc. 10th ACM-SIAM Symp. on Discrete Algorithms, pages S901-S902, 1999.
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.
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.
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.
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.
24. V. King. A simpler minimum spanning tree verification algorithm. In Workshop on Algorithms and Data Structures, pages 440-448, 1995.
25. P. G. Kocher. On certificate revocation and validation. In Proc. Int. Conf. on Financial Cryptography, volume 1465 of LNCS. Springer-Verlag, 1998.
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.
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.
28. ∼devanbu/files/model-paper.pdf.
29. K. Mehlhorn and S. Näher. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, UK, 2000.
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.
31. R. C. Merkle. Protocols for public key cryptosystems. In Proc. Symp. on Security and Privacy, pages 122-134. IEEE Computer Society Press, 1980.
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.
33. M. Naor and K. Nissim. Certificate revocation and certificate update. In Proc. 7th USENIX Security Symposium, pages 217-228, Berkeley, 1998.
34. F.P. Preparata and M.I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 3rd edition, Oct. 1990.
35. W. Pugh. Skip lists: a probabilistic alternative to balanced trees. Commun. ACM, 33(6):668-676, 1990.
36. D.D. Sleator and R.E. Tarjan. A data structure for dynamic trees. J. Comput. Syst. Sci., 26(3):362-381, 1983.
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.
38. G.F. Sullivan, D.S. Wilson, and G.M. Masson. Certification of computational results. IEEE Trans. Comput., 44(7):833-847, 1995.
39. J. Westbrook and R. E. Tarjan. Maintaining bridge-connected and biconnected components on-line. Algorithmica, 7:433-464, 1992.