Abstract
We introduce the notion of persistent authenticated dictionaries, that is, dictionaries where the user can make queries of the type “was element e in set S at time t?” and get authenticated answers. Applications include credential and certificate validation checking in the past (as in digital signatures for electronic contracts), digital receipts, and electronic tickets. We present two data structures that can efficiently support an infrastructure for persistent authenticated dictionaries, and we compare their performance.
Research supported in part by DARPA Grant F30602-00-2-0509.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
A. Buldas, P. Laud, and H. Lipmaa. Accountable certificate management with undeniable attestations. In ACM Conference on Computer and Communications Security. ACM Press, 2000.
P. Devanbu, M. Gertz, C. Martel, and S. Stubblebine. Authentic third-party data publication. In Fourteenth IFIP 11.3 Conference on Database Security, 2000.
J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan. Making data structures persistent. J. Comput. Syst. Sci., 38:86–124, 1989.
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.
M. T. Goodrich and R. Tamassia. Efficient authenticated dictionaries with skip lists and commutative hashing. Technical Report, Johns Hopkins Information Security Institute, 2000.
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.
C. Gunter and T. Jim. Generalized certificate revocation. In Proc. 27th ACM Symp. on Principles of Programming Languages, pages 316–329, 2000.
C. Kaufman, R. Perlman, and M. Speciner. Network Security: Private Communication in a Public World. Prentice-Hall, Englewood Cliffs, NJ, 1995.
H. Kikuchi, K. Abe, and S. Nakanishi. Performance evaluation of certicate revocation using k-valued hash tree. In Proc. ISW’99, volume 1729 of LNCS, pages 103–117. Springer-Verlag, 1999.
D. E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley, Reading, MA, 1973.
P. C. Kocher. On certificate revocation and validation. In Proc. International Conference on Financial Cryptography, volume 1465 of Lecture Notes in Computer Science, 1998.
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.
E. W. Myers. Efficient applicative data types. In K. Kennedy, editor, Conference Record of the 11th Annual ACM Symposium on Principles of Programming Languages, pages 66–75, Salt Lake City, UT, Jan. 1984. ACM Press.
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.
W. Pugh. Skip lists: a probabilistic alternative to balanced trees. Commun. ACM, 33(6):668–676, 1990.
T. Reps, T. Teitelbaum, and A. Demers. Incremental context-dependent analysis for language-based editors. ACM Transactions on Programming Languages and Systems, 5(3):449–477, July 1983.
N. Sarnak and R. E. Tarjan. Planar point location using persistent search trees. Commun. ACM, 29(7):669–679, July 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anagnostopoulos, A., Goodrich, M.T., Tamassia, R. (2001). Persistent Authenticated Dictionaries and Their Applications. In: Davida, G.I., Frankel, Y. (eds) Information Security. ISC 2001. Lecture Notes in Computer Science, vol 2200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45439-X_26
Download citation
DOI: https://doi.org/10.1007/3-540-45439-X_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42662-2
Online ISBN: 978-3-540-45439-7
eBook Packages: Springer Book Archive