{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T06:36:59Z","timestamp":1794379019263,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540275800","type":"print"},{"value":"9783540316916","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11523468_13","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T14:58:59Z","timestamp":1279465139000},"page":"153-165","source":"Crossref","is-referenced-by-count":30,"title":["Computational Bounds on Hierarchical Data Processing with Applications to Information Security"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Tamassia","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikos","family":"Triandopoulos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-45708-9_5","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J. Camenisch","year":"2002","unstructured":"Camenisch, J., Lysyanskaya, A.: Dynamic accumulators and application to efficient revocation of anonymous credentials. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, p. 61. Springer, Heidelberg (2002)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/3-540-48910-X_32","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Canetti","year":"1999","unstructured":"Canetti, R., Malkin, T., Nissim, K.: Efficient communication - storage tradeoffs for multicast encryption. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, p. 459. Springer, Heidelberg (1999)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Devanbu, P., Gertz, M., Martel, C., Stubblebine, S.G.: Authentic data publication over the Internet. Journal of Computer Security\u00a011(3) (2003)","DOI":"10.3233\/JCS-2003-11302"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Tamassia, R., Hasic, J.: An efficient dynamic and distributed cryptographic accumulator. In: Proc. ISC (2002)","DOI":"10.1007\/3-540-45811-5_29"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Tamassia, R., Schwerin, A.: Implementation of an authenticated dictionary with skip lists and commutative hashing. In: Proc. DISCEX (2001)","DOI":"10.1109\/DISCEX.2001.932160"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Tamassia, R., Triandopoulos, N., Cohen, R.: Authenticated data structures for graph and geometric searching. In: Proc. RSA-CT (2003)","DOI":"10.1007\/3-540-36563-X_20"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Martel, C., Nuckolls, G., Devanbu, P., Gertz, M., Kwong, A., Stubblebine, S.G.: A general model for authenticated data structures. Algorithmica\u00a039(1) (2004)","DOI":"10.1007\/s00453-003-1076-8"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Micali, S., Rabin, M., Kilian, J.: Zero-Knowledge sets. In: Proc. FOCS (2003)","DOI":"10.1109\/SFCS.2003.1238183"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-540-24676-3_10","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Micciancio","year":"2004","unstructured":"Micciancio, D., Panjwani, S.: Optimal communication complexity of generic multicast key distribution. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 153\u2013170. Springer, Heidelberg (2004)"},{"key":"13_CR10","unstructured":"Naor, M., Nissim, K.: Certificate revocation and certificate update. In: Proc. USENIX Security (1998)"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Rackoff, C., Smith, A.: Efficient consistency proofs for generalized queries on a committed database. In: Proc. ICALP (2004)","DOI":"10.1007\/978-3-540-27836-8_87"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. CACM\u00a033(6) (1990)","DOI":"10.1145\/78973.78977"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Snoeyink, J., Suri, S., Varghese, G.: A lower bound for multicast key distribution. In: Proc. INFOCOMM (2001)","DOI":"10.1109\/INFCOM.2001.916725"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Tamassia, R., Triandopoulos, N.: Computational bounds on hierarchical data processing with applications to information security, Brown University (2005) (manuscript) Full version http:\/\/www.cs.brown.edu\/cgc\/stms\/papers\/cbhdp.pdf","DOI":"10.1007\/11523468_13"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Wong, C.K., Gouda, M., Lam, S.S.: Secure group communications using key graphs. IEEE\/ACM Transactions on Networking\u00a08(1) (2000)","DOI":"10.1109\/90.836475"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11523468_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:06:02Z","timestamp":1605625562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11523468_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540275800","9783540316916"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11523468_13","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11523468","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}