{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T16:47:58Z","timestamp":1791046078558,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,10,27]],"date-time":"2008-10-27T00:00:00Z","timestamp":1225065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,10,27]]},"DOI":"10.1145\/1455770.1455826","type":"proceedings-article","created":{"date-parts":[[2008,11,6]],"date-time":"2008-11-06T13:49:50Z","timestamp":1225979390000},"page":"437-448","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":82,"title":["Authenticated hash tables"],"prefix":"10.1145","author":[{"given":"Charalampos","family":"Papamanthou","sequence":"first","affiliation":[{"name":"Brown University, Providence, RI, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[{"name":"Brown University, Providence, RI, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikos","family":"Triandopoulos","sequence":"additional","affiliation":[{"name":"University of Aarhus, Aarhus, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2008,10,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315318"},{"key":"e_1_3_2_1_2_1","first-page":"480","volume-title":"Proc. EUROCRYPT","author":"Baric N.","year":"1997","unstructured":"N. Baric and B. Pfitzmann . Collision-free accumulators and fail-stop signature schemes without trees . In Proc. EUROCRYPT , pp. 480 -- 494 , 1997 . N. Baric and B. Pfitzmann. Collision-free accumulators and fail-stop signature schemes without trees. In Proc. EUROCRYPT, pp. 480--494, 1997."},{"key":"e_1_3_2_1_3_1","first-page":"274","volume-title":"Proc. EUROCRYPT","author":"Benaloh J.","year":"1993","unstructured":"J. Benaloh and M. de Mare . One-way accumulators : A decentralized alternative to digital signatures . In Proc. EUROCRYPT , pp. 274 -- 285 , 1993 . J. Benaloh and M. de Mare. One-way accumulators: A decentralized alternative to digital signatures. In Proc. EUROCRYPT, pp. 274--285, 1993."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185352"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/352600.352604"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/646767.704437"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/800105.803400"},{"key":"e_1_3_2_1_8_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms . MIT Press , Cambridge, MA , 2 nd edition, 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, Cambridge, MA, 2nd edition, 2001.","edition":"2"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791194094"},{"key":"e_1_3_2_1_10_1","volume-title":"Manuscript","author":"Dwork C.","year":"2008","unstructured":"C. Dwork , M. Naor , G.N. Rothblum , and V. Vaikuntanathan . How efficient can memory checking be ? Manuscript , 2008 . C. Dwork, M. Naor, G.N. Rothblum, and V. Vaikuntanathan. How efficient can memory checking be? Manuscript, 2008."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_9"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72845-0_8"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85886-7_6"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/648026.744658"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/DISCEX.2001.932160"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79263-5_26"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36563-X_20"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/645473.653565"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01759063"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72738-5_17"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237999"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-003-1076-8"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/646754.705190"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/28.3.330"},{"key":"e_1_3_2_1_25_1","first-page":"217","volume-title":"Proc. USENIX Security Symposium","author":"Naor M.","year":"1998","unstructured":"M. Naor and K. Nissim . Certificate revocation and certificate update . In Proc. USENIX Security Symposium , pp. 217 -- 228 , 1998 . M. Naor and K. Nissim. Certificate revocation and certificate update. In Proc. USENIX Security Symposium, pp. 217--228, 1998."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30574-3_19"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535706_7"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77048-0_1"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/646278.687348"},{"key":"e_1_3_2_1_30_1","first-page":"53","volume-title":"Proc. Financial Cryptography (FC)","author":"Sander T.","year":"2000","unstructured":"T. Sander , A. Ta-Shma , and M. Yung . Blind, auditable membership proofs . In Proc. Financial Cryptography (FC) , pp. 53 -- 71 , 2000 . T. Sander, A. Ta-Shma, and M. Yung. Blind, auditable membership proofs. In Proc. Financial Cryptography (FC), pp. 53--71, 2000."},{"key":"e_1_3_2_1_31_1","unstructured":"V. Shoup. NTL: A library for doing number theory. http:\/\/www.shoup.net\/ntl\/.  V. Shoup. NTL: A library for doing number theory. http:\/\/www.shoup.net\/ntl\/."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39658-1_2"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_13"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72738-5_23"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77048-0_8"}],"event":{"name":"CCS08: 15th ACM Conference on Computer and Communications Security 2008","location":"Alexandria Virginia USA","acronym":"CCS08","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 15th ACM conference on Computer and communications security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1455770.1455826","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1455770.1455826","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:54:14Z","timestamp":1750287254000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1455770.1455826"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,27]]},"references-count":35,"alternative-id":["10.1145\/1455770.1455826","10.1145\/1455770"],"URL":"https:\/\/doi.org\/10.1145\/1455770.1455826","relation":{},"subject":[],"published":{"date-parts":[[2008,10,27]]},"assertion":[{"value":"2008-10-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}