ProPub: Towards a Declarative Approach for Publishing Customized, Policy-Aware Provenance

Dey, Saumen; Zinn, Daniel; Ludäscher, Bertram

doi:10.1007/978-3-642-22351-8_13

Cited by 18 publications

(31 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The problem of abstracting over provenance in such a more general setting has been addressed in later work, notably the ProPub system [3]. Here the main goal is to ensure that sensitive elements of the trace are abstracted out, by means of a redaction process.…”

Section: Abstracting Provenancementioning

confidence: 99%

“…Following common practice, we view a set I of such binary relation instances as a digraph G = (V, E), where V = En ∪ Act and E is a set of labelled edges, and where x r ← − y ∈ E iff r(x, y) ∈ I. 3 Finally, we denote the set of all such provenance graphs as PG gu/ea , to indicate that they only contain genBy and used relations amongst En and Act nodes. Fig.…”

Section: Essential Provmentioning

confidence: 99%

See 1 more Smart Citation

ProvAbs: Model, Policy, and Tooling for Abstracting PROV Graphs

Missier

Bryans

Gamble

et al. 2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Provenance metadata can be valuable in data sharing settings, where it can be used to help data consumers form judgements regarding the reliability of the data produced by third parties. However, some parts of provenance may be sensitive, requiring access control, or they may need to be simplified for the intended audience. Both these issues can be addressed by a single mechanism for creating abstractions over provenance, coupled with a policy model to drive the abstraction. Such mechanism, which we refer to as abstraction by grouping, simultaneously achieves partial disclosure of provenance, and facilitates its consumption. In this paper we introduce a formal foundation for this type of abstraction, grounded in the W3C PROV model; describe the associated policy model; and briefly present its implementation, the ProvAbs tool for interactive experimentation with policies and abstractions.

show abstract

Section: Abstracting Provenancementioning

confidence: 99%

Section: Essential Provmentioning

confidence: 99%

ProvAbs: Model, Policy, and Tooling for Abstracting PROV Graphs

Missier

Bryans

Gamble

et al. 2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…For instance, if a → b and b → c for some transitive relation, confidential information in b, and subsequent deletion of b, will prevent us from inferring a → c. Such a problem is being referred to as false independency [7] since the transformed graph may lead us to believe that a and c are unrelated (in the sense that one has no influence over the other [1]). Likewise, one needs to ensure that a transformed provenance graph does not enable the inference of nodes or edges that cannot be inferred from the original graph, a problem referred to as false dependency [8]. The problems of false dependency and independency have not been considered together by previous work on provenance privacy protection [5,9], but should critically be addressed in order to maintain the usefulness of provenance in establishing trust of data.…”

Section: Introductionmentioning

confidence: 99%

Obscuring Provenance Confidential Information via Graph Transformation

Hussein

Moreau

Sassone

2015

Trust Management IX

View full text Add to dashboard Cite

Abstract. Provenance is a record that describes the people, institutions, entities, and activities involved in producing, influencing, or delivering a piece of data or a thing. In particular, the provenance of information is crucial in deciding whether information is to be trusted. PROV is a recent W3C specification for sharing provenance over the Web. However, provenance records may expose confidential information, such as identity of agents or specific attributes of entities or activities. It is therefore essential for confidential information to be obscured before sharing provenance. This paper describes PROV-GTS, a provenance graph transformation system, whose principled definition is based on PROV properties, and which seeks to avoid false independencies and false dependencies. PROV-GTS is shown to preserve graph integrity, to be terminating and to be confluent.

show abstract

“…There is also some work directly addressing security for provenance [20,32,15,23,6,24]. Chong [20] gave (to our knowledge) the first candidate formal definitions of data security and provenance security using a trace semantics, based in part on earlier, unpublished work of ours on traces and provenance [16].…”

Section: Introductionmentioning

confidence: 99%

“…Blaustein et al [6] studied the problem of rewriting provenance graphs to hide information while still satisfying some plausibility constraints. Dey et al [24] studied provenance publishing policies, aimed at giving users greater control over what information is shown and hidden. They developed a system called ProPub equipped with well-defined publishing and hiding operators, along with constraints that such policies should satisfy.…”

Section: Introductionmentioning

confidence: 99%

A core calculus for provenance

Acar

Ahmed

Cheney

et al. 2013

JCS

View full text Add to dashboard Cite

Provenance is an increasing concern due to the ongoing revolution in sharing and processing scientific data on the Web and in other computer systems. It is proposed that many computer systems will need to become provenanceaware in order to provide satisfactory accountability, reproducibility, and trust for scientific or other high-value data. To date, there is not a consensus concerning appropriate formal models or security properties for provenance. In previous work, we introduced a formal framework for provenance security and proposed formal definitions of properties called disclosure and obfuscation.In this article, we study refined notions of positive and negative disclosure and obfuscation in a concrete setting, that of a general-purpose programing language. Previous models of provenance have focused on special-purpose languages such as workflows and database queries. We consider a higher-order, functional language with sums, products, and recursive types and functions, and equip it with a tracing semantics in which traces themselves can be replayed as computations. We present an annotation-propagation framework that supports many provenance views over traces, including standard forms of provenance studied previously. We investigate some relationships among provenance views and develop some partial solutions to the disclosure and obfuscation problems, including correct algorithms for disclosure and positive obfuscation based on trace slicing.

show abstract

ProPub: Towards a Declarative Approach for Publishing Customized, Policy-Aware Provenance

Cited by 18 publications

References 25 publications

ProvAbs: Model, Policy, and Tooling for Abstracting PROV Graphs

ProvAbs: Model, Policy, and Tooling for Abstracting PROV Graphs

Obscuring Provenance Confidential Information via Graph Transformation

A core calculus for provenance

Contact Info

Product

Resources

About