{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T04:15:00Z","timestamp":1768536900084,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642546303","type":"print"},{"value":"9783642546310","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54631-0_7","type":"book-chapter","created":{"date-parts":[[2014,2,20]],"date-time":"2014-02-20T10:04:17Z","timestamp":1392890657000},"page":"113-130","source":"Crossref","is-referenced-by-count":36,"title":["Verifiable Set Operations over Outsourced Databases"],"prefix":"10.1007","author":[{"given":"Ran","family":"Canetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omer","family":"Paneth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitrios","family":"Papadopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikos","family":"Triandopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Atallah, M.J., Cho, Y., Kundu, A.: Efficient data authentication in an environment of untrusted third-party distributors. In: ICDE, pp. 696\u2013704 (2008)","DOI":"10.1109\/ICDE.2008.4497478"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Ateniese, G., De Cristofaro, E., Tsudik, G.: (If) size matters: Size-hiding private set intersection. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol.\u00a06571, pp. 156\u2013173. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-19379-8_10"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Backes, M., Fiore, D., Reischuk, R.M.: Verifiable delegation of computation on outsourced data. Cryptology ePrint Archive. Report 2013\/469 (2013)","DOI":"10.1145\/2508859.2516681"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-40084-1_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"E. Ben-Sasson","year":"2013","unstructured":"Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E., Virza, M.: Snarks for c: Verifying program executions succinctly and in zero knowledge. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol.\u00a08043, pp. 90\u2013108. Springer, Heidelberg (2013)"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1145\/800204.806290","volume-title":"Proceedings of the Second ACM Symposium on Symbolic and Algebraic Manipulation, SYMSAC 1971","author":"E.R. Berlekamp","year":"1971","unstructured":"Berlekamp, E.R.: Factoring polynomials over large finite fields*. In: Proceedings of the Second ACM Symposium on Symbolic and Algebraic Manipulation, SYMSAC 1971, p. 223. ACM, New York (1971)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In: ITCS, pp. 326\u2013349 (2012)","DOI":"10.1145\/2090236.2090263"},{"key":"7_CR7","unstructured":"Bitansky, N., Canetti, R., Paneth, O., Rosen, A.: Indistinguishability obfuscation vs. auxiliary-input extractable functions: One must fall. Cryptology ePrint Archive, Report 2013\/641 (2013)"},{"issue":"2\/3","key":"7_CR8","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"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-24676-3_4","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 56\u201373. Springer, Heidelberg (2004)"},{"key":"7_CR10","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":"7_CR11","unstructured":"Boyle, E., Pass, R.: Limits of extractability assumptions with distributional auxiliary input. Cryptology ePrint Archive. Report 2013\/703 (2013)"},{"key":"7_CR12","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.L. Camenisch","year":"2002","unstructured":"Camenisch, J.L., Lysyanskaya, A.: Dynamic accumulators and application to efficient revocation of anonymous credentials. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 61\u201376. Springer, Heidelberg (2002)"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Canetti, R., Paneth, O., Papadopoulos, D., Triandopoulos, N.: Verifiable set operations over outsourced databases. Cryptology ePrint Archive. Report 2013\/724 (2013)","DOI":"10.1007\/978-3-642-54631-0_7"},{"issue":"13","key":"7_CR14","doi-asserted-by":"publisher","first-page":"1311","DOI":"10.1016\/j.dam.2011.04.021","volume":"159","author":"S. Chatterjee","year":"2011","unstructured":"Chatterjee, S., Menezes, A.: On cryptographic protocols employing asymmetric pairings - the role of psi revisited. Discrete Applied Mathematics\u00a0159(13), 1311\u20131322 (2011)","journal-title":"Discrete Applied Mathematics"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-642-22792-9_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"K.-M. Chung","year":"2011","unstructured":"Chung, K.-M., Kalai, Y.T., Liu, F.-H., Raz, R.: Memory delegation. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 151\u2013168. Springer, Heidelberg (2011)"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/3-540-46766-1_36","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"I.B. Damg\u00e5rd","year":"1992","unstructured":"Damg\u00e5rd, I.B.: Towards practical public key systems secure against chosen ciphertext attacks. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 445\u2013456. Springer, Heidelberg (1992)"},{"key":"7_CR17","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":"7_CR18","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)"},{"issue":"3","key":"7_CR19","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":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-17373-8_19","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"J. Groth","year":"2010","unstructured":"Groth, J.: Short pairing-based non-interactive zero-knowledge arguments. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 321\u2013340. Springer, Heidelberg (2010)"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/11535218_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"L. Kissner","year":"2005","unstructured":"Kissner, L., Song, D.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 241\u2013257. Springer, Heidelberg (2005)"},{"issue":"1","key":"7_CR22","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00453-003-1076-8","volume":"39","author":"C.U. Martel","year":"2004","unstructured":"Martel, C.U., Nuckolls, G., Devanbu, P.T., Gertz, M., Kwong, A., Stubblebine, S.G.: A general model for authenticated data structures. Algorithmica\u00a039(1), 21\u201341 (2004)","journal-title":"Algorithmica"},{"issue":"4","key":"7_CR23","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1109\/49.839932","volume":"18","author":"M. Naor","year":"2000","unstructured":"Naor, M., Nissim, K.: Certificate revocation and certificate update. IEEE Journal on Selected Areas in Communications\u00a018(4), 561\u2013570 (2000)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"7_CR24","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":"7_CR25","doi-asserted-by":"crossref","unstructured":"Papamanthou, C., Tamassia, R., Triandopoulos, N.: Authenticated hash tables. In: ACM CCS, pp. 437\u2013448 (2008)","DOI":"10.1145\/1455770.1455826"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-22792-9_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"C. Papamanthou","year":"2011","unstructured":"Papamanthou, C., Tamassia, R., Triandopoulos, N.: Optimal verification of operations on dynamic sets. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 91\u2013110. Springer, Heidelberg (2011)"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Parno, B., Howell, J., Gentry, C., Raykova, M.: Pinocchio: Nearly practical verifiable computation. In: IEEE SP Symposium, pp. 238\u2013252 (2013)","DOI":"10.1109\/SP.2013.47"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Preparata, F., Sarwate, D., I.\u00a0U. A. U.-C. C.\u00a0S. LAB: Computational Complexity of Fourier Transforms Over Finite Fields. DTIC (1976)","DOI":"10.2307\/2006007"},{"key":"7_CR29","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":"7_CR30","doi-asserted-by":"crossref","unstructured":"Yang, Y., Papadias, D., Papadopoulos, S., Kalnis, P.: Authenticated join processing in outsourced databases. In: SIGMOD Conference, pp. 5\u201318 (2009)","DOI":"10.1145\/1559845.1559849"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Yiu, M.L., Lin, Y., Mouratidis, K.: Efficient verification of shortest path search via authenticated hints. In: ICDE, pp. 237\u2013248 (2010)","DOI":"10.1109\/ICDE.2010.5447914"},{"key":"7_CR32","doi-asserted-by":"crossref","unstructured":"Zheng, Q., Xu, S., Ateniese, G.: Efficient query integrity for outsourced dynamic databases. IACR Cryptology ePrint Archive, 2012:493 (2012)","DOI":"10.1145\/2381913.2381927"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54631-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T22:05:15Z","timestamp":1746137115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54631-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642546303","9783642546310"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54631-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}