{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,30]],"date-time":"2026-10-30T03:27:07Z","timestamp":1793330827696,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642227912","type":"print"},{"value":"9783642227929","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22792-9_6","type":"book-chapter","created":{"date-parts":[[2011,8,5]],"date-time":"2011-08-05T15:32:14Z","timestamp":1312558334000},"page":"91-110","source":"Crossref","is-referenced-by-count":89,"title":["Optimal Verification of Operations on Dynamic Sets"],"prefix":"10.1007","author":[{"given":"Charalampos","family":"Papamanthou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikos","family":"Triandopoulos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-642-14165-2_14","volume-title":"Automata, Languages and Programming","author":"B. Applebaum","year":"2010","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: From secrecy to soundness: Efficient verification via secure computation. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06198, pp. 152\u2013163. Springer, Heidelberg (2010)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Atallah, M.J., Cho, Y., Kundu, A.: Efficient data authentication in an environment of untrusted third-party distributors. In: Int. Conference on Data Engineering (ICDE), pp. 696\u2013704 (2008)","DOI":"10.1109\/ICDE.2008.4497478"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-642-00862-7_20","volume-title":"Topics in Cryptology \u2013 CT-RSA 2009","author":"M.H. Au","year":"2009","unstructured":"Au, M.H., Tsang, P.P., Susilo, W., Mu, Y.: Dynamic universal accumulators for DDH groups and their application to attribute-based anonymous credential systems. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol.\u00a05473, pp. 295\u2013308. Springer, Heidelberg (2009)"},{"key":"6_CR4","volume-title":"Modern Information Retrieval","author":"R. Baeza-Yates","year":"1999","unstructured":"Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval. Addison-Wesley Publishing Company, Reading (1999)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/3-540-69053-0_13","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"M. Bellare","year":"1997","unstructured":"Bellare, M., Micciancio, D.: A new paradigm for collision-free hashing: Incrementality at reduced cost. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 163\u2013192. Springer, Heidelberg (1997)"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Benabbas, S., Gennaro, R., Vahlis, Y.: Verifiable delegation of computation over large datasets. In: Int. Cryptology Conference, CRYPTO (2011)","DOI":"10.1007\/978-3-642-22792-9_7"},{"issue":"2\/3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF01185212","volume":"12","author":"M. Blum","year":"1994","unstructured":"Blum, M., Evans, W.S., Gemmell, P., Kannan, S., Naor, M.: Checking the correctness of memories. Algorithmica\u00a012(2\/3), 225\u2013244 (1994)","journal-title":"Algorithmica"},{"issue":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00145-007-9005-7","volume":"21","author":"D. Boneh","year":"2008","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles and the SDH assumption in bilinear groups. J. Cryptology\u00a021(2), 149\u2013177 (2008)","journal-title":"J. Cryptology"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-540-70936-7_29","volume-title":"Theory of Cryptography","author":"D. Boneh","year":"2007","unstructured":"Boneh, D., Waters, B.: Conjunctive, subset, and range queries on encrypted data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 535\u2013554. Springer, Heidelberg (2007)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-642-14577-3_9","volume-title":"Financial Cryptography and Data Security","author":"S. Canard","year":"2010","unstructured":"Canard, S., Gouget, A.: Multiple denominations in E-cash with compact transaction data. In: Sion, R. (ed.) FC 2010. LNCS, vol.\u00a06052, pp. 82\u201397. Springer, Heidelberg (2010)"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Chung, K.-M., Kalai, Y., Liu, F.-H., Raz, R.: Memory delegation. In: Int. Cryptology Conference, CRYPTO (2011)","DOI":"10.1007\/978-3-642-22792-9_9"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/978-3-642-14623-7_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"K.-M. Chung","year":"2010","unstructured":"Chung, K.-M., Kalai, Y., Vadhan, S.: Improved delegation of computation using fully homomorphic encryption. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 483\u2013501. Springer, Heidelberg (2010)"},{"key":"6_CR13","unstructured":"Damg\u00e5rd, I., Triandopoulos, N.: Supporting non-membership proofs with bilinear-map accumulators. Cryptology ePrint Archive, Report 2008\/538 (2008), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/978-3-642-00457-5_30","volume-title":"Theory of Cryptography","author":"C. Dwork","year":"2009","unstructured":"Dwork, C., Naor, M., Rothblum, G.N., Vaikuntanathan, V.: How efficient can memory checking be? In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 503\u2013520. Springer, Heidelberg (2009)"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24676-3_1","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M.J. Freedman","year":"2004","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 1\u201319. Springer, Heidelberg (2004)"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/978-3-642-14623-7_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"R. Gennaro","year":"2010","unstructured":"Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: Outsourcing computation to untrusted workers. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 465\u2013482. Springer, Heidelberg (2010)"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/3-540-45811-5_29","volume-title":"Information Security","author":"M.T. Goodrich","year":"2002","unstructured":"Goodrich, M.T., Tamassia, R., Hasic, J.: An efficient dynamic and distributed cryptographic accumulator. In: Chan, A.H., Gligor, V.D. (eds.) ISC 2002. LNCS, vol.\u00a02433, pp. 372\u2013388. Springer, Heidelberg (2002)"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Tamassia, R., Schwerin, A.: Implementation of an authenticated dictionary with skip lists and commutative hashing. In: DARPA Information Survivability Conference and Exposition II (DISCEX II), pp. 68\u201382 (2001)","DOI":"10.1109\/DISCEX.2001.932160"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-540-79263-5_26","volume-title":"Topics in Cryptology \u2013 CT-RSA 2008","author":"M.T. Goodrich","year":"2008","unstructured":"Goodrich, M.T., Tamassia, R., Triandopoulos, N.: Super-efficient verification of dynamic outsourced databases. In: Malkin, T. (ed.) CT-RSA 2008. LNCS, vol.\u00a04964, pp. 407\u2013424. Springer, Heidelberg (2008)"},{"issue":"3","key":"6_CR20","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/s00453-009-9355-7","volume":"60","author":"M.T. Goodrich","year":"2011","unstructured":"Goodrich, M.T., Tamassia, R., Triandopoulos, N.: Efficient authenticated data structures for graph connectivity and geometric search problems. Algorithmica\u00a060(3), 505\u2013552 (2011)","journal-title":"Algorithmica"},{"key":"6_CR21","unstructured":"Kratsch, D., McConnell, R.M., Mehlhorn, K., Spinrad, J.P.: Certifying algorithms for recognizing interval graphs and permutation graphs. In: Symposium on Discrete Algorithms (SODA), pp. 158\u2013167 (2003)"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-72738-5_17","volume-title":"Applied Cryptography and Network Security","author":"J. Li","year":"2007","unstructured":"Li, J., Li, N., Xue, R.: Universal accumulators with efficient nonmembership proofs. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol.\u00a04521, pp. 253\u2013269. Springer, Heidelberg (2007)"},{"issue":"1","key":"6_CR23","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00453-003-1076-8","volume":"39","author":"C. Martel","year":"2004","unstructured":"Martel, C., Nuckolls, G., Devanbu, P., Gertz, M., Kwong, A., Stubblebine, S.G.: A general model for authenticated data structures. Algorithmica\u00a039(1), 21\u201341 (2004)","journal-title":"Algorithmica"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/0-387-34805-0_21","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"R.C. Merkle","year":"1990","unstructured":"Merkle, R.C.: A certified digital signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 218\u2013238. Springer, Heidelberg (1990)"},{"issue":"9","key":"6_CR25","doi-asserted-by":"publisher","first-page":"2213","DOI":"10.1109\/TIT.2003.815784","volume":"49","author":"Y. Minsky","year":"2003","unstructured":"Minsky, Y., Trachtenberg, A., Zippel, R.: Set reconciliation with nearly optimal communication complexity. IEEE Transactions on Information Theory\u00a049(9), 2213\u20132218 (2003)","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Morselli, R., Bhattacharjee, S., Katz, J., Keleher, P.J.: Trust-preserving set operations. In: Int. Conference on Computer Communications, INFOCOM (2004)","DOI":"10.1109\/INFCOM.2004.1354646"},{"key":"6_CR27","unstructured":"Naor, M., Nissim, K.: Certificate revocation and certificate update. In: USENIX Security Symposium, pp. 217\u2013228 (1998)"},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-540-30574-3_19","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"L. Nguyen","year":"2005","unstructured":"Nguyen, L.: Accumulators from bilinear pairings and applications. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol.\u00a03376, pp. 275\u2013292. Springer, Heidelberg (2005)"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Pang, H., Tan, K.-L.: Authenticating query results in edge computing. In: Int. Conference on Data Engineering (ICDE), pp. 560\u2013571 (2004)","DOI":"10.1109\/ICDE.2004.1320027"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-77048-0_1","volume-title":"Information and Communications Security","author":"C. Papamanthou","year":"2007","unstructured":"Papamanthou, C., Tamassia, R.: Time and space efficient algorithms for two-party authenticated data structures. In: Qing, S., Imai, H., Wang, G. (eds.) ICICS 2007. LNCS, vol.\u00a04861, pp. 1\u201315. Springer, Heidelberg (2007)"},{"key":"6_CR31","unstructured":"Papamanthou, C., Tamassia, R.: Cryptography for efficiency: Authenticated data structures based on lattices and parallel online memory checking. In: Cryptology ePrint Archive, Report 2011\/102 (2011), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"Papamanthou, C., Tamassia, R., Triandopoulos, N.: Authenticated hash tables. In: Int. Conference on Computer and Communications Security (CCS), pp. 437\u2013448 (2008)","DOI":"10.1145\/1455770.1455826"},{"key":"6_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-642-17455-1_16","volume-title":"Pairing-Based Cryptography - Pairing 2010","author":"C. Papamanthou","year":"2010","unstructured":"Papamanthou, C., Tamassia, R., Triandopoulos, N.: Optimal authenticated data structures with multilinear forms. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol.\u00a06487, pp. 246\u2013264. Springer, Heidelberg (2010)"},{"issue":"139","key":"6_CR34","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1090\/S0025-5718-1977-0436662-8","volume":"31","author":"F.P. Preparata","year":"1977","unstructured":"Preparata, F.P., Sarwate, D.V.: Computational complexity of Fourier transforms over finite fields. Mathematics of Computation\u00a031(139), 740\u2013751 (1977)","journal-title":"Mathematics of Computation"},{"key":"6_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, New York (1985)"},{"key":"6_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-39658-1_2","volume-title":"Algorithms - ESA 2003","author":"R. Tamassia","year":"2003","unstructured":"Tamassia, R.: Authenticated data structures. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 2\u20135. Springer, Heidelberg (2003)"},{"key":"6_CR37","unstructured":"Tamassia, R., Triandopoulos, N.: Certification and authentication of data structures. In: Alberto Mendelzon Workshop on Foundations of Data Management (2010)"},{"key":"6_CR38","doi-asserted-by":"crossref","unstructured":"Yang, Y., Papadias, D., Papadopoulos, S., Kalnis, P.: Authenticated join processing in outsourced databases. In: Int. Conf. on Management of Data (SIGMOD), pp. 5\u201318 (2009)","DOI":"10.1145\/1559845.1559849"},{"key":"6_CR39","doi-asserted-by":"crossref","unstructured":"Yiu, M.L., Lin, Y., Mouratidis, K.: Efficient verification of shortest path search via authenticated hints. In: Int. Conference on Data Engineering (ICDE), pp. 237\u2013248 (2010)","DOI":"10.1109\/ICDE.2010.5447914"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22792-9_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T11:36:39Z","timestamp":1620041799000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22792-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642227912","9783642227929"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22792-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}