Persistent Authenticated Dictionaries and Their Applications (2001)

by Aris Anagnostopoulos , Michael T. Goodrich , Roberto Tamassia
Venue:In Proc. Information Security Conference (ISC 2001), volume 2200 of LNCS
Citations:56 - 17 self

Active Bibliography

An Efficient Dynamic and Distributed RSA Accumulator – Michael T. Goodrich, Roberto Tamassia, Jasminka Hasić - 2009
27 Efficient Authenticated Dictionaries with Skip Lists and Commutative Hashing – Michael T. Goodrich, Roberto Tamassia - 2001
40 An Efficient Dynamic and Distributed Cryptographic Accumulator – Michael Goodrich, Roberto Tamassia, Jasminka Hasic - 2002
18 Computational bounds on hierarchical data processing with applications to information security – Roberto Tamassia, Nikos Triandopoulos - 2005
3 Efficient authenticated data structures for graph connectivity and geometric search problems – Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos - 2010
6 On the Cost of Persistence and Authentication in Skip Lists – Micheal T. Goodrich, Charalampos Papamanthou, Roberto Tamassia
20 On the Cost of Authenticated Data Structures – Roberto Tamassia, Nikos Triandopoulos - 2003
46 Authenticated Data Structures for Graph and Geometric Searching – Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos, Robert Cohen - 2001
431 Secure Group Communications Using Key Graphs – Chung Kei Wong, Mohamed Gouda , Simon S. Lam - 1998