{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:51:43Z","timestamp":1742914303843,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319184906"},{"type":"electronic","value":"9783319184913"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18491-3_8","type":"book-chapter","created":{"date-parts":[[2015,4,29]],"date-time":"2015-04-29T11:37:47Z","timestamp":1430307467000},"page":"109-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Obscuring Provenance Confidential Information via Graph Transformation"],"prefix":"10.1007","author":[{"given":"Jamal","family":"Hussein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luc","family":"Moreau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimiro","family":"Sassone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,30]]},"reference":[{"unstructured":"Moreau, L., Missier, P.: PROV-DM: the PROV data model. Technical report, W3C Recommendation, W3C (2013). http:\/\/www.w3.org\/TR\/prov-dm\/","key":"8_CR1"},{"doi-asserted-by":"crossref","unstructured":"Davidson, S.B., Freire, J.: Provenance and scientific workflows: challenges and opportunities. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 1345\u20131350. ACM (2008)","key":"8_CR2","DOI":"10.1145\/1376616.1376772"},{"issue":"6","key":"8_CR3","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/MIS.2006.119","volume":"21","author":"T Kifor","year":"2006","unstructured":"Kifor, T., Varga, L., Vazquez-Salceda, J., Alvarez, S., Willmott, S., Miles, S., Moreau, L.: Provenance in agent-mediated healthcare systems. IEEE Intell. Syst. 21(6), 38\u201346 (2006)","journal-title":"IEEE Intell. Syst."},{"doi-asserted-by":"crossref","unstructured":"Lim, H.S., Moon, Y.S., Bertino, E.: Provenance-based trustworthiness assessment in sensor networks. In: Proceedings of the Seventh International Workshop on Data Management for Sensor Networks, pp. 2\u20137. ACM (2010)","key":"8_CR4","DOI":"10.1145\/1858158.1858162"},{"doi-asserted-by":"crossref","unstructured":"Cadenhead, T., Khadilkar, V., Kantarcioglu, M., Thuraisingham, B.: A language for provenance access control. In: Proceedings of the First ACM Conference on Data and Application Security and Privacy, pp. 133\u2013144. ACM (2011)","key":"8_CR5","DOI":"10.1145\/1943513.1943532"},{"unstructured":"Cheney, J., Missier, P., Moreau, L., DeNies, T.: Constraints of the PROV data model. Technical report, W3C Recommendation, W3C (2013). http:\/\/www.w3.org\/TR\/prov-constraints\/","key":"8_CR6"},{"key":"8_CR7","series-title":"Computing Science","volume-title":"Preserving Privacy in Shared Provenance Data","author":"P Missier","year":"2013","unstructured":"Missier, P.: Preserving Privacy in Shared Provenance Data. Computing Science. Newcastle University, Newcastle upon Tyne (2013)"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-642-22351-8_13","volume-title":"Scientific and Statistical Database Management","author":"SC Dey","year":"2011","unstructured":"Dey, S.C., Zinn, D., Lud\u00e4scher, B.: ProPub: towards a declarative approach for publishing customized, policy-aware provenance. In: Bayard Cushing, J., French, J., Bowers, S. (eds.) SSDBM 2011. LNCS, vol. 6809, pp. 225\u2013243. Springer, Berlin Heidelberg (2011)"},{"doi-asserted-by":"crossref","unstructured":"Davidson, S.B., Khanna, S., Roy, S., Stoyanovich, J., Tannen, V., Chen, Y.: On provenance and privacy. In: Proceedings of the 14th International Conference on Database Theory, pp. 3\u201310. ACM (2011)","key":"8_CR9","DOI":"10.1145\/1938551.1938554"},{"unstructured":"Moreau, L., Missier, P., Cheney, J., Soiland-Reyes, S.: PROV-N: the provenance notation. Technical report, W3C Recommendation, W3C (2013). http:\/\/www.w3.org\/TR\/prov-n\/","key":"8_CR10"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-33654-6_6","volume-title":"Graph Transformations","author":"B K\u00f6nig","year":"2012","unstructured":"K\u00f6nig, B., St\u00fcckrath, J.: Well-structured graph transformation systems with negative application conditions. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2012. LNCS, vol. 7562, pp. 81\u201395. Springer, Heidelberg (2012)"},{"doi-asserted-by":"crossref","unstructured":"Ehrig, H., Golas, U., Habel, A., Lambers, L., Orejas, F.: M-adhesive transformation systems with nested application conditions. Part 1: Parallelism, concurrency and amalgamation. Math. Struct. Comput. Sci. 93\u2013102 (2012)","key":"8_CR12","DOI":"10.3233\/FI-2012-705"},{"doi-asserted-by":"crossref","unstructured":"Cadenhead, T., Khadilkar, V., Kantarcioglu, M., Thuraisingham, B.: Transforming provenance using redaction. In: Proceedings of the 16th ACM Symposium on Access Control Models and Technologies, pp. 93\u2013102. ACM (2011)","key":"8_CR13","DOI":"10.1145\/1998441.1998456"},{"doi-asserted-by":"crossref","unstructured":"Dey, S., Ludascher, B.: A declarative approach to customize workflow provenance. In: Proceedings of the Joint EDBT\/ICDT 2013 Workshops, EDBT 2013, pp. 9\u201316. ACM, New York (2013)","key":"8_CR14","DOI":"10.1145\/2457317.2457320"},{"key":"8_CR15","series-title":"Computing Science","volume-title":"PRovenance Graph Abstraction by Node Grouping","author":"P Missier","year":"2013","unstructured":"Missier, P., Bryans, J., Gamble, C., Curcin, V., Danger, R.: PRovenance Graph Abstraction by Node Grouping. Computing Science. Newcastle University, Newcastle upon Tyne (2013)"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-16462-5_1","volume-title":"Provenance and Annotation of Data and Processes","author":"P Missier","year":"2015","unstructured":"Missier, P., Bryans, J., Gamble, C., Curcin, V., Danger, R.: ProvAbs: model, policy, and tooling for abstracting PROV graphs. In: Ludaescher, B., Plale, B. (eds.) IPAW 2014. LNCS, vol. 8628, pp. 3\u201315. Springer, Heidelberg (2015)"},{"issue":"8","key":"8_CR17","doi-asserted-by":"publisher","first-page":"518","DOI":"10.14778\/2002974.2002979","volume":"4","author":"B Blaustein","year":"2011","unstructured":"Blaustein, B., Chapman, A., Seligman, L., Allen, M.D., Rosenthal, A.: Surrogate parenthood: protected and informative graphs. Proc. VLDB Endowment 4(8), 518\u2013525 (2011)","journal-title":"Proc. VLDB Endowment"},{"doi-asserted-by":"crossref","unstructured":"Backstrom, L., Dwork, C., Kleinberg, J.: Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. In: Proceedings of the 16th International Conference on World Wide Web, pp. 181\u2013190. ACM (2007)","key":"8_CR18","DOI":"10.1145\/1242572.1242598"},{"doi-asserted-by":"crossref","unstructured":"Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., L\u00f6we, M.: Algebraic approaches to graph transformation-part i: basic concepts and double pushout approach. In: Handbook of Graph Grammars, pp. 163\u2013246 (1997)","key":"8_CR19","DOI":"10.1142\/9789812384720_0003"},{"doi-asserted-by":"crossref","unstructured":"Ehrig, H., Heckel, R., Korff, M., L\u00f6we, M., Ribeiro, L., Wagner, A., Corradini, A.: Algebraic approaches to graph transformation-part ii: single pushout approach and comparison with double pushout approach. In: Handbook of Graph Grammars, pp. 247\u2013312. Citeseer (1997)","key":"8_CR20","DOI":"10.1142\/9789812384720_0004"},{"issue":"3","key":"8_CR21","doi-asserted-by":"crossref","first-page":"287","DOI":"10.3233\/FI-1996-263404","volume":"26","author":"A Habel","year":"1996","unstructured":"Habel, A., Heckel, R., Taentzer, G.: Graph grammars with negative application conditions. Fundamenta Informaticae 26(3), 287\u2013313 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-31847-7_17","volume-title":"Formal Methods in Software and Systems Modeling","author":"A Habel","year":"2005","unstructured":"Habel, A., Pennemann, K.-H.: Nested constraints and application conditions for high-level structures. In: Kreowski, H.-J., Montanari, U., Orejas, F., Rozenberg, G., Taentzer, G. (eds.) Formal Methods. LNCS, vol. 3393, pp. 293\u2013308. Springer, Heidelberg (2005)"},{"issue":"4","key":"8_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00528ED1V01Y201308WBE007","volume":"3","author":"L Moreau","year":"2013","unstructured":"Moreau, L., Groth, P.: Provenance: an introduction to prov. Synth. Lect. Semant. Web Theor. Technol. 3(4), 1\u2013129 (2013)","journal-title":"Synth. Lect. Semant. Web Theor. Technol."},{"key":"8_CR24","volume-title":"Fundamentals of Algebraic Graph Transformation","author":"H Ehrig","year":"2006","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation, vol. 373. Springer, Heidelberg (2006)"},{"key":"8_CR25","first-page":"1","volume":"18","author":"A Rensink","year":"2009","unstructured":"Rensink, A., Kuperus, J.H.: Repotting the geraniums: on nested graph transformation rules. Electron. Commun. EASST 18, 1\u201315 (2009)","journal-title":"Electron. Commun. EASST"},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11841883_1","volume-title":"Graph Transformations","author":"A Rensink","year":"2006","unstructured":"Rensink, A.: Nested quantification in graph transformation rules. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 1\u201313. Springer, Heidelberg (2006)"}],"container-title":["IFIP Advances in Information and Communication Technology","Trust Management IX"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18491-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T13:54:45Z","timestamp":1598968485000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-18491-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319184906","9783319184913"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18491-3_8","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"30 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}