loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Seventh IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY'06)
Specifying Data Sharing Agreements
London, Ontario, Canada
June 05-June 07
ISBN: 0-7695-2598-9
Vipin Swarup, The MITRE Corporation, USA
Len Seligman, The MITRE Corporation, USA
Arnon Rosenthal, The MITRE Corporation, USA
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.
Citation:
Vipin Swarup, Len Seligman, Arnon Rosenthal, "Specifying Data Sharing Agreements," policy, pp.157-162, Seventh IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.