On provenance and privacy

  • Authors:
  • Susan B. Davidson;Sanjeev Khanna;Sudeepa Roy;Julia Stoyanovich;Val Tannen;Yi Chen

  • Affiliations:
  • University of Pennsylvania, Philadelphia;University of Pennsylvania, Philadelphia;University of Pennsylvania, Philadelphia;University of Pennsylvania, Philadelphia;University of Pennsylvania, Philadelphia;Arizona State University, Tempe

  • Venue:
  • Proceedings of the 14th International Conference on Database Theory
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Provenance in scientific workflows is a double-edged sword. On the one hand, recording information about the module executions used to produce a data item, as well as the parameter settings and intermediate data items passed between module executions, enables transparency and reproducibility of results. On the other hand, a scientific workflow often contains private or confidential data and uses proprietary modules. Hence, providing exact answers to provenance queries over all executions of the workflow may reveal private information. In this paper we discuss privacy concerns in scientific workflows -- data, module, and structural privacy - and frame several natural questions: (i) Can we formally analyze data, module, and structural privacy, giving provable privacy guarantees for an unlimited/bounded number of provenance queries? (ii) How can we answer search and structural queries over repositories of workflow specifications and their executions, providing as much information as possible to the user while still guaranteeing privacy? We then highlight some recent work in this area and point to several directions for future work.