Specifying Data Sharing Agreements

Authors:
Vipin Swarup;Len Seligman;Arnon Rosenthal
Affiliations:
The MITRE Corporation, USA;The MITRE Corporation, USA;The MITRE Corporation, USA
Venue:
POLICY '06 Proceedings of the Seventh IEEE International Workshop on Policies for Distributed Systems and Networks
Year:
2006

Citing 0
Cited 4

CNL4DSA: a controlled natural language for data sharing agreements

Proceedings of the 2010 ACM Symposium on Applied Computing
Policy models for data sharing

ER'06 Proceedings of the 25th international conference on Conceptual Modeling
A data sharing agreement framework

ICISS'06 Proceedings of the Second international conference on Information Systems Security
A design phase for data sharing agreements

DPM'11 Proceedings of the 6th international conference, and 4th international conference on Data Privacy Management and Autonomous Spontaneus Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

When consumers build value-added services on top of data resources they do not control, they need to manage their information supply chains to ensure that their data suppliers produce and supply required data as needed. Producers also need to manage their information supply chains to ensure that their data is disseminated and protected appropriately. In this paper, we present a novel model for data sharing agreements that supports a wide variety of data sharing policies. The model is based on distributed temporal logic (DTL) predicates that are expressed over events in dataflow graphs. A dataflow graph's nodes are principals with local stores, and its edges are (typed) channels along which data flows. We illustrate the model via examples and discuss the kinds of analyses enabled by the model.