Article

Persistent Authenticated Dictionaries and Their Applications

Authors:

Aris Anagnostopoulos,

Michael T. Goodrich,

Roberto TamassiaAuthors Info & Claims

ISC '01: Proceedings of the 4th International Conference on Information Security

Pages 379 - 393

Published: 01 October 2001 Publication History

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.

References

[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]

A. Buldas, P. Laud, and H. Lipmaa. Accountable certificate management with undeniable attestations. In ACM Conference on Computer and Communications Security . ACM Press, 2000.

[3]

P. Devanbu, M. Gertz, C. Martel, and S. Stubblebine. Authentic third-party data publication. In Fourteenth IFIP 11.3 Conference on Database Security , 2000.

[4]

J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan. Making data structures persistent. J. Comput. Syst. Sci. , 38:86-124, 1989.

[5]

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.

[6]

M. T. Goodrich and R. Tamassia. Efficient authenticated dictionaries with skip lists and commutative hashing. Technical Report, Johns Hopkins Information Security Institute, 2000.

[7]

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.

[8]

C. Gunter and T. Jim. Generalized certificate revocation. In Proc. 27th ACM Symp. on Principles of Programming Languages , pages 316-329, 2000.

[9]

C. Kaufman, R. Perlman, and M. Speciner. Network Security: Private Communication in a Public World . Prentice-Hall, Englewood Cliffs, NJ, 1995.

[10]

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.

[11]

D. E. Knuth. Sorting and Searching , volume 3 of The Art of Computer Programming . Addison-Wesley, Reading, MA, 1973.

[12]

P. C. Kocher. On certificate revocation and validation. In Proc. International Conference on Financial Cryptography , volume 1465 of Lecture Notes in Computer Science , 1998.

[13]

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.

[14]

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.

[15]

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.

[16]

W. Pugh. Skip lists: a probabilistic alternative to balanced trees. Commun. ACM , 33(6):668-676, 1990.

[17]

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.

[18]

N. Sarnak and R. E. Tarjan. Planar point location using persistent search trees. Commun. ACM , 29(7):669-679, July 1986.

Cited By

Zhang YPapamanthou CKatz J(2018)Verifiable Graph ProcessingACM Transactions on Privacy and Security10.1145/323318121:4(1-23)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.1145/3233181
Bender MFarach-Colton MJohnson RMauras SMayer TPhillips CXu HSallinger EVan den Bussche JGeerts F(2017)Write-Optimized Skip ListsProceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3034786.3056117(69-78)Online publication date: 9-May-2017
https://dl.acm.org/doi/10.1145/3034786.3056117
Chase MMeiklejohn SWeippl EKatzenbeisser SKruegel CMyers AHalevi S(2016)Transparency Overlays and ApplicationsProceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security10.1145/2976749.2978404(168-179)Online publication date: 24-Oct-2016
https://dl.acm.org/doi/10.1145/2976749.2978404
Show More Cited By

Recommendations

Authenticated Dictionaries: Real-World Costs and Trade-Offs

Authenticated dictionaries are a widely discussed paradigm to enable verifiable integrity for data storage on untrusted servers, such as today’s widely used “cloud computing” resources, allowing a server to provide a “proof,” typically in the form of a ...
Convertible multi-authenticated encryption scheme

A convertible authenticated encryption (CAE) scheme allows the signer to generate a valid authenticated ciphertext on his chosen message such that only the designated recipient can retrieve the message. Further, the recipient has the ability to convert ...
Practical convertible authenticated encryption schemes using self-certified public keys

A convertible authenticated encryption scheme allows a designated receiver to recover and verify a message simultaneously, during which the recipient can prove the dishonesty of the sender to any third party if the sender repudiates her signature later. ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

ISC '01: Proceedings of the 4th International Conference on Information Security

October 2001

552 pages

ISBN:3540426620

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 October 2001

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

42
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 09 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhang YPapamanthou CKatz J(2018)Verifiable Graph ProcessingACM Transactions on Privacy and Security10.1145/323318121:4(1-23)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.1145/3233181
Bender MFarach-Colton MJohnson RMauras SMayer TPhillips CXu HSallinger EVan den Bussche JGeerts F(2017)Write-Optimized Skip ListsProceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3034786.3056117(69-78)Online publication date: 9-May-2017
https://dl.acm.org/doi/10.1145/3034786.3056117
Chase MMeiklejohn SWeippl EKatzenbeisser SKruegel CMyers AHalevi S(2016)Transparency Overlays and ApplicationsProceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security10.1145/2976749.2978404(168-179)Online publication date: 24-Oct-2016
https://dl.acm.org/doi/10.1145/2976749.2978404
Esiner EKachkeev ABraunfeld SKüpçü AÖzkasap Ö(2016)FlexDPDPACM Transactions on Storage10.1145/294378312:4(1-44)Online publication date: 16-Aug-2016
https://dl.acm.org/doi/10.1145/2943783
Bender MBerry JJohnson RKroeger TMcCauley SPhillips CSimon BSingh SZage DMilo TTan W(2016)Anti-Persistence on Persistent StorageProceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/2902251.2902276(289-302)Online publication date: 15-Jun-2016
https://dl.acm.org/doi/10.1145/2902251.2902276
Zhang YBlanton M(2016)Efficient Dynamic Provable Possession of Remote Data via Update TreesACM Transactions on Storage10.1145/274787712:2(1-45)Online publication date: 19-Feb-2016
https://dl.acm.org/doi/10.1145/2747877
Erway CKüpçü APapamanthou CTamassia R(2015)Dynamic Provable Data PossessionACM Transactions on Information and System Security10.1145/269990917:4(1-29)Online publication date: 24-Apr-2015
https://dl.acm.org/doi/10.1145/2699909
Tang YWang TLiu LHu XJang JPayne CHahn AButler KSherr M(2014)Lightweight authentication of freshness in outsourced key-value storesProceedings of the 30th Annual Computer Security Applications Conference10.1145/2664243.2664244(176-185)Online publication date: 8-Dec-2014
https://dl.acm.org/doi/10.1145/2664243.2664244
Zhang YPapamanthou CKatz JAhn GYung MLi N(2014)ALITHEIAProceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security10.1145/2660267.2660354(856-867)Online publication date: 3-Nov-2014
https://dl.acm.org/doi/10.1145/2660267.2660354
Miller AHicks MKatz JShi E(2014)Authenticated data structures, genericallyACM SIGPLAN Notices10.1145/2578855.253585149:1(411-423)Online publication date: 8-Jan-2014
https://dl.acm.org/doi/10.1145/2578855.2535851
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents