Implementation of an authenticated dictionary with skip lists and commutative hashing

Proceedings - DARPA Information Survivability Conference and Exposition II, DISCEX 2001

Volumn 2, Issue , 2001, Pages 68-82

  Goodrich, M T ^a   Tamassia, R ^b   Schwerin, A ^b  

^a Johns Hopkins University   (United States)

^b Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HASH FUNCTIONS; PUBLIC KEY CRYPTOGRAPHY;

BUILDING BLOCKES; CERTIFICATE REVOCATION; DATA COLLECTION; EFFICIENT DATA STRUCTURES; PUBLIC KEY INFRASTRUCTURE; SKIP LISTES;

DATA STRUCTURES;

EID: 84964426510     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DISCEX.2001.932160     Document Type: Conference Paper

References (32)

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.
2. M. Bellare, O. Goldreich, and S. Goldwasser. Incremental cryptography: The case of hashing and signing. In Advances in Cryptology - CRYPTO '94, volume 839 of Lecture Notes in Computer Science, pages 216-233. Springer-Verlag, 1994.
3. M. Bellare, O. Goldreich, and S. Goldwasser. Incremental cryptography and application to virus protection. In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 45-56, 1995.
4. J. Benaloh and M. de Mare. One-way accumulators: A decentralized alternative to digital signatures. In Advances in Cryptology - EUROCRYPT 93, volume 765 of Lecture Notes in Computer Science, pages 274-285, 1993.
5. J. J. Bloch, D. S. Daniels, and A. Z. Spector. A weighted voting algorithm for replicated directories. Journal of the ACM, 34(4):859-909, 1987.
6. M. Blum. Program result checking: A new approach to making programs more reliable. In S. C. Andrzej Lingas, Rolf G. Karlsson, editor, Automata, Languages and Programming, 20th International Colloquium, volume 700 of Lecture Notes in Computer Science, pages 1-14. Springer-Verlag, 1993.
7. M. Blum, W. Evans, P. Gemmell, S. Kannan, and M. Naor. Checking the correctness of memories. Algorithmica, 12(2/3):225-244, 1994.
8. M. Blum and S. Kannan. Designing programs that check their work. J. ACM, 42(1):269-291, Jan. 1995.
9. M. Blum and H. Wasserman. Program result-checking: A theory of testing meets a test of theory. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pages 382-393, 1994.
10. R. J. Brunner, L. Csabai, A. S. Szalay, A. Connolly, G. P. Szokoly, and K. Ramaiyer. The science archive for the Sloan Digital Sky Survey. In Proceedings of Astronomical Data Analysis Software and Systems Conference V, 1996.
11. A. Buldas, P. Laud, and H. Lipmaa. Accountable certificate management with undeniable attestations. In ACM Conference on Computer and Communications Security. ACM Press, 2000.
12. P. Devanbu, M. Gertz, C. Martel, and S. Stubblebine. Authentic third-party data publication. In Fourteenth IFIP 11.3 Conference on Database Security, 2000.
13. Fischlin. Incremental cryptography and memory checkers. In EUROCRYPT: Advances in Cryptology: Proceedings of EUROCRYPT, LNCS 1233, pages 393-408, 1997.
14. M. Fischlin. Lower bounds for the signature size of incremental schemes. In 38th Annual Symposium on Foundations of Computer Science, pages 438-447, 1997.
15. 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.
16. M. T. Goodrich, A. Schwerin, and R. Tamassia. An efficient dynamic and distributed cryptographic accumulator. Technical Report, Johns Hopkins Information Security Institute, 2000.
17. M. T. Goodrich and R. Tamassia. Data Structures and Algorithms in Java. John Wiley & Sons, New York, NY, 1998.
18. M. T. Goodrich and R. Tamassia. Efficient authenticated dictionaries with skip lists and commutative hashing. Technical Report, Johns Hopkins Information Security Institute, 2000.
19. C. Gunter and T. Jim. Generalized certificate revocation. In Proc. 27th ACM Symp. on Principles of Programming Languages, pages 316-329, 2000.
20. R. M. Karp. Mapping the genome: Some combinatorial problems arising in molecular biology. In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, pages 278-285, 1993.
21. C. Kaufman, R. Perlman, and M. Speciner. Network Security: Private Communication in a Public World. Prentice-Hall, Englewood Cliffs, NJ, 1995.
22. P. C. Kocher. On certificate revocation and validation. In Proc. International Conference on Financial Cryptography, volume 1465 of Lecture Notes in Computer Science, 1998.
23. B. Kroll and P. Widmayer. Distributing a search tree among a growing number of processors. SIGMOD Record (ACM Special Interest Group on Management of Data), 23(2):265-276, 1994.
24. R. Lupton, F. M. Maley, and N. Young. Sloan digital sky survey. http://www.sdss.org/sdss.html.
25. R. Lupton, F. M. Maley, and N. Young. Data collection for the Sloan Digital Sky Survey - A network-flow heuristic. Journal of Algorithms, 27(2):339-356, 1998.
26. R. C. Merkle. Protocols for public key cryptosystems. In Proc. Symp. on Security and Privacy. IEEE Computer Society Press, 1980.
27. 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.
28. S. Micali. Efficient certificate revocation. Technical Report TM-542b, MIT Laboratory for Computer Science, 1996.
29. 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.
30. W. Pugh. Skip lists: a probabilistic alternative to balanced trees. Commun. ACM, 33(6):668-676, 1990.
31. B. Schneier. Applied cryptography: protocols, algorithms, and sourcecode in C. John Wiley and Sons, Inc., New York, 1994.
32. G. F. Sullivan, D. S. Wilson, and G. M. Masson. Certification of computational results. IEEE Trans. Comput., 44(7):833-847, 1995.