An efficient dynamic and distributed cryptographic accumulator

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

Volumn 2433, Issue , 2002, Pages 372-388

  Goodrich, Michael T ^a   Tamassia, Roberto ^b   Hasić, Jasminka ^b  

^a Ringgold Standard Institution Informatics   (United States)

^b Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PUBLIC KEY CRYPTOGRAPHY;

CERTIFICATE REVOCATION; CONSTANT TIME; DATA COLLECTION; INCREMENTAL UPDATES; INSERTIONS AND DELETIONS; MEMBERSHIP QUERY; ONE-WAY ACCUMULATORS; PUBLIC KEY INFRASTRUCTURE;

SECURITY OF DATA;

EID: 84945279475     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45811-5_29     Document Type: Conference Paper

References (28)

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. N. Baric and B. Pfitzmann. Collision-free accumulators and fail-stop signature schemes without trees. In Advances in Cryptology: Pr oc. EUROCRYPT, volume 1233 of LNCS, pages 480–494. Springer-Verlag, 1997.
3. M. Bellare, O. Goldreich, and S. Goldwasser. Incremental cryptography: The case of hashing and signing. In Advances in Cryptology—CRYPTO’94, volume 839 of LNCS, pages 216–233. Springer-Verlag, 1994.
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 LNCS, pages 274–285. Springer-Verlag, 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, W. Evans, P. Gemmell, S. Kannan, and M. Naor. Checking the correctness of memories. Algorithmica, 12(2/3):225–244, 1994.
7. M. Blum and S. Kannan. Designing programs that check their work. J. ACM, 42(1):269–291, Jan. 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. To appear.
10. I. L. Carter and M. N. Wegman. Universal classes of hash functions. In Proc. ACM Symp. on Theory of Computing, pages 106–112, 1977.
11. R. Cohen, M. T. Goodrich, R. Tamassia, and N. Triandopoulos. Authenticated data structures for graph and geometric searching. Technical report, Center for Geometric Computing, Brown University, 2001. http://www.cs.brown.edu/cgc/stms/papers/authDatStr.pdf.
12. D. A. Cooper. A more efficient use of delta-CRLs. In Proceedings of the 2000 IEEE Symposium on Security and Privacy, pages 190–202, 2000.
13. Fischlin. Incremental cryptography and memory checkers. In Proc. EUROCRYPT, volume 1233 of LNCS, pages 393–408. Springer-Verlag, 1997.
14. 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.
15. R. Gennaro, S. Halevi, and T. Rabin. Secure hash-and -sign signatures without the rand om oracle. In Proc. EUROCRYPT, volume 1592 of LNCS, pages 123–139. Springer-Verlag, 1999.
16. 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.
17. 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.
18. C. Kaufman, R. Perlman, and M. Speciner. Network Security: Private Communication in a Public World. Prentice-Hall, Englewood Cliffs, NJ, 1995.
19. P. C. Kocher. On certificate revocation and validation. In Proc. Int. Conf. on Financial Cryptography, volume 1465 of LNCS. Springer-Verlag, 1998.
20. B. Kroll and P. Widmayer. Distributing a search tree among a growing number of processors. ACM SIGMOD Record, 23(2):265–276, 1994.
21. 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.
22. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone. Hand book of Applied Cryptography. CRC Press, 1997.
23. R. C. Merkle. Protocols for public key cryptosystems. In Proc. Symp. on Security and Privacy, pages 122–134. IEEE Computer Society Press, 1980.
24. R. C. Merkle. A certified digital signature. In G. Brassard, editor, Proc. CRYPTO’89, volume 435 of LNCS, pages 218–238. Springer-Verlag, 1990.
25. M. Naor and K. Nissim. Certificate revocation and certificate update. In Proc. 7th USENIX Security Symposium, pages 217–228, Berkeley, 1998.
26. T. Sand er, A. Ta-Shma, and M. Yung. Blind, auditable membership proofs. In Proc. Financial Cryptography (FC 2000), volume 1962 of LNCS. Springer-Verlag, 2001.
27. B. Schneier. Applied Cryptography: protocols, algorithms, and source code in C. John Wiley and Sons, Inc., New York, 1994.
28. G. F. Sullivan, D. S. Wilson, and G. M. Masson. Certification of computational results. IEEE Trans. Comput., 44(7):833–847, 1995.