{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:34:58Z","timestamp":1743096898088,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319611754"},{"type":"electronic","value":"9783319611761"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-61176-1_17","type":"book-chapter","created":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T01:54:25Z","timestamp":1498010065000},"page":"311-324","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Budget-Constrained Result Integrity Verification of Outsourced Data Mining Computations"],"prefix":"10.1007","author":[{"given":"Bo","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boxiang","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wendy","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,22]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Babai, L.: Trading group theory for randomness. In: Symposium on Theory of Computing (1985)","DOI":"10.1145\/22145.22192"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-22792-9_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"S Benabbas","year":"2011","unstructured":"Benabbas, S., Gennaro, R., Vahlis, Y.: Verifiable delegation of computation over large datasets. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 111\u2013131. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-22792-9_7"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1007\/11687238_48","volume-title":"Advances in Database Technology - EDBT 2006","author":"J Bleiholder","year":"2006","unstructured":"Bleiholder, J., Khuller, S., Naumann, F., Raschid, L., Wu, Y.: Query planning in the presence of overlapping sources. In: Ioannidis, Y., Scholl, M.H., Schmidt, J.W., Matthes, F., Hatzopoulos, M., Boehm, K., Kemper, A., Grust, T., Boehm, C. (eds.) EDBT 2006. LNCS, vol. 3896, pp. 811\u2013828. Springer, Heidelberg (2006). doi:10.1007\/11687238_48"},{"key":"17_CR4","unstructured":"Chen, T.Y., et al.: Metamorphic testing: a new approach for generating next test cases. Technical report, Hong Kong University of Science and Technology (1998)"},{"key":"17_CR5","unstructured":"Chen, T.Y., et al.: Fault-based testing in the absence of an oracle. In: International Conference on Computer Software and Applications (2001)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Curtis, D.E., et al.: Budgeted maximum coverage with overlapping costs: monitoring the emerging infections network. In: Algorithm Engineering & Expermiments (2010)","DOI":"10.1137\/1.9781611972900.11"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Dong, B., et al.: Integrity verification of outsourced frequent itemset mining with deterministic guarantee. In: ICDM (2013)","DOI":"10.1109\/ICDM.2013.81"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-642-39256-6_17","volume-title":"Data and Applications Security and Privacy XXVII","author":"B Dong","year":"2013","unstructured":"Dong, B., Liu, R., Wang, H.W.: Result integrity verification of outsourced frequent itemset mining. In: Wang, L., Shafiq, B. (eds.) DBSec 2013. LNCS, vol. 7964, pp. 258\u2013265. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-39256-6_17"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. 6223, pp. 465\u2013482. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-14623-7_25"},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"Goldwasser, S., et al.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Han, J., et al.: Mining frequent patterns without candidate generation. In: ACM Sigmod Record (2000)","DOI":"10.1145\/342009.335372"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Kanewala, U., et al.: Techniques for testing scientific programs without an oracle. In: International Workshop on Software Engineering for Computational Science and Engineering (2013)","DOI":"10.1109\/SECSE.2013.6615099"},{"issue":"1","key":"17_CR13","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S Khuller","year":"1999","unstructured":"Khuller, S., et al.: The budgeted maximum coverage problem. Inf. Process Lett. 70(1), 39\u201345 (1999)","journal-title":"Inf. Process Lett."},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-33486-3_1","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"R Liu","year":"2012","unstructured":"Liu, R., Wang, H.W., Monreale, A., Pedreschi, D., Giannotti, F., Guo, W.: AUDIO: An integrity $$\\underline{audi}$$ting framework of $$\\underline{o}$$utlier-mining-as-a-service systems. In: Flach, P.A., Bie, T., Cristianini, N. (eds.) ECML PKDD 2012. LNCS, vol. 7524, pp. 1\u201318. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-33486-3_1"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Liu, R., et al.: Integrity verification of k-means clustering outsourced to infrastructure as a service (IAAS) providers. In: SDM (2013)","DOI":"10.1137\/1.9781611972832.70"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Liu, R., et al.: Result integrity verification of outsourced Bayesian network structure learning. In: SDM (2014)","DOI":"10.1137\/1.9781611973440.82"},{"key":"17_CR17","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. 6841, pp. 91\u2013110. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-22792-9_6"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-642-28914-9_24","volume-title":"Theory of Cryptography","author":"B Parno","year":"2012","unstructured":"Parno, B., Raykova, M., Vaikuntanathan, V.: How to delegate and verify in public: verifiable computation from attribute-based encryption. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 422\u2013439. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-28914-9_24"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Sindelar, M., et al.: Sharing-aware algorithms for virtual machine colocation. In: Symposium on Parallelism in Algorithms and Architectures (2011)","DOI":"10.1145\/1989493.1989554"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Vaidya, J., et al.: Efficient integrity verification for outsourced collaborative filtering. In: ICDM (2014)","DOI":"10.1109\/ICDM.2014.145"},{"key":"17_CR21","unstructured":"Wong, W.K., et al.: Security in outsourcing of association rule mining. In: VLDB (2007)"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, B., et al.: Budget-constrained result integrity verification of outsourced data mining computations (2017). http:\/\/www.cs.stevens.edu\/ hwang4\/papers\/dbsec2017full.pdf","DOI":"10.1007\/978-3-319-61176-1_17"}],"container-title":["Lecture Notes in Computer Science","Data and Applications Security and Privacy XXXI"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-61176-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:49:21Z","timestamp":1710344961000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-61176-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319611754","9783319611761"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-61176-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"22 June 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DBSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP Annual Conference on Data and Applications Security and Privacy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Philadelphia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dbsec2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dbsec2017.ittc.ku.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}